Veer Narmad South Gujarat University 2010-3rd Sem Certification MS-CIT RF-3961-62 - Data Structures B.Sc ( IT ) ( )( ATKT) Final - Question Paper
RF-3961-62
B. Sc. (I.T.) (Sem. - III) (ATKT) Examination
April/May - 2010 Data Structures
[Total Marks : 70
Time : 3 Hours]
Instructions :
""'N Seat No.:
6silq<3i Puunkiufl SnwiA u* qsq d-onql. Fillup strictly the details of signs on your answer book.
Name of the Examination :
B. Sc. (I.T.) - (SEM. - 3) (ATKT)
Name of the Subject:
DATA STRUCTURES
|
-Subject Code No. |
|
-Section No. (1,2,.....) |
(b) What is the difference between static memory allocation 4 and dynamic memory allocation? Linked list is following which concept?
What is divide and conquer technique? Explain with example.
Instructions :
""'N Seat No.:
6silq<3i Puunkiufl [qaim SuwiA u* qsq d-onql. Fillup strictly the details of signs on your answer book.
Name of the Examination :
B. Sc. (I.T.) - (SEM. - 3) (ATKT)
Name of the Subject:
DATA STRUCTURES
|
-Subject Code No. |
|
4 Answer the following questions (any three) 15
(i) Write an algorithm for performing inserting at various position in doubly linked list.
(ii) Create max-heap tree on following data set 20, 15, 5, 50, 40,12,22,6,9
(iii) Perform bubble sort in ascending order: 25,2,4,67,50,15,3,9,17,8
(iv) Explain AVL tree.
(a) Explain root node, height, leaf node, intermediate 4 node of binary tree.
(b) What is hash file organization?
6 Answer the following questions in brief : (any four) 12
(i) What is priority queue? How to implement priority queue?
(ii) How data is stored in singly linked list with respect to memory?
(iii) What is in-order and pre-order tranversal of binary tree?
(iv) What is Big-oh notation? How to calculate time complexity?
(v) What is threaded binary tree?
RF-3961-62] 2 [ 200 ]
|
Attachment: |
| Earning: Approval pending. |
