Question 2
A list of n strings, each of length n , is sorted in lexicographic order using the merge-sort algorithm. The worst case running time of this computation is__.
Question 3
the shortest path between every pair of vertices.
the shortest path from S to every vertex in the graph.
the shortest path from S to only those nodes that are leaves of T.
the longest path from S to every vertex in the graph.
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 11 Dec 2022 Set ETD1-2 paper
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 11 Dec 2022, in the September 2022 term, set ETD1-2: 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 11 Dec 2022 Set ETD1-2 at a glance |
|---|---|
| Term | September 2022 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 30 |
| Marks | 100 |
| Duration | 180 min |
| MCQ | 17 |
| MSQ | 6 |
| Numerical | 7 |
| Official paper | IIT M DIPLOMA AN1 EXAM ETD1 11 Dec 2022 |
| Negative marking | No negative marking. |
| Updated |