Latest B.Tech question paper of Data Structure and Algorithm, Himachal Pradesh University

Posted Date: 05-Jan-2010		Category: General Information
Author: Adonis	Member Level: Diamond
Rating:	Points: 10

his is a question paper ofData Structure and Algorithm of B.Tech III semester computer science students. The paper comes under the Himachal Pradesh University. Advertise he

B.Tech IIIrd Semester Examination, Data Structure and Algorithm,HPU, December 2009

Note: Attempt five questions in all, selecting one from each Section A, B, C and D and all parts of Section E. All the sections carry equal marks (each question=20 marks).

Section-A

1.
What is complexity of an algorithm? How is it measured? Discuss Time space trade off with an example.

2.Write an algorithm to insert an element in two-way link list.

Section- B

3.(a) Build a heap tree from following list of numbers:
44, 30, 50, 22, 60, 55, 77 and 55.
(b) what is an AVL tree?

4.(a) Write an algorithm for INORDER traversal of a binary tree.
(b) Explain inorder, preorder and postorder with examples.

Section- C

5.Write Dijkstra’s algorithm for shortest path.

6.What do you mean by Adjacency matrix? Give an example and explain how its is used in graphs.

Section- D

7.Write an algorithm for insertion sort and explain it with an example.

8.Assume we have sorted array of elements in descending order. Can binary search algorithm still be implemented on it? If yes, write the modified algorithm. If not justify.

Section- E

9. Attempt all the questions:
(a) Give applications of Linked List.
(b) What is height of a tree?
(c) What is a complete binary tree?
(d) Differentiate between graph and tree?
(e) Give complexity of Selection sort and Bubble sort.
(f) What is a Hash table?
(g) What is Collision?
(h) Convert A*(B+D)/E-F*(G+H/K) into Postfix expression.
(i) Differentiate between Linear search and Binary search.
(j) What is Big O notation.

Post Comment:

Notify me by email when others post comments to this article.

Do not include your name, "with regards" etc in the comment. Write detailed comment, relevant to the topic.

No HTML formatting and links to other web sites are allowed.

This is a strictly moderated site. Absolutely no spam allowed.

Name:	Sign In to fill automatically.
Email:	(Will not be published, but required to validate comment)
Website:	We will link to your website, if the comment is worth keeping!
	Type the numbers and letters shown on the left.