NTANET (Based on NTAUGC) Computer Science (PaperII): Questions 48  52 of 2012
Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exampattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.
Rs. 550.00 or
How to register?
Question number: 48
» Analysis and Design of Algorithms » Analysis of Algorithms
Appeared in Year: 2015
Question
FloydWarshall algorithm utilizes …………… to solve the allpairs shortest paths problem on a directed graph in ……………. time. (December)
Choices
Choice (4)  Response  

a.  Greedy algorithm, θ (V^{2} lgn) 

b.  Dynamic programming, θ (V^{3}) 

c.  Greedy algorithm, θ (V^{3}) 

d.  Dynamic programming, θ (V^{2} lgn) 

Question number: 49
» Fuzzy Systems » Fuzzy Logic Tools
Appeared in Year: 2015
Question
A bellshaped membership function is specified by three parameters (a, b, c) as follows: (December)
Choices
Choice (4)  Response  

a. 


b. 


c. 


d. 


Question number: 50
» Computer Graphics » Graphic Standard
Appeared in Year: 2015
Question
Which of the following graphic primitives are considered as the basic building blocks of computer graphics?
(1) Points
(2) Lines
(3) Polylines
(4) Polygons (December)
Choices
Choice (4)  Response  

a.  (1), (2) and (3) 

b.  (1) only 

c.  (1) and (2) 

d.  (1), (2), (3) and (4) 

Question number: 51
» System Software and Compilers » Context Free Grammars
Appeared in Year: 2015
Question
The context free grammar given by
(December)
Choices
Choice (4)  Response  

a.  (a + b) (bbb) (a + b) * 

b.  (a + b) *bbb 

c.  abbb (a + b) * 

d.  (a + b) * (bbb) (a + b) * 

Question number: 52
» Computer Graphics » Graphic Standard
Appeared in Year: 2015
Question
Which raster locations would be chosen by Bresenham’s algorithm when scan converting a line from (1,1) to (8,5)? (December)
Choices
Choice (4)  Response  

a. 

 
b. 

 
c. 

 
d. 

