Question 2
Which of the following statements is/are true about the Quicksort algorithm? Assume that the first element in the list selected as pivot for partitioning each time.
I. The best case is when the pivot element always divides the list into two equal halves. II. The worst case is when the input list is arranged in either ascending or descending order.
Only I
Only II
Both I and II
None
Question 3
Insertion of the new node at the front of the linked list.
Insertion of the new node at the end of the linked list.
Deletion of the first node of the linked list.
Deletion of the last node of the linked list.
27 more questions in this paper
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
More on the PDSA End Term 3 Apr 2022 Set AN1 paper
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 3 Apr 2022, in the January 2022 term, set AN1: 30 questions for 100 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | PDSA End Term 3 Apr 2022 Set AN1 at a glance |
|---|---|
| Term | January 2022 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 30 |
| Marks | 100 |
| Duration | 180 min |
| MCQ | 22 |
| MSQ | 4 |
| Numerical | 4 |
| Official paper | IIT M FOUNDATION DIPLOMA ENDTERM FN1 3 Apr 2022 |
| Negative marking | No negative marking. |
| Updated |