Annamalai University DATA STRUCTURES Supplementary Examination - June 2011 Question paper

University: Annamalai  University
Course: DATA STRUCTURES
Subject : DATA STRUCTURES Supplementary Examination
Year of  Question Paper :June 2011

Reg. No. ________                                                                                                                                                      

Karunya University

(Karunya Institute of Technology and Sciences)

(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

Supplementary Examination - June 2011

Subject Title: DATA STRUCTURES                                                                                            Time: 3 hours

Subject Code: CA322                                                                                                           
Maximum Marks: 100           

                                                                                                                                                                                                                                               

Answer ALL questions (5 x 20 = 100 Marks)

1.         a.         What is Linked List?                                                                                                                                                                          (4)

            b.         Explain about Singly Linked Lists with Insertion and Deletion.                                                                   (16)

(OR)

2.         a.         Elaborate the Workspace/Index Table Method with Illustration.                                                      (15)

            b.         Discuss about Garbage Collection.                                                                                                                                        (5)

3.         Describe the following Queue implementation.

            a.         Circular Implementation of a Queue.                                                                                                                         (8)

            b.         Linked List Implementation of a Queue.                                                                                                                               (8)

            c.         Priority Queue                                                                                                                                                                                     (4)

(OR)

4.         Explain the following Recursion Implementation Problem.

            a.         Towers of Hanoi Problem                   b.         Queens Problem.                                                                                     (12+8)

5.         Compulsory:

            a.         Write about Linked Representation of Binary Tree.                                                                                      (8)

            b.         Explain about Binary Tree Traversals.                                                                                                                                    (12)

6.         a.         Explain about implementing a Multidimensional Array.                                                                               (8)

            b.         Write about Sparse Matrices and Generalized Dope Vector Implementation.                                   (12)

(OR)

7.         Elaborate on the Shortest Path Algorithm.                                                    

8.         Explain the following Internal Sorts with procedure.                                                                                                            (4x5)

            a.         The Insertion Sort                   b.         The Selection Sort                   c.         The Shell Sort

            d.         The Quick Sort.                                                                                  

(OR)

9.         Discuss the following Sorting and Searching with procedure.

            a.         The Heap Sort b.         Sequential Search                    c.         Binary Search                                      (10+5+5)...

Share This