Data Structures ADP/BS 3 Semester/Term University Of Sargodha (UOS) 2026

University of Sargodha

ADP/ BS 3" Semester EX3Mination 2026

Subject: CS, IT & SE Paper: Data Structures (CMPC-5205) 3 oleo

Time Allowed: 2:30 Hours 031486948 So Maximum Marks: 40

Note: Objective Part is Compulsory. Attempt any three Question form Subjective Part.

Objective Part (Compulsory)

Q.1. Write short answers of the following in 2-3 lines each On your answer sheet. (2*8)

i. In what areas do data structures are applied? |

ii. Which sorting algorithm is considered the fastest?

ii. Write the formula to calculate height of binary tree,

iv. What are the minimum and maximum numbers of elements in a heap of height h?

v. Define divide and conquer approach?

vi. What is the advantage of double link list over single link list?

vii. Differentiate the POP () and Stack Top () operation

viii. Differentiate between shall and insertion sort?

Subjective Part (3*8)

Q.2. Convert the following infix expression to a postfix expression using stack.

3+(1*4%3-6)/(98(2+4/6-8)*7)

Q3. Write the code that delete all nodes in single linked list which are divisible by

3. Assume that list contain

some nodes for Example: List is: 9 -> 39 -> 41 ->7 > 12

Q.4. Find the shortest path from the Origin node (S) to all other vertices in the following graph. Provide order

in which the nodes were visited as well the table showing the shortest paths.

@® -

lo)

Q.5. Create an AVL tree for the following values inserted in sequence.

21,26, 30,9, 15,10,2,3,7

Q.6. Write down the code that finds the largest element from the array using recursion.

eee | K-0542, 9543, 9544/10-06-2026(F-24) omen

Be a x ustadni.com