Campus Placements & IT Recruitment - Aptitude (TCS NQT & IT Majors)

Analytical & Logical Reasoning question bank (Reasoning Ability & Logical Deduction)

Practice 5,056 free Campus Placements & IT Recruitment - Aptitude (TCS NQT & IT Majors) Reasoning Ability & Logical Deduction - Analytical & Logical Reasoning questions with answers and step-by-step solutions.

Q1.
[Data Structures & Algorithms - Technical Interview #2] What is the worst-case time complexity of QuickSort when the partition element is repeatedly chosen as the minimum or maximum element?

(A)
O(N)
(B)
O(N log N)
(C)
O(N^2)
(D)
O(log N)
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Q2.
[Data Structures & Algorithms - Technical Interview #4] What is the worst-case time complexity of QuickSort when the partition element is repeatedly chosen as the minimum or maximum element?

(A)
O(N log N)
(B)
O(log N)
(C)
O(N)
(D)
O(N^2)
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Protected Questions

Unlock All 2527 Questions in Analytical & Logical Reasoning

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign up free to access all 2,527 questions

Unlock every Analytical & Logical Reasoning question, generate papers, and practice at your own pace.