CS301 VU Current Final Paper Spring July 2012

40 mcqs thy kuch past papers me sy ay or kuch new thy
2 no k 4 quiz thy
3 no k b 4 quiz thy
or 5 no k b 4 quiz thy
paper time 2 hours tha

long quiz jo mujhy yaad hy woh yeh hy:

1) How we can implement Table ADT using Linked List (marks 2)

2) which three basic operations are performed on AVL trees (mark 3)

3)write down the c++ code to impliment insertion sort algorithm (5)

4) 1 tree diya huwa tha us ki in-order or post-order traversing karni thi (marks 5)

5)Give the name of three Divide and Conquer algorithms. (marks 3)

6) Here is an array of ten integers:
5 3 8 9 1 7 0 2 6 4

Draw this array after the FIRST iteration of the large loop in an insertion sort (sorting from smallest to largest). This iteration has shifted at least one
item in the array! (marks 3)

7) Union or find ka code likhna tha (marks 5)