Punjab Engineering College 2008 B.E Electrical and Electronics Engineering DATA STRUCTURES - Question Paper

B.E Electronic Instrumentation and Control CS 1201 DATA STRUCTURES ques. paper

THIRD SEMESTER

COMPUTER SCIENCE AND ENGINEERING

CS1201 DATA STRUCTURES

(common to Chemical, petrochemical, IT, ECE, E&I, ICE and Textile)
(REGULATION 2007)
Time : 3 hours Maximum : 100 marks
ans ALL ques..
PAR T A – (10×2=20 marks)
1. describe : Algorithm.
2. What is an asymptotic notation? Mention its kinds.
3. Write the address computation formula for locating a in an array.
4. What is a Priority Queue?
5. elaborate siblings?
6. describe hash function.
7. What is the total number of comparisions and total number of exchanges in Bubbler sort for the worst case situation?
8. What is the need for external sorting?
9. What is a directed graph?
10. describe Biconnectivity.
PART B – (5×16=80 marks)
11. (a) How Top-down design is various from normal method of issue solving? (
(b) Write an algorithm to print all prime numbers upto 100. (
Or
12. (a) How an algorithm is verified? discuss. (
(b) Write an algorithm to print Fibonacci series. (
13. (a) discuss how the storage representations can be performed in 2-D array. (
(b) discuss how the provided expression is converted into postfix expression using stack.
A+((B*D+E/F)^G-H)/C+E*F)-B*E
Or
14. (a) provide an algorithm for inserting a node in a linked list. (8 )
(b) discuss how linked list is used for polynomial multiplication. (8 )
15. discuss in detail the Hashing functions and collision handling techniques. (16)
Or
16. (a) discuss AVL trees with representations. (8 )
(b) discuss the priority queues with array representations. (8 )
17. (a) discuss Shell sort algorithm with suitable example. (8 )
(b) discuss the time complexity of the above algorithm. (8 )
Or
18. discuss Heap sort algorithm for HEAP tree constructions with example. (16)
19. (a) discuss Dijkstra’s Algorithm and obtain the shortest path for the graph. (10)

50

10
10
30 20 100

60
(b) discuss linked list representation of graph. (6)
Or
20. (a) explain in detail the depth 1st search traversal algorithm for graph. (8 )
(b) Write a brief note on applications of graphs with suitable example. (8 )

Logged

Earning:   Approval pending.