Analysis and Design of Algorithms-Recursion and Non-Recursion Algorithms [NTA-NET (UGC-NET) Computer Science & Applications (87)]: Questions 1 - 4 of 6
Choose Programs:
⏳ 🎯 Online Tests (4 Tests [100 questions each]): NTA Pattern, Analytics & Explanations
Rs. 800.00 -OR-
3 Year Validity (Multiple Devices)
Sample TestsDetailsSee Demo
🎓 Study Material (2083 Notes): 2024-2025 Syllabus
Rs. 1250.00 -OR-
3 Year Validity (Multiple Devices)
Topic-wise Notes & SampleDetails
🎯 2699 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)
Rs. 600.00 -OR-
3 Year Validity (Multiple Devices)
CoverageDetailsSample Explanation
Help me Choose & Register (Watch Video) Already Subscribed?
Question 1
Appeared in Year: 2015
Question MCQ▾
In general, in a recursive and non-recursive implementation of a problem (program) :
Choices
Choice (4) | Response | |
---|---|---|
a. | Space complexity is better in recursive version but time complexity is better in non-recursive version of the program | |
b. | Time complexity is better in recursive version but space complexity is better in non-recursive version of the program | |
c. | Time and space complexities are better in recursive than in non-recursive program | |
d. | Time and space complexities are better in non-recursive than in recursive program |
Question 2
Appeared in Year: 2015
Question MCQ▾
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 3
Appeared in Year: 2016
Question Match List-Ⅰ List-Ⅱ▾
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 4
Appeared in Year: 2011
Question MCQ▾
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 |