DATAS (3rd) Dec2014
DATAS (3rd) Dec2014
of Pages: 02
Total No. of Questions: 09
B.TECH(3D ANIMATION & GRAPHICS,CSE, IT) (Sem.-3rd)
DATA STRUCTURE
Subject Code: BTCS-304
Paper ID: [A1126]
Time: 3 Hrs. Max. Marks: 60
INSTRUCTIONS TO CANDIDATES:
1. Section –A, is Compulsory.
2. Attempt any four questions from Section-B.
3. Attempt any two questions from Section-C.
Q.1.
Section –A
o m (10x2=20)
(a)
(b) .r c
What is meant by an abstract data type?
Differentiate between Stack and Queue?
(c)
(d)
p e
What are the advantages in the array implementation of list?
What is the usage of stack in recursive algorithm implementation?
(e)
(f)
p a
What is a circular queue and its use?
What condition is checked to determine if pointer, P has moved past the end of the list?
(g)
r
Evaluate: (a) + 1 24 3 + * 41 -
b
(b) 25 7 * 14 – 6 +
o m
(h)
(i)
(j)
w .
Define the term sparse matrix. How they are stored in memory.
List out the different types of hashing functions?
What is meant by strongly connected in a graph? .r c
w Section –B
p e (4x5=20)
w a
Q. 2.
p
Define the terms: static and dynamic data structures. List some of the static
and dynamic data structure in C.
r
Q. 3.
Q. 4.
.b
What is traversing? Write an algorithm for traversing a link list?
What Criteria is used for evaluating the suitability of a particular data structure for a
Q. 5.
given application.
w w
Make a binary search tree and a heap tree from the given data.
23 7 92 6 12 14 40 44 20 21
Q. 6.
memory.
w
What is Graph. Describe in brief the various methods used to represent Graphs in
Section –C (2x10=20)
Q. 7. What is the advantage and average efficiency of quick sort? Apply Quick sort on the
following data and show the contents of the array every pass:
48 7 26 44 13 23 98 57 100 5 32
Page: 1
M-56594
Q. 8. Write the algorithms for the following:
(a) Deleting an element from a doubly link list.
(b) Inserting an element in a priority queue.
(c) To reverse a string of characters using stack.
(d) To search an element in a sorted array.
Q. 9. Define AVL and B-trees and their applications? Explain various operations
used for balancing a binary tree with the help of a suitable example?
m
-----END-----
o
.r c
p e
p a
b r o m
w . .r c
w p e
w a
r p
.b
w w
w
Page: 2
M-56594