Jaypee Institute of Information Technology (JIIT) 2007 B.Tech Computer Science and Engineering data structures - exam paper

JUIT WAKNAGHAT….

DATA STRUCTURES


ques. 1. Write an algorithm to perform every of the subsequent operations
1. Append an element to the end of the list
2. Concatenate 2 lists
3. Free all nodes in a list
4. Reverse a list so that the last element becomes the 1st element and so on.
5. Delete the last element from a list
6. Delete the nth element from a list
7. Combine 2 ordered(ascending or descending) list into 1 ordered list
8. Form a list containing the union of the element of 2 unordered lists
9. Form a list containing the intersection of the elements of 2 lists
10. Insert an element after nth element
11. Delete alternate elements from a list
12. Place the elements of a list in increasing from a list
13. Return the sum of the integers in a list
14. Return number of elements in a list
15. Move node(p) forward n positions in a list.
16. Make a 2nd copy of a list.


ques. 2. Write algorithms for above exercise with a list with a header node having the number of nodes in a list.

ques. 3. Write a routine insub(l1,i1,l2,i2, len) to insert the elements of list l2 beginning at i2th element and continuing for len elements into the list l1 beginning at the point i1. No elements of the list l1 are to be removed or changed.
If i1>length(l1)+1 or if i2c+ len -1 > length(l2), or if i1<1, or if l2<1 print an fault. The list l2 should remain unchanged.

Earning:   Approval pending.