LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
|
SECOND SEMESTER – APRIL 2007
CS 2807 – DATA STRUCTURES THROUGH JAVA
Date & Time: 17/04/2007 / 1:00 – 4:00 Dept. No. Max. : 100 Marks
Part-A
Answer all questions 10 x 2 = 20
- What is a vector?
- Define Object?
- What is stack?
- Define en-queue.
- Define B-Tree
- What is a sequential Search?
- What is cyclic graph?
- What is graph coloring?
- What is worst fit?
- What is garbage collection?
Part-B
Answer all Questions 5 x 8 = 40
- a) Write about abstract data types (or)
- b) Define String. Explain its operations
- a) Define Linked List. Write an algorithm to add a number into a list (or)
- b) Explicate Circular lists
- a) Explain Exchange sort (or)
- b) Elucidate Binary Search
- a) Explain Tree Traversals (or)
- b) Explain Kruskal’s Algorithm
- a) Explain in detail about i) First Fit ii) Best Fit (or)
- b) Discuss how the Lists are used in java
Part-C
Answer any two Questions 2 x 20 = 40
- a) Discuss any two stack applications. (10 Marks)
- b) Write an algorithm for deleting an element from a doubly linked list (10 Marks)
- a) Elucidate Dijkstra’s algorithm with suitable examples. (10 Marks)
- b) Write a short note on
- i) Merge sort (5Marks)
- ii) Radix sort. (5Marks)
- a) Explain DFS and BFS. (10 Marks)
- b) Write in detail about compaction (10 Marks)