Devi Ahilya University 2010 B.Sc Computer Science Data structure - Question Paper
Data structure paper
|
Roll No. |
B. Sc. IV SEMESTER [MAIN] EXAMINATION, JUNE - 2010 COMPUTER SCIENCE
10412
Time : 3:00 Hrs.] [Max. Marks : 35
Note : AH THREE Sections are compulsory. Student should not write any thing on question paper. : fr cfrr srtorzf 11 fersff ferct' i
[Section - A]
This Section contains Objective type questions. Each question carries 1 Marks.
TPFT 11 1 3f cf> cj5T 11
|
BST stands for - Q. 01 a) Binary Simple Tree c) Binary Search Tree BST cf>T TgcT wf t - a) Binary Simple Tree c) Binary Search Tree |
b) Binary Sample Tree d) Binary Stack Tree b) Binary Sample Tree d) Binary Stack Tree |
Which of the following is not a type of Graph a) Connected graph b)
Q. 02
Weighted graph Binary graph
Weighted graph Binary graph
c) Directed graph d)
fT 3 cjT TT M cJ5T MR t -a) Connected graph b)
c) Directed graph d)
Q. 03 Open addressing is used for -
a) Stack resolution b) Collision resolution
c) Queue resolution d) Memory resolution
Open addressing uTRn t -
a) Stack resolution b) Collision resolution
c) Queue resolution d) Memory resolution
Q. 04 Binary Search Algorithm can be applied to -
a) Stored linear array b) Queue
c) Stack d) None of these
Binary Search Algorithm wfa] fFT 3 tor t
a) Stored linear array b) Queue
c) Stack d) vwlcfcl $ it f
P.T.O.
Q. 05 Which one of the following is not a file organization -
|
a) |
Relative |
b) |
Random |
|
c) |
Index sequential |
d) |
Binary |
|
PlH *1 c&h 1 file organization h[ |
- | ||
|
a) |
Relative |
b) |
Random |
|
c) |
Index sequential |
d) |
Binary |
[Section - B]
This section contains Short Answer type questions. Each question carries 2 Marks. dtJvJTl'Fh I 2 3T3>t cf>T % |
Q. 1 What do you mean by Recursion ?
Recursion 3TN W W&fi FT ?
OR
Explain BST with example.
BST I
Q. 2 What is Graph ? Explain im w t ?
OR
What do you mean by DFS and BFS.
DFS cr BFS arrqr w 'tFms t ?
Q. 3 What is Hashing ?
Hashing w t ?
OR
Explain AVI-Tree with example.
AVI-Tree rf%TT T-FrsTft I
Q. 4 Differentiate Linear Search and Binary Search.
Linear Search Binary Search $ afcR cftfT |
OR
Explain Heap with example.
Heap cT rflrT I
Q. 5 Define Computational Complexity.
Computational Complexity w\ nRiRa 01 I
OR
What is Relative File Organization ?
Relative File Organization W t ?
Cont...
[Section - C]
This section contains Essay Type Questions. Each question carries 4 marks.
% <ftEf3vrfter 11 4 3f cpT 11
Q. 1 What is Binary Tree ? Write algorithm for Pre order, In order and Post order traversal of Binary tree.
Binary Tree w t ? Binary tree Pre order, In order Post order traversal algorithm feiRsi I
Write a 'C' program to count total number of leaf nodes in Binary Tree.
Binary Tree leaf nodes >t count ccfr foTT 'C' u'liilH fclRsli) |
Q. 2 Discuss memory representations of graph with suitable example.
Graph $ memory representations cpt rfl?r I
Write Dilkastras Algorithm for finding shortest path.
Shortest path W cFTFf Dilkastra's Algorithm |
Q. 3 What is Hash Function ? Discuss any two collision resolution and over flow handling techniques.
Hash Function W t ? eft collision resolution over flow handling technique
Write short notes on (Any two) -Trter fcujufi (c r) -
i) B+ Tree ii) Red-Black tree iii) Symbol table
Q. 4 Write algorithm for Quick sort.
Quick sort fcW algorithm fcifeji) I
Differentiate between Shell sort and Merge sort.
Shell sort Merge sort sfcR I
Q. 5 Differentiate between Asymptatic and Amortized complexity.
Asymptatic Amortized complexity 3 otcR |
Define file, records and fields. Also explain the concept of fixed sized and variable records.
file, records fields ? fixed sized variable records cj?f 3Ici?trTT
o
|
Attachment: |
| Earning: Approval pending. |
