No. of Printed Pages: 3 IBICS-0071
B.Tech. -VIEP -COMPUTER SCIENCE AND
ENGINEERING (BTCSVI)
Term-End Examination

OL..493
December, 2016
BICS-007 DATA STRUCTURES
Time: 3 hours Maximum Marks: 70
Note: Attempt any five questions. All questions carry equal marks.


1. Explain multidimensional arrays. How can strings be stored using a multidimensional array? 7

Explain the different ways of analysing algorithms. 7

2. Write an algorithm which converts a given infix expression to a prefix expression. 7

Write a program to implement a stack with all the operations using a linked list. 7

3. Write an algorithm to insert a number in the linked list at the following positions: 7

In the beginning of the list,

At the end of the list.

Write the algorithms for insertion and deletion operations performed on the circular queue. 7

4. Define a tree. How do you represent the binary tree in the computer's memory List the operations that can be performed on a binary tree. 7

If the in-order traversal of a binary tree is F and its post-order traversal is determine the binary tree. 7

5. Write an algorithm for Depth First Search traversal of a graph. 7

Explain Binary Search. Write the algorithm for Binary Search and also find its complexity. 7

6. Write a program to sort the elements of an array using bubble sort techniques. 7

Sort the following data using insertion sort techniques: 7 25,15,30,9,99,20,26

7. Write short notes on any four of the following: 4x3 1/2 =14

Hashing

Planar Graphs and its application

Spanning Tree

Storage Pools

Sparse Matrix

Time and Space Complexities