Wednesday, July 8, 2015

Annamalai University DATA STRUCTURES November/December Question paper 2010

University: Annamalai  University
Course: DATA STRUCTURES
Subject : DATA STRUCTURES
Year of  Question Paper : 2010


Reg. No. ________                                                                                                                                                      
Karunya University
(Karunya Institute of Technology and Sciences)
 (Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)

End Semester Examination – November/December 2010

Subject Title: DATA STRUCTURES                                                                    
Time: 3 hours
Subject Code:09CS208                                                                                                          
Maximum Marks: 100           
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                               

Answer ALL questions

PART – A (10 x 1 = 10 MARKS)

1.         In a stack, entries are made at the _______ end of the stack.
2.         Define polish notation.
3.         State the concept of queue.
4.         What are header nodes?
5.         Give any two different types of tables.
6.         What are the three different traversals in binary trees?
7.         What are the two main classifications of sorting based on the source of data?
8.         An AVL tree is a binary tree with ___________.
9.         What is a directed graph?
10.       Define path in a graph.

PART – B (5 x 3 = 15 MARKS)

11.       Write down the definition of data structures.
12.       What is a doubly linked list?
13.       List out the problems in hashing.
14.       What is a balance factor in AVL trees?
15.       What is meant by strongly connected in a graph?

PART – C (5 x 15 = 75 MARKS)

16.       Explain the operations of a stack with an algorithm.
(OR)
17.       Discuss the conversion of infix expressions to polish notation.

18.       Write an algorithm to perform the following operations on linear linked lists.
            a.         Insert a node in the list                       b.         Delete a node in the list                                                                      (8+7)
(OR)
19.       Explain briefly about doubly linked linear lists.

20.       Describe the Linear search Algorithm with an example.
(OR)
21.       Discuss on the following with examples.
            a.         Bubble sort.                 b.         Selection sort                                                                                                                          (7+8)

22.       Briefly discuss on the ways of binary tree traversals and their algorithms.
(OR)
23.       Write notes on application of trees in manipulation of arithmetic expressions.

24.       Explain the matrix representation of graphs.
(OR)
25.       Explain the following algorithms

            a.         Breadth First Search.              b.         Depth First Search        (7+8)..                                                                                      
Share This
Previous Post
Next Post

B.E Civil Engineer Graduated from Government College of Engineering Tirunelveli in the year 2016. She has developed this website for the welfare of students community not only for students under Anna University Chennai, but for all universities located in India. That's why her website is named as www.IndianUniversityQuestionPapers.com . If you don't find any study materials that you are looking for, you may intimate her through contact page of this website to know her so that it will be useful for providing them as early as possible. You can also share your own study materials and it can be published in this website after verification and reviewing. Thank you!

0 comments:

Pen down your valuable important comments below

Search Everything Here