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

Latest Govt Job & Exam Updates:

View Full List ...