Analysis and Design of AlgorithmsAnalysis of Algorithms [NTANET (Based on NTAUGC) Computer Science (PaperII)]: Questions 1  5 of 34
Access detailed explanations (illustrated with images and videos) to 2202 questions. Access all new questions we will add tracking exampattern and syllabus changes. Unlimited Access for Unlimited Time!
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 » 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: 3
» 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: 4
» Analysis and Design of Algorithms » Analysis of Algorithms
Appeared in Year: 2016
Question
Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alphabeta pruning?
Choices
Choice (4)  Response  

a.  GHI  
b.  I  
c.  HI  
d.  CHI 
Question number: 5
» Analysis and Design of Algorithms » Analysis of Algorithms
Appeared in Year: 2012
Question
Let be the function defined by which of the following is TRUE? (December Paper III)
Choices
Choice (4)  Response  

a. 
 
b. 
 
c. 
 
d. 
