LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

LT 16

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

 

1. What is a vector?
2. Define Object?
3. What is stack?
4. Define en-queue.
5. Define B-Tree
6. What is a sequential Search?
7. What is cyclic graph?
8. What is graph coloring?
9. What is worst fit?
10. What is garbage collection?

 

Part-B

Answer all Questions                                                                          5 x 8 = 40

 

11. a) Write about abstract data types (or)
12. b) Define String. Explain its operations

 

12. a) Define Linked List. Write an algorithm to add a number into a list (or)
13. b) Explicate Circular lists

 

13. a) Explain Exchange sort (or)
14. b) Elucidate Binary Search

 

14. a) Explain Tree Traversals                                                                                    (or)
15. b) Explain Kruskal’s Algorithm

 

15. a) Explain in detail about i) First Fit ii) Best Fit (or)
16. b) Discuss how the Lists are used in java

 

Part-C

Answer any two Questions                                                                 2 x 20 = 40

 

 

16. a) Discuss any two stack applications. (10 Marks)
17. b) Write an algorithm for deleting an element from a doubly linked list (10 Marks)

 

17. a) Elucidate Dijkstra’s algorithm with suitable examples. (10 Marks)
18. b) Write a short note on
19. i) Merge sort (5Marks)
20. ii) Radix sort. (5Marks)

 

18. a) Explain DFS and BFS.  (10 Marks)
19. b) Write in detail about compaction  (10 Marks)

 

Go To Main page

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

HC 24

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

 

1. What is a vector?
2. Define Object?
3. What is stack?
4. Define en-queue.
5. Define B-Tree
6. What is a sequential Search?
7. What is cyclic graph?
8. What is graph coloring?
9. What is worst fit?
10. What is garbage collection?

 

Part-B

Answer all Questions                                                                                  5 x 8 = 40

 

11. a) Write about abstract data types (or)
12. b) Define String. Explain its operations

 

12. a) Define Linked List. Write an algorithm to add a number into a list (or)
13. b) Explicate Circular lists

 

13. a) Explain Exchange sort (or)
14. b) Elucidate Binary Search

 

14. a) Explain Tree Traversals                                                       (or)
15. b) Explain Kruskal’s Algorithm

 

15. a) Explain in detail about i) First Fit ii) Best Fit (or)
16. b) Discuss how the Lists are used in java

 

Part-C

Answer any two Questions                                                             2 x 20 = 40

 

16. a) Discuss any two stack applications. (10 Marks)
17. b) Write an algorithm for deleting an element from a doubly linked list (10 Marks)

 

17. a) Elucidate Dijkstra’s algorithm with suitable examples. (10 Marks)
18. b) Write a short note on
19. i) Merge sort (5Marks)
20. ii) Radix sort. (5Marks)

 

18. a) Explain DFS and BFS. (10 Marks)
19. b) Write in detail about compaction  (10 Marks)

 

Go To Main page

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

BH 21

SECOND SEMESTER – APRIL 2008

CS 2807 – DATA STRUCTURES THROUGH JAVA

 

 

 

Date : 17/04/2008            Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

PART-A

Answer all the questions                                                   10×2=20

 

• What is a Subsequence?
• Write the non primitive data types in Java.
• What is a priority queue?
• Draw a linear linked list.
• How to traverse a non empty binary tree in a symmetric order?
• Name any two exchange sorts.
• What is a cyclic graph?
• What is a Forest?
• What is a Garbage collection?
• What is a Bounded workspace algorithm?

 

PART-B

 Answer all the questions                                                   5×8=40

 

11) a) Explain briefly the ADT for Varying – Length Character Strings.

(OR)

1. b) Discuss the following

i)Array as an ADT   ii)Value and Reference Semantics.

12) a)   Discuss the following

(i) Queue as a Circular List (ii) Stack as a Circular List.

(OR)

1. b) Explain about the Array Implementation of

13) a) Explain briefly the Binary tree traversals.

(OR)

1. b) Discuss any 2 Insertion Sorts with example

14) a) Explain the Minimum Spanning Trees

(OR)

1. b) Explain the depth first traversal.

15) a) Discuss the Buddy System

(OR)

1. b) Discuss the compaction of blocks of storage

 

PART-C

Answer any two questions                                                2×20=40

 

16)  Discuss in detail the following

(i) Doubly Linked List (ii) Addition of Long integers using Doubly Linked List

 

17) a) Discuss in detail the following

(i) Quick Sort (ii) Merge Sort

1. b) Explain in detail about the Linked List using Dynamic Variables..

 

18) a) Explain in detail the undirected graphs and their traversals.

1. b) Discuss in detail the following
2. i) Worst Fit ii) Best Fit  iii) First Fit

 

 

Go To Main page