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

Algebra & Modern Mathematics question bank (Numerical Ability & Quantitative Aptitude)

Practice 5,056 free Campus Placements & IT Recruitment - Aptitude (TCS NQT & IT Majors) Numerical Ability & Quantitative Aptitude - Algebra & Modern Mathematics questions with answers and step-by-step solutions.

Start free Book a demo
All Hard Medium
Q1.
[Data Structures & Algorithms - Technical Interview #1] What is the worst-case time complexity of QuickSort when the partition element is repeatedly chosen as the minimum or maximum element?

(A)
O(log N)
(B)
O(N^2)
(C)
O(N)
(D)
O(N 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 #3] 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
Protected Questions

Unlock All 2529 Questions in Algebra & Modern Mathematics

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

Sign in to unlock Create free account

Sign up free to access all 2,529 questions

Unlock every Algebra & Modern Mathematics question, generate papers, and practice at your own pace.

Start free