Analysis and Design of Algorithms-Analysis of Algorithms [NTA-NET (UGC-NET) Computer Science & Applications (87)]: Questions 6 - 11 of 35

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 6

Appeared in Year: 2012

Question MCQ▾

Suppose there are sorted lists of n elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure) . (December Paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 7

Appeared in Year: 2013

Question MCQ▾

Give as good a big – O estimate as possible for the following functions:

(June Paper II)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 8

Appeared in Year: 2013

Question MCQ▾

The solution of recurrence relation, is (June Paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 9

Appeared in Year: 2013

Question MCQ▾

Given two sorted list of size respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (December Paper-II)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 10

Appeared in Year: 2013

Question MCQ▾

Assuming there are n keys and each key is in the range [0, m – 1] . The run time of bucket sort is (December paper III)

Choices

Choice (4)Response

a.

O (n lgn)

b.

O (n lgm)

c.

O (n + m)

d.

O (n)

Edit

Question 11

Appeared in Year: 2017

Question MCQ▾

Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take ________ time in the worst case. (January Paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit