Himachal Pradesh University (HPU) 2006 B.Tech Information Technology Data structures and Algorithms - Question Paper

B.tech. third semester exam
DATA STRUCTURES AND ALGORITHMS (CSE/IT)
time allowed:3 hours Maximum Marks:100

Note: The candidate shall limit their answers precisely with the ans book issued to them

and no supplementary sheets will be issued.
Attempt 5 ques. in all selecting at lowest 1 ques. from part A,B,C and D.

part E is compulsory.

part - A
1.What do you mean by data structures?What is the use of data structures? explain different

mathematical notations and functions needed to explain data structures. explain in brief

the concept of algorithc complexity. [15]

2.what do you mean by linked list? How linked list can be represented in the memory? Write

an algorithm to count the number of nodes in the linked list. [15]

SECTION - B
3.Discuss the subsequent in brief
a) Almost complete binary tree.
b) AVL tree.
c) obtain the minimum height of a binary tree containing 31 nodes.
d) Weight of a tree.
e) How a heap is various from a binary search tree. [15]

4) What do you mean by AVL tree? How an AVL tree is various from a binary search tree?

What do you mean by re balancing of AVL tree? discuss with an example. [15]

SECTION - c
5.What do you mean by a graph? elaborate different graph traversals techniques? explain any 1

in detail giving example. [15]

6. Write a short note on
a) Hash Table
b) Symbol Table [15]

SECTION - D
7.Discuss the procedure of binary search in detail giving suitable example.Why binary search

tree is better than linear search? [15]

8.Write an algorithm for the bubble sort. [15]

SECTION - E
9. (a) Differentiate ranging from linear and non-linear data structures. [4]
(b) Write short note on multi-linked structures? [4]
(c) HOW data structures are classified? [4]
(d) explain the procedure of in-order traversal of a binary tree giving example. [4]
(e) How a binary search tree is various from a binary tree. [4]
(f) What do you mean by adjacency matrix? provide example. [4]
(g) explain the different methods of representing graph in memory other than adjacency

matrix in brief. [4]
(h) explain the applications of height balanced trees. [4]
(i) explain which data structure is best for the insertion sort. [4]
(j) Differentiate ranging from internal sort and external sort. [4]

Earning:   Approval pending.