Analysis and Design of Algorithms (NTANET (Based on NTAUGC) Computer Science (PaperII)): Questions 1  5 of 72
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: 1
» Analysis and Design of Algorithms » Analysis of Algorithms
Appeared in Year: 2015
Question
An ideal sort is an inplacesort whose additional space requirement is …………… (December)
Choices
Choice (4)  Response  

a.  O (log2n) 

b.  O (1) 

c.  O (n) 

d.  O (nlog2n) 

Question number: 2
» Analysis and Design of Algorithms » Recursion and NonRecursion Algorithms
Appeared in Year: 2015
Question
In general, in a recursive and nonrecursive implementation of a problem (program):
Choices
Choice (4)  Response  

a.  Space complexity is better in recursive version but time complexity is better in nonrecursive version of the program 

b.  Time complexity is better in recursive version but space complexity is better in nonrecursive version of the program 

c.  Time and space complexities are better in recursive than in nonrecursive program 

d.  Time and space complexities are better in nonrecursive than in recursive program 

Question number: 3
» 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: 4
» Analysis and Design of Algorithms » Analysis of Algorithms
Appeared in Year: 2015
Question
Given two sequences X and Y:
X = < a, b, c, b, d, a, b >
Y = < b, d, c, a, b, a >
The longest common subsequence of X and Y is: (December)
Choices
Choice (4)  Response  

a.  < b, c, a > 

b.  < b, c, a, a > 

c.  < b, c, b, a > 

d.  < c, a, b > 

Question number: 5
» Analysis and Design of Algorithms » Recursion and NonRecursion Algorithms
Appeared in Year: 2015
Question
The solution of the recurrence relation:
Choices
Choice (4)  Response  

a.  O (lg n) 

b.  O (n) 

c.  O (n l gn) 

d.  None of the above 
