Kannur University 2009-5th Sem B.Tech Computer Science and Engineering Iester engg (2007 adm) dsa,computer science, - Question Paper

IV Semester b-tech engg degree exam July 2009(2007 Adm)

DSA
time 3hr Max.Marks:100

1 a)Briefly discuss array of strings with example.


b)What is set?Briefly discuss the common set operations.


c)Distinguish ranging from ordinary and circular queue.


d)what is a stack?Discuss its applications.

e)What are the basic difference in representing the directed and undirected graph?


f)write a short note on tree traversal.


g)write a short note on hashing.


h)write an algorithm for Bubble sort.
[Marks 8*5=40]

II.1)a)What is recursion?Give properties of a recursive algorithm.what are its advantages?
[Marks 7]

b)Define space and time complexity.Discuss about different components of time complexity.
[Marks 8]

OR

2)a)Briefly discuss the enumerated kinds with example.
[Marks 7]

b)Explain memory representation of 2D-array with example.
[Marks 8]

III.1)a)Give an algorithm to evaluate a provided postfix expression.
[Marks 7]

b)write a function to concatenate 2 singly linked list and then to sort the resulting list.
[Marks 8]

OR

2)a)Write an algorithm to delete an element after a provided node in a linked list.
[Marks 7]

b)convert the subsequent expressions, to provide their postfix and prefix forms.
(A+B)*(D-C)*(E/F)+G

X*Z-M+N+P|Q|(R+S)
[Marks 8]
IV.1)a)Discuss any 3 methods of representing graph.
[Marks 8]
b) discuss the various methods of Binary tree representation.
[Marks 7]
OR
2)a)Give DFS and BFS algorithm.Clearly bring out the differences and comment on the complexity.
[Marks 15]

V.1)a) discuss quick sort with example.Write a suitable algorithm for quick sort.
[Marks 10]

b)Explain any 1 hash collision resolving technique.
[Marks 5]

OR

2)a)Explain insertion sort algorithm with an example.
[Marks 10]

b)what are various methods of searching?Discuss their merits and demerits.
[Marks 5]

Earning:   Approval pending.