LOADING

Questions

Diploma Engineering - SEMESTER–III • EXAMINATION – SUMMER • 2014-Summer-June-2014

Q-1

2.What is Stack? Write algorithm for Push and Pop operation

(7)
Q-1(a)

1.What is Data Structure? Explain different types of Data structure.

(7)
Q-2

2.Convert (A-B↑C↑D) * (E – F/D) into postfix notation using Stack.

(7)
Q-2(a)

1.Define String. Write a program in C to copy one string into another string
without use of library function.

(7)
ORQ-2(b)

2.Consider size of stack as 5.Apply following operation on stack  and show
the status of stack and top pointer after each operation .  
i ) push a , b, c            ii)  pop               iii) push e,f               iv) pop                
v) push g h                 vi)push  m          vii)pop

(7)
Q-3(a)

1.What is linked list? Explain different types of linked list with its graphical
representation.

(7)
ORQ-3(a)

1.Write a algorithm to  insert a new node before first node  in doubly linked
list.

(7)
Q-3(b)

2.Write a program in C to insert a node in singly linked list at particular position

(7)
ORQ-3(b)

2.Write a program in C  to implement Queue insert and Queue delete
algorithm.

(7)
Q-4(a)

1.Differentiate Queue and circular queue . Write algorithm to insert data in
circular queue.

(7)
ORQ-4(a)

1.Define tree. Explain different tree traversal method in detail.

(7)
Q-4(b)

2.Write a program in C to sort 10 element using insertion sort.

(7)
ORQ-5(a)

1.What is hash value? Explain any three methods used to find hash value.

(7)

1.What is hashing? When collisions occur in hashing? Explain linear probing
method with suitable example.

Q-5(b)

2.Draw binary search tree for 10(root),  20  , 4 ,  6,  70 , 40 ,  30,  60  .
Insert  2 , 50 in Binary search tree  and delete  20 from tree and Redraw it
for each operation.

(7)
ORQ-5(b)

2. Consider Data for binary search tree:  6, 8, 33, 3, 40, 2, 9, 10, 22, 15, and
17. Consider 10 as root, give answer of following.
 i) left childs of root        ii) leaf node of tree         iii)  in-degree of 40           
iv)  out degree of  8        v) childs  of  22               vi) depth of tree        
vii) Internal nodes of tree.

(7)