Analysis and Design of AlgorithmsRecursion and NonRecursion Algorithms (NTANET (Based on NTAUGC) Computer Science (PaperII)): Questions 1  4 of 6
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 » 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: 2
» 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 

Question number: 3
» Analysis and Design of Algorithms » Recursion and NonRecursion Algorithms
Appeared in Year: 2016
Question
Match the following:
ListⅠ (Group I)  ListⅡ (Group II) 

(A) Quicksort  (i)

(B) Activity selection problem  (ii)

(C) Huffman codes  (iii)

(D) Optimal polygon triangulation  (iv)

Choices
Choice (4)  Response  

 
a. 


b. 


c. 


d. 


Question number: 4
» Analysis and Design of Algorithms » Recursion and NonRecursion Algorithms
Appeared in Year: 2011
Question
Which of the following is a bad example of recursion? (December Paper II)
Choices
Choice (4)  Response  

a.  Fibonacci numbers 

b.  Tower of Hanai 

c.  Tree traversal 

d.  Factorial 
