Probability Engine · MDS 502

Data Structures and Algorithms: what's likely to come

Every real question from 13 past papers across 5 years (board + internal assessments each year) mapped to its official syllabus unit. Each prediction shows its receipt: the actual years it appeared.

Papers analyzed

2078-2082 · 5 yrs, multiple sittings

Syllabus units

from the official course

Very likely units

high-probability topics

Units = 80% of marks

study these first

13 papers across 5 years

This program sits several exams each year: one official board exam plus internal assessments. Every sitting is analysed.

20783 sittings

first reassessmentmid-termpre board

20791 sitting

board

20803 sittings

boardfirst assessmentsecond assessment

20814 sittings

boardfirst assessmentsecond assessment

20822 sittings

boardsecond assessment

Which exams to include?Showing: All exams

01The ranking

Topic predictions, ordered by what to study first

Every syllabus unit scored by how often it appears, its mark-weight, and its trend. See the exact questions behind each unit in the Explore-by-unit section below.

8 units

#	Syllabus unit	Probability	Appeared	Avg marks	Syllabus weight	Exam vs syllabus	Trend	Questions
1	U2Stack	Very likely100%	2078 2079 2080 2081 2082	18.6	12%6 lecture hrs	Balancedexam 16% · syllabus 12%	Steady	4 recurring6 total
2	U5Lists	Very likely100%	2078 2079 2080 2081 2082	18.6	17%8 lecture hrs	Balancedexam 16% · syllabus 17%	Steady	4 recurring10 total
3	U8Trees and Graphs	Very likely80%	2079 2080 2081 2082	25.5	17%8 lecture hrs	Balancedexam 17% · syllabus 17%	Rising	5 recurring12 total
4	U7Searching and Hashing	Very likely100%	2078 2079 2080 2081 2082	15	15%7 lecture hrs	Balancedexam 13% · syllabus 15%	Steady	5 recurring6 total
5	U3Queue	Very likely100%	2078 2079 2080 2081 2082	11.4	8%4 lecture hrs	Balancedexam 10% · syllabus 8%	Steady	2 recurring10 total
6	U4Recursion	Very likely100%	2078 2079 2080 2081 2082	11.4	8%4 lecture hrs	Balancedexam 10% · syllabus 8%	Steady	3 recurring6 total
7	U1Introduction to Data Structures & Algorithms	Very likely100%	2078 2079 2080 2081 2082	10.8	6%3 lecture hrs	Balancedexam 9% · syllabus 6%	Steady	4 recurring7 total
8	U6Sorting	Very likely80%	2078 2080 2081 2082	13.5	17%8 lecture hrs	Under-examinedexam 9% · syllabus 17%	Rising	3 recurring5 total

02Drill down

Explore by unit: every question, ranked

Pick a syllabus unit and walk its questions from most-important to asked-once. The fastest way to revise one topic end to end.

U2Stack

6 questions · 18 appearances · 18.6 avg marks

What are different applications of stack? Convert $A + (B - C + D) * E / F$ to postfix using stack. (2 + 4)

Compare linear queue with circular queue. How do you implement circular queue? (2 + 4)

HighAsked 6×6 wordings2080 board2080 first assessment2081 first assessment2081 second assessment2082 board6 marks

How do you implement push and pop operations of stack?

HighAsked 5×5 wordings2078 first reassessment2078 mid-term2080 first assessment2081 board2081 first assessment3 marks

Convert $((A-B)\$ C - (D - E))$(F+G)$ to prefix and postfix. (1.5 + 1.5)

RecurringAsked 3×2 wordings2078 first reassessment2078 mid-term2080 first assessment3 marks

Explain algorithm for evaluating postfix expression using suitable example. (6)

OccasionalAsked 2×2078 first reassessment2078 mid-term6 marks

Explain algorithm to convert an infix expression to postfix using stack. Use this algorithm to convert $A / (B + C - D) * E$ into postfix. (3 + 3)

List some applications of stack. How do you implement stack using linked list? (1 + 5)

Asked onceAsked 1×2082 second assessment6 marks

Explain algorithm to evaluate the value of postfix expression using stack with suitable example. (6)

Compare linear queue with circular queue. How do you implement enqueue and dequeue operations in queue? Explain. (2 + 4)

Asked onceAsked 1×2079 board6 marks

03High yield

Most-asked questions across all years

The questions that come back exam after exam, grouped across years and ranked by how often they're asked. Open one to read its real past answer.

Ranked by frequency

How do you insert and remove nodes in a singly linked list? (6)

U5EssentialAsked 4×4 wordings2078 pre board2080 first assessment2081 first assessment2082 board6 marks

What are different applications of stack? Convert $A + (B - C + D) * E / F$ to postfix using stack. (2 + 4)

Compare linear queue with circular queue. How do you implement circular queue? (2 + 4)

U2HighAsked 6×6 wordings2080 board2080 first assessment2081 first assessment2081 second assessment2082 board6 marks

What is AVL tree. Construct AVL tree for the sequence 21, 26, 30, 9, 4, 14, 28, and 18. (1 + 5)

U8HighAsked 6×5 wordings2080 board2080 second assessment2081 board2081 second assessment2082 board2082 second assessment6 marks

Define collision in hashing. Suppose, the set of keys is $\{27, 22, 14, 10, 49, 58, 9, 50\}$ , $m = 10$ , and $h(x) = x \bmod 10$ . Show the effect of successively inserting these keys using quadratic probing. (2 + 4)

U7HighAsked 3×3 wordings2079 board2081 second assessment2082 second assessment6 marks

Explain binary search in brief. What is its time complexity? (2 + 1)

U7EssentialAsked 5×5 wordings2078 pre board2079 board2080 board2080 second assessment2082 board3 marks

Compare big-oh ( $O$ ), omega ( $\Omega$ ), and theta ( $\theta$ ) notations.

U1HighAsked 4×4 wordings2078 first reassessment2078 mid-term2080 first assessment2081 board3 marks

What is divide-and-conquer strategy. Trace the execution of quick sort algorithm with the array of numbers 35, 27, 71, 31, 55, 17, 26, 15, 81, and 11. (2 + 4)

Trace the execution of heap sort algorithm with the array of numbers 35, 27, 71, 31, 55, 17, 26, 15, 81, and 11. (6)

U6RecurringAsked 3×3 wordings2080 board2082 board2082 second assessment6 marks

What is graph traversal? Explain depth first search (DFS) algorithm for traversing graphs with example. (1 + 5)

U8RecurringAsked 2×2 wordings2080 second assessment2082 second assessment6 marks

Lowest priority: asked only once (32)

U2
Explain algorithm to convert an infix expression to postfix using stack. Use this algorithm to convert $A / (B + C - D) * E$ into postfix. (3 + 3)

OR

List some applications of stack. How do you implement stack using linked list? (1 + 5)
2082
U7
What is double hashing? Suppose, the set of keys is $\{18, 22, 14, 20, 99, 48, 19, 50\}$ , $m = 10$ , and $h(x) = x \bmod 10$ . Show the effect of successively inserting these keys using linear probing. (2 + 4)
2082
U3
Define queue. How do you implement circular queue using array data structure? (1 + 5)

OR

What is priority queue? Explain tail recursion with suitable example. (1.5 + 4.5)
2081
U3
Explain priority queue in detail. What are different ways to implement priority queue? (2 + 4)

OR

Define queue. How do you implement queue operations using in array structure? Explain. (1 + 5)
2081
U3
Explain priority queue in detail. What are different ways to implement priority queue? (2 + 4)

OR

What do you mean by overflow and underflow? Explain algorithm to evaluate postfix expression using stack. (2 + 4)
2081
U4
Define tail recursion. Explain recursive algorithm to solve Tower of Hanoi problem. (2 + 4)
2081
U5
How can you insert and remove elements in singly linked list? Explain. (6)
2081
U6
What is external sorting? Trace the execution of quick sort algorithm with the array of numbers 34, 23, 17, 31, 45, 7, 21, 15, 8, and 3. (1 + 5)
2081
U8
What is graph traversal? Explain breadth first search (BFS) algorithm for traversing graphs with example. (1 + 5)
2081
U5
Compare linked list with array. How do you insert and remove nodes in singly linked list? (2 + 4)

OR

What is circular linked list? How do you implement stack using linked list? (1.5 + 4.5)
2080
U8
Use Dijkstra's shortest path algorithm to find the shortest path between the vertices a and z in the graph given below. (6)

Graph (undirected, weighted) with vertices a, b, c, d, e, z and edges: a–b = 2, a–c = 3, b–d = 5, b–e = 2, c–e = 5, d–e = 1, d–z = 2, e–z = 4.
2080
U2
Explain algorithm to evaluate the value of postfix expression using stack with suitable example. (6)

OR

Compare linear queue with circular queue. How do you implement enqueue and dequeue operations in queue? Explain. (2 + 4)
2079

04The strategy

Study smart and sit a probable paper

How far a few high-priority topics take you, and a full mock paper built from the most likely questions, mirroring the real exam structure.

Study smart, not hard

Study the units in priority order. Each bar shows the share of total marks you'd have covered by then. The top 6 units alone cover ~80% of marks.

1Stack16%

2+ Lists32%

3+ Trees and Graphs49%

4+ Searching and Hashing62%

5+ Queue72%

6+ Recursion82%

← study up to here for ~80% of marks

7+ Introduction to Data Structures & Algorithms91%

8+ Sorting100%

Most Probable Paper

Mirrors the real structure · 45 marks · based on 5 past papers

Group A

1.
Explain binary search in brief. What is its time complexity? (2 + 1)
[3 marks]
Searching and HashingVery likelyfrom 2082 paper →
This question has recurred in 4 of 5 years; including the board exam 4× (2078 to 2082); and its topic (Searching and Hashing) appears in 100% of years.
2.
Compare singly linked list with doubly linked list. What is header node? (2 + 1)
[3 marks]
ListsVery likelyfrom 2082 paper →
This question has recurred in 3 of 5 years; including the board exam 2× (2078 to 2082); and its topic (Lists) appears in 100% of years.
3.
Define ADT. Why do you need dynamic memory allocation? (1 + 2)
[3 marks]
Introduction to Data Structures & AlgorithmsVery likelyfrom 2080 paper →
This question has recurred in 3 of 5 years; including the board exam 2× (2079 to 2080); and its topic (Introduction to Data Structures & Algorithms) appears in 100% of years.
4.
How do you implement push and pop operations of stack?
[3 marks]
StackVery likelyfrom 2081 paper →
This question has recurred in 3 of 5 years; including the board exam 1× (2081); and its topic (Stack) appears in 100% of years.
5.
Compare linear search with binary search? What are their time complexities? (2 + 1)
[3 marks]
Searching and HashingVery likelyfrom 2078 paper →
This question has recurred in 3 of 5 years; including the board exam 1× (2078); and its topic (Searching and Hashing) appears in 100% of years.

Group B

1.
What is AVL tree. Construct AVL tree for the sequence 21, 26, 30, 9, 4, 14, 28, and 18. (1 + 5)
[6 marks]
Trees and GraphsVery likelyfrom 2082 paper →
This question has recurred in 3 of 5 years; including the board exam 3× (2080 to 2082); and its topic (Trees and Graphs) appears in 80% of years.
2.
How do you insert and remove nodes in a singly linked list? (6)
[6 marks]
ListsVery likelyfrom 2082 paper →
This question has recurred in 4 of 5 years; including the board exam 2× (2078 to 2082); and its topic (Lists) appears in 100% of years.
3.
What are different applications of stack? Convert $A + (B - C + D) * E / F$ to postfix using stack. (2 + 4)

OR

Compare linear queue with circular queue. How do you implement circular queue? (2 + 4)
[6 marks]
StackVery likelyfrom 2082 paper →
This question has recurred in 3 of 5 years; including the board exam 2× (2080 to 2082); and its topic (Stack) appears in 100% of years.
4.
Explain linear probing. Suppose, the set of keys is $\{7, 12, 14, 10, 49, 58, 9, 50\}$ , $m = 10$ , and $h(x) = x \bmod 10$ . Show the effect of successively inserting these keys using linear probing. (2 + 4)
[6 marks]
Searching and HashingVery likelyfrom 2081 paper →
This question has recurred in 3 of 5 years; including the board exam 2× (2078 to 2081); and its topic (Searching and Hashing) appears in 100% of years.
5.
How linked list differs from array? How do you insert nodes in doubly linked list? (2 + 4)

OR

What is header node in linked list? How do you implement queue using linked list? (1.5 + 4.5)
[6 marks]
ListsVery likelyfrom 2081 paper →
This question has recurred in 2 of 5 years; including the board exam 2× (2079 to 2081); and its topic (Lists) appears in 100% of years.