GTU Computer Engineering (Semester 3)
Data Structures
December 2014
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1 (a) Write short note on performance analysis and performance measurement of an algorithm.
7 M
1 (b) Write a selection sort algorithm and also discuss its efficiency.
7 M

2 (a) What is Stack? List out different operation of it and write algorithm for any two operation.
7 M
Answer any one question from Q2 (b) & Q2 (c)
2 (b) Write a 'C' program or an algorithm to convert infix expression without parenthesis to postfix expression.
7 M
2 (c) Write user defined C function for inserting an element into circular queue.
7 M

Answer any two question from Q3 (a), (b) & Q3 (c), (d)
3 (a) What is a Queue? Write down drawback of simple queue. Also write an algorithm for deleting an element from circular queue.
7 M
3 (b) Write down advantages of linked list over array and explain it in detail.
7 M
3 (c) Write an algorithm to delete a node from doubly linked list.
7 M
3 (d) Convert A+(B*C-(D/E^F)*G) infix expression into postfix format showing stack status after every step in tabular form.
7 M

Answer any two question from Q4 (a), (b) & Q4 (c), (b)
4 (a) Define the following terms. 1) Graph 2) Tree 3) Multi graph 4) Weighted graph 5) Elementary path 6) Complete Binary tree 7) Descendent node
7 M
4 (b) List out different traversal way of tree and demonstrate any two with example.
7 M
4 (c) Write an algorithm to delete a node from tree.
7 M
4 (d) Explain BFS and DFS in detail.
7 M

Answer any two question from Q5(a), (b) & Q5 (c), (d)
5 (a) Explain AVL tree with example.
7 M
5 (b) List out different hash methods and explain any three.
7 M
5 (c) Write down precondition and algorithm of binary search method.
7 M
5 (d) Explain file in terms of fields, records and database.
7 M



More question papers from Data Structures
SPONSORED ADVERTISEMENTS