LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
B.Sc. DEGREE EXAMINATION – MATHEMATICS
|
SIXTH SEMESTER – April 2009
MT 6602 – DATA STRUCTURE & ALGORITHM
Date & Time: 23/04/2009 / 9:00 – 12:00 Dept. No. Max. : 100 Marks
PART – A ( 10 ´ 2 = 20)
Answer ALL questions
- Define atomic data.
- What is pseudocode?
- What is sequential search?
- List any two variations of sequential search.
- Explain (i) random list (ii) ordered list.
- What is parsing?
- Define Fibonacci series recursively.
- Define complete binary tree
- What is sort efficiency?
- Explain selection sort.
PART – B ( 5 ´ 8 = 40)
Answer any FIVE questions
- Write a short note on (i) ADT operators and (ii) ADT structure.
- Write the algorithm for probability search.
- Explain the four operations associated with linear list.
- Write an algorithm to convert a decimal number to a binary number.
- Explain the queue operations (i) Enqueue (ii) Dequeue (iii) Queue Front and
(iv) Queue Rear. - Write a program to find factorial of a given number recursively.
- What is heap sort? Write its algorithm.
- Explain the straight insertion sort with example.
PART – C (2 ´ 20 = 40)
Answer any TWO questions
- What is binary search? Write its algorithm.
- What is backtracking? Explain eight queens problem and write its algorithm.
- How do you implement queues in arrays? Write the complete algorithm.
- Write the algorithms of Babble sort and Quick sort and also discuss their efficiency.
