Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

Which of the following algorithm design techniques is used in the quick sort algorithm?

This question was previously asked in
ESE Electronics 2014 Paper 2: Official Paper
Attempt Online
View all UPSC IES Papers >
  1. Dynamic programming
  2. Backtracking
  3. Divide and conquer
  4. Greedy method

Answer (Detailed Solution Below)

Option 3 : Divide and conquer
Free Tests
View all Free tests >
Free
ST 1: UPSC ESE (IES) Civil - Building Materials
6.1 K Users
20 Questions 40 Marks 24 Mins
Start Now

Detailed Solution

Download Solution PDF

Concept:

Quick Sort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array.

Important Points:

  • Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves.
  • Both Merge Sort and quicksort are based on the divide and conquer method.
Download Solution PDF
Latest UPSC IES Updates

Last updated on May 28, 2025

->  UPSC ESE admit card 2025 for the prelims exam has been released. 

-> The UPSC IES Prelims 2025 will be held on 8th June 2025.

-> The selection process includes a Prelims and a Mains Examination, followed by a Personality Test/Interview.

-> Candidates should attempt the UPSC IES mock tests to increase their efficiency. The UPSC IES previous year papers can be downloaded here.

More Divide and Conquer Questions

Q1.Which of the following is not a divide and conquer method
Q2.Let Xij =I { zi is compared to zj in quick sort algorithm} is an indicator variable, and zi is the ith smallest number. Which of the following sequence of the numbers give the X2,5 = 1? Note: Assume that there is a divide and conquer quick sort algorithm and in partition algorithm the first element of the lists is taken as pivot-element.
Q3.What is the product of following matrix using Strassen's matrix multiplication algorithm? \(A=\begin{bmatrix}1 & 3 \\\ 5 & 7 \end{bmatrix} \ \ \ \ B = \begin{bmatrix}8 & 4 \\\ 6 & 2 \end{bmatrix}\)
Q4.The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is  ________
Q5.Consider the following table:  Algorithms  Design Paradigms  (P) Kruskal  (i) Divide and Conquer  (Q) Quicksort  (ii) Greedy  (R) Floyd-Warshall  (iii) Dynamic Programming   Match the algorithms to the design paradigms they are based on.
Q6.Consider a sequence of 14 elements: A = [−5, −10, 6, 3, −1, −2, 13, 4, −9, −1, 4, 12, −3, 0]. The subsequence sum \(S\left( {i,j} \right) = \mathop \sum \nolimits_{k = i}^j A\left[ k \right]\). Determine the maximum of S(i, j), where 0 ≤ i ≤ j < 14. (Divide and conquer approach may be used.)
Q7.A sorting technique is called stable if
Q8. Match the following and choose the correct answer for the order A, B, C, D. A. Strassen matrix multiplication p. Decrease and Conquer B. Insertion sort q. Dynamic Programming C. Gaussian Elimination r. Divide and Conquer D. Floyd shortest path algorithm s. Transform and Conquer
Q9.An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is

More Algorithm Design Techniques Questions

Q1.In what manner is a state-space tree for a backtracking algorithm constructed ? 
Q2.The time complexity of solving the Longest Common Subsequence problem using Dynamic Programming is : (m and n are lengths of subsequences) 
Q3.Given the following characteristics : (i) Optimal substructure (ii) Overlapping subproblems (iii) Memorization (iv) Decrease and conquer Dynamic programming has the following characteristics :
Q4.Match the LIST-I with LIST-II LIST - I LIST - II A. Breadth First Search I. LISP B. Depth First Search II. Syntax tree C. Prefix III. Stack D. Infix IV. Queue Choose the correct answer from the options given below:
Q5.Which one of the following is not related to the feed forward networks on the Backpropagation Algorithm
Q6.Which of the following is not a divide and conquer method
Q7.Which one of the diagrams is used to start / stop in a flowchart?
Q8.Which of the following is/are NOT CORRECT statement? (A) The first record in each block of the data file is known as actor record. (B) Dense index has index entries for every search key value in the data file. (C) Searching is harder in the B+ tree than B- tree as the all external nodes linked to each other. (D) In extendible hashing the size of directory is just an array of 2d-1, where d is global depth. Choose the correct answer from the options given below:
Q9.Which of the following is not a palindromic subsequence of the string “ababcdabba” ? 
Q10.2-3-4 trees are B - trees of order 4. They are isometric of _____ trees.
Crack GATE Electrical with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Test Series
View All >
UPSC ESE (IES) Civil Mock Test Series
116 Total Tests with 1 Free Tests
Start Free Test
UPSC ESE (IES) Prelims Paper 1 Mock Test Series
54 Total Tests with   1 Free Tests
Start Free Test
Suggested Exams
Exam-Logo
UPSC IES

UPSC IES Important Links

More Algorithms Questions

Q1.The Highest Lower Bound on the number of Comparisons in the worst case for comparison-based sorting order of : 
Q2.In what manner is a state-space tree for a backtracking algorithm constructed ? 
Q3.Which open addressing technique is free from Clustering problems ?
Q4.Assume that P and NP are different i.e. P! = NP then for the expression NP-Complete ∩ P = ? Which among the following is correct ? 
Q5.The recurrence relation for binary search algorithm is : 
Q6.The time complexity of solving the Longest Common Subsequence problem using Dynamic Programming is : (m and n are lengths of subsequences) 
Q7.Given the following characteristics : (i) Optimal substructure (ii) Overlapping subproblems (iii) Memorization (iv) Decrease and conquer Dynamic programming has the following characteristics :
Q8.Which of the following is not a stable sorting algorithm ?
Q9.Match the LIST-I with LIST-II LIST - I LIST - II A. Breadth First Search I. LISP B. Depth First Search II. Syntax tree C. Prefix III. Stack D. Infix IV. Queue Choose the correct answer from the options given below:
Q10.Which one of the following is not related to the feed forward networks on the Backpropagation Algorithm
Important Exams
Super Coaching
Exams
Test Series
Previous Year Papers
Objective Questions
Testbook USA SAT Exam
Testbook USA ACT Exam
US College Admissions Guide
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti lotus teen patti club apk teen patti star