Register Number :

Name of the Candidate :

6263
M.Sc. DEGREE EXAMINATION, 2012
( COMPUTER SCIENCE )
( FIRST SEMESTER )
( PAPER - I )

111. DATA STRUCTURES AND ALGORITHMS

December ]

[ Time : 3 Hours
Maximum : 100 Marks
PART - A

(8 5 = 40)

Answer any EIGHT questions.

ALL questions carry EQUAL marks.
1. Define linked list with an example.
2. What is meant by a graph? Give an example.
3. Give the algorithm for Strassens Matrix
Multiplication method.
4. How to obtain the single source shortest path using
the Greedy algorithm?
Turn Over

2
5. Explain the concept of multistage graph.
6. Give an example for AND / OR graph and
discuss it.
7

What is meant by back tracking?

8. Explain the concept of branch and bound

technique.
9. M e n t i o n t h e b a s i c c o n c e p t s i n v o l v e d i n
NP-Hard graph problems.
10. What is meant by NP- complete problems?
PART - B

(3 20 = 60)

Answer any THREE questions.

ALL questions carry EQUAL marks.
11.How stacks differ from queues? Explain with
examples.
12. Describe the algorithm for binary search.
13. How to apply dynamic programming concept
for the travelling sales person problem?

14. What is meant by graph colouring? How to obtain

it?
15. Discuss the concept involved in NP-Hard code
generation problems.