Analysis and Design of Algorithms-Unsolvable Problems and Computational Complexity [NTA-NET (UGC-NET) Computer Science & Applications (87)]: Questions 1 - 2 of 2

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: 2018

Question MCQ▾

The second smallest of n elements can be found with ________ comparisons in the worst case. (Dec)

Choices

Choice (4)Response

a.

b.

c.

Lg n

d.

Edit

Question 2

Appeared in Year: 2018

Question MCQ▾

Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node a, pointer to this node is q, form the list? (Dec)

Choices

Choice (4)Response

a.

O (n)

b.

O (lg n)

c.

O (n lg n)

d.

O (1)

Edit