Jaypee Institute of Information Technology (JIIT) 2008 B.E Test 1 : Data Structures For All Branches - Question Paper
JAYPEE UNIVERSITY OF INFORMATION TECHNOLOGY WAKNAGHAT B.TECH. 2nd Sem(Ali Branches). 48' Sm(ECE)
TEST-I FEBRUARY 2008
COURSECODE :07B21C1102 MAX.TIME : I HOUR
COURSE NAME : DATA STRUCTURES MAX. MARKS :20
COURSE CREDITS: 4
Note : I .Attempt all questions. '\/f< 0|f| */
2.lf any assumption is made kindly mention it. _ _*_fIE|fUC |yfy|
Ques J. Give the algorithm for insertion sort. Taking these numbers.
29,0,100.44.66,68. 84.95. 201, 35 sort the array in asccnding order using the above soft and show the resultant array after each step.
IJmnrics)
Ques 2. Write an algorithm for radix sort and explain the complexity of quicksort.
f3marks|
Ques3. How many pointers need to be modified in the follow ing operations:
a) Insertion of an element at the beginning of the linear linked list.
b) Insertion of an element at the beginning of the doubly linked list.
c) Insertion of an element in the middle of the doubly linked list
d) Deleting an element from the end of (he doubly linked list.
e) Deleting an element from the middle of the doubly linked list.
0 Deleting an element from the middle of the linear linked list.
|3marks|
Ques4.
a)Suppose module A requires M units of time to be executed, where M is a constant. Find the time complexity 0(n) of the algorithm, v-heie n b the size of the input data.
Atgo xyz
1. repeat for i- I to n
2. repeat forj*-1 ton
3. repeat for k I to n ,
4. MODULE A end of 3"1 loop
end of 21*1 loop .
end of l loop I I
5. exit
b>Find the time complexity of the following algorithm. a[n] is the array size of n elements.
|
Attachment: |
| Earning: Approval pending. |
