# GTU previous years question papers -BE- Sem-III -Data &File Structure -December 2009

GTU previous years question papers

GUJARAT TECHNOLOGICAL UNIVERSITY

B.E. Sem-III Examination December 2009

Subject code: 130702

Subject Name: Data & File Structure.

Total Marks: 70

Instructions:

1. Attempt all questions.

2.   Make suitable assumptions wherever necessary.

3.  Figures to the right indicate full marks.

Q. (a) Define data structure. List the various linear and non-linear data structures and explain them in brief.

(b) Discuss the basic operations performed with linear structure.

(c) What is recursion? Write a C program for GCD using recursion.

Q.2 Write an algorithm to convert infix expression to postfix expression.

(b) Write an algorithm for evaluation of postfix expression and evaluation the following expression showing every status of stack in tabular form.

 (i)
 (ii) 7 5 2 + * 4 1 1 + / –

OR

Trace the conversion of infix to postfix form in tabular form.

(i)               ( A + B * C / D – E + F / G / ( H + I ) )

(ii)             ( A + B ) * C + D / ( B + A * C ) + D

(c) Explain Difference between Stack and Queue.

Q.3 (a) Explain following:

(i) DQUEUE

(iii)   Circular Queue.

(b)             Write the implementation procedure of basic primitive operations of the stack using:

(i) Linear array                                                 (ii) linked list.

(c)              Consider the following arithmetic expression P, written in postfix notation. Translate it in infix notation and evaluate.

P : 12, 7, 3, -, /, 2, 1, 5, +, *, +

OR

Q.3 (a) What is Hashing? Explain various Hashing Functions.

(b)             Write the implementation procedure of basic primitive operations of the Queue using:

(i) Linear array                                                 (ii) linked list.

Q.4 (a) Explain Sequential Files and Indexed Sequential Files Structures.

(b) Explain the Preorder, Inorder and Post order traversal techniques of the binary tree with suitable example.

OR

Q.4 (a) Explain the terms: File, Field, Record, Database, Key.

(b) Which are the basic traversing techniques of the Graph? Write the  algorithm of any one of them.

Q.5 Construct the AVL search tree by inserting the following elements in the order of their occurrence.

64, 1, 44, 26, 13, 110, 98, 85

(b) Discuss following with reference to graphs.

(i) Directed graph (ii) Undirected graph (iii) Degree of vertex (iv)Null graph

OR

(a) Explain matrix and linked list representation of a graph Discuss following with reference to trees.

(i) Height of the tree (ii) Binary tree (iii) Strictly binary tree (iv) Sibling