LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
B.C.A. DEGREE EXAMINATION – COMPUTER APPLICATIONS
FOURTH SEMESTER – APRIL 2008
CA 4500 - DATA STRUCTURES & ALGORITHMS
Date : 29/04/2008
Time : 9:00 - 12:00
Dept. No.
DC 8
Max. : 100 Marks
PART – A
ANSWER ALL QUESTIONS:
10 X 2 = 20
1. Define the term Algorithm.
2. Define and illustrate the various types of vertices in a flowchart.
3. Define the term Heuristics.
4. What is time complexity?
5. Define Linked list.
6. What is Data structure?
7. What is Merge sort?
8. Define Binary search.
9. Define Graph.
10. Draw a binary Tree for the expression :
A * B - (C + D) * (P / Q)
PART – B
ANSWER ALL QUESTIONS:
5 X 8 = 40
11. a) Explain Top-Down programming with detailed flowchart.
(Or)
b) Write notes on Divide and Conquer method.
12. a) Explain the General method for GREEDY approach.
(Or)
b) Explain about Backtrack programming.
13. a) Write a C program to create and display Single Linked List.
(Or)
b) What is Circular Queue? Explain with an example.
14. a) Explain Bubble sort technique with suitable example.
(Or)
b) Explain Insertion sort technique with suitable example.
1
15. a) Traverse the given tree using Inorder, Preorder and Postorder traversals.
Given tree:
A
C
B
D
E
G
F
H
I
J
(Or)
b) Explain about Breadth First Search.
PART – C
2 X 20 = 40
ANSWER ANY TWO:
16. a) Discuss the steps involved in computer development of algorithm.
b) Explain the basic steps of an Algorithm for Traveling salesman problem.
17. a) Explain Linked stack with an example.
b) Write a C program to compute Linear Search.
18. a) Give the C implementation with program for a Heap sort and explain the working for the
following set of numbers:
11, 2, 9, 13, 57, 25, 17, 1, 90, 3
b) Discuss in detail about Threaded binary tree.
*************88
2