Diploma-Diploma Computer Engineering 3rd Sem Data Structure Management(Gujarat Technological University-2013)

GUJARAT TECHNOLOGICAL UNIVERSITY
DIPLOMA Engg.- SEMESTER–III EXAMINATION – WINTER 2012
Subject code: 330701 Date: 02/01/2013
Subject Name: Data Structure Management
Time: 2:30 pm – 5:00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. English version is Authentic
Q.1 (a) List non primitive data structures and explain in brief . 07
(b) What is stack? Explain PUSH and POP operations in STACK. 07
Q.2 (a) What is Circular queue? Write algorithm to insert element in circular queue. 07
(b) Write an algorithm of bubble sort. 07
OR
(b) Write an algorithm of quick sort. 07
Q.3 (a) Write an algorithm to INSERT a node in Singly Linked List. 07
(b) What is Queue? Explain disadvantages of simple queue. 07
OR
Q.3 (a) Write an algorithm to INSERT a node in Doubly Linked List. 07
(b) Write an algorithm to DELETE a node in Doubly Linked List. 07
Q.4 (a) Convert following expression into the postfix notation: (i) a+b/(c*d)-e (ii) (a/b) * (c/(d+e)-f) 07
(b) Give tracing of following list of numbers using Selection sort. 23,32,47,11, 65,99,57,84,36 (07) 
OR
Q. 4 (a) Give trace of following list of numbers using Quick sort
42,23,76,11,65,58,94,36,99,87 (07) 
(b) What is tree traversal ? what are different methods of tree traversal? Write an
algorithm for PREORDER traversal. 07
Q.5 (a) Write a program to compare two strings s1 and s2. 07
(b) Write a program for concatenation of strings s1 and s2 in string s3. 07
OR
Q.5 (a) Define: (i) root node (ii) leaf node (iii) directed tree (iv) String array (v)
sibling (vi) directed graph (vii) weighted graph 07
(b) What is Hashing? Explain any one Hashing function in detail. 07