C05-CM-402
457
BOARD DIPLOMA
EXAMINATION, (C-05)
OCT/NOV-2011
DCME IV
SEMESTER EXAMINATION
DATA STRUCTURES
THROUGH C
Time : 3
Hours]
[Total Marks: 100
PART-A 10*4=40
Instructions: (1) Answer all
questions and each question caries four marks. (2) Answers should be brief and
straight to t the point and shall not exceed five simple sentences.
1.
What are the advantages and
disadvantages of linked list
2.
What do you meant by dummy header?
3.
List applications of stack.
4.
Define a binary tree and give an
example.
5.
Define : (a) Height of a tree (b)
tree (c) parent and children (d) order of tree
6.
What are the tree traversals
methods?
7.
What is a binary tree for integers?
8.
What is the principle of bubble
sort?
9.
What is time and space complexity?
10.
Compare linear search and binary
search.
PART-B 5*12=60
Instructions: (1) Answer any five
questions and each question caries twelve marks. (2) The Answers should be
comprehensive and criteria for valuation is the Content but not the length of
the answer.
11.
(a) what is data structure and
classify them?. (b) explain how to perform insertion and deletion operation on
a double linked list.
12.
Write a c program for creating
single linked list.
13.
What is a queue and write a c
program to implement queue using arrays.
14.
(a) explain how to convert the
following infix expression to postfix form and all rules (A+B*C)/(D+E)
15.
Explain how to construct a tree for
given in order and post order traversals. In
order : D B E A C Post
order : D E B C A
16.
Write preorder, post order, in order
traversals for the following tree.
17.
(a) explain aobut binary search sort
tree. (b) write a c program for selection sort.
18.
(a) explain the working of quick
sort and write algorithm (b) write a c program for binary search
