Uttarakhand Technical University B.Tech Computer Science and Engineering UTU exam paper of Data Structure 2013

 UTU B.Tech CSE previous year Question paper of Data Structure 2013 

Course: B.Tech Computer Science and Engineering

University/board: Uttarakhand Technical University

You can easily find the previous year question paper of Uttarahkhand Technical University of Btech 3 semester,Data Structure of year 3013. You can prepare and solve it for doing your Btech exam preparation. All the best for your exam.

TCS-303

btech utu examination, 2013-14

Data Structure

Time:3hours

Max. Marks:100

Note:attempt all questions.
Q1.attempt any four parts of the following:
a. Write an algorithm of binary search.
b. Sort the following letters"PROGRAM" using bubble sort technique.
c. Write down the advantages and disadvantages of array.
d. What are the various applications of linked list?
c. Write an algorithm to search an element in unsorted linked list.
d. Write a program to calculate the factorial of a number using inverse Recursion.

Q2. Attempt any four parts of the following:
a. Define the following.
i. AVL tree ii. B-tree
b. What do the terms LIFO and FIFO means? Explain with example.
c. Define tower of Hanoi with example.
d. What are the queues and their applications? Write an algorithm to demonstrate insertion of a node in a queue?
e. What is Stack? Explain with algorithm.
f. Explain the complexities of the following sorting algorithms: Insertion sort, Quick sort, two way Merge sort.

Q3. Attempt any two of the following:
a. What are the various operations possible on doubly linked list? Explain with suitable example.
b. What do you mean by array? Explain various types of array with example.
c. Write an algorithm to insert an element in a given link list after a given node.

Q4. Attempt any two parts of the following:
a. What do you mean by quick sort? Apply quick sort technique on the following list.
44,33,11,55,77,90,40,60,99,22,88,66.

b. Name the various tree traversal algorithms. Create the binary expression tree from the following expression and traverse it using all possible tree traversal.
[a+(b-c)*[(d-e)/(f+g-h)]

c. What is a heap? Explain various operations and its applications.

Q5. Attempt any two parts of the following:
a. Has best data structure to check whether an arithmetic expression balanced parenthesis is a stack? Justify your answer.
b. Postorder traversal of a given binary search tree, T produces the following sequence of keys:
10,9,23,22,27,25,15,50,95,60,40,29
What are the result of an in-order and pre order traversal of the tree T?
c. i. Given the following input (4322,1334,1471,9679,1989,6171,6173,4199) and the hash function xmod10 , what is the final hash table?

ii. Explain complexity and its time space tradeoff.