Analysis and Design of Algorithms-Recursion and Non-Recursion Algorithms [NTA-NET (Based on NTA-UGC) Computer Science (Paper-II)]: Questions 1 - 4 of 6

Access detailed explanations (illustrated with images and videos) to 2202 questions. Access all new questions we will add tracking exam-pattern 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 » Recursion and Non-Recursion Algorithms

Edit

Appeared in Year: 2015

MCQ▾

Question

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 number: 2

» Analysis and Design of Algorithms » Recursion and Non-Recursion Algorithms

Edit

Appeared in Year: 2015

MCQ▾

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 Non-Recursion Algorithms

Edit

Appeared in Year: 2016

Match List-Ⅰ List-Ⅱ▾

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)

a.

• (iv)
• (iii)
• (ii)
• (i)

b.

• (i)
• (iv)
• (ii)
• (iii)

c.

• (ii)
• (i)
• (iii)
• (iv)

d.

• (iv)
• (i)
• (iii)
• (ii)

Question number: 4

» Analysis and Design of Algorithms » Recursion and Non-Recursion Algorithms

Edit

Appeared in Year: 2011

MCQ▾

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

Developed by: