DATA STRUCTURES -OCTOBER-2010

FOURTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/TECHNOLOGY-OCTOBER, 2010

DATA STRUCTURES

PART-A

(Maximum marks:15)

v  Answer the following questions in one or two sentences:

1.What is a self-referential structure?

2.What is mean by dynamic memory allocation?

3.Write the best-case,worst –case and average-case time complexities of the merge sort.

4.What is mean by time complexity?

5.What is a doubly linked list?

6.Write any two applications of linked list.

7.What is a stack?

8.What is a Dqueue?

9.Define binary tree.

10.List the three traversals on a binary tree.

PART-B

(Maximum marks:60)

(Answer one full question from each unit)

Unit-1

v  (a)Explain array of structures with program.(7)

          (b)How a one-dimensional array can be accessed using pointers?.(5)

OR

v  Implement the following string operations:

(i)String length(3)
(ii)String copy(3)

(iii)String reverse(3)

(iv)String concatenation(3)

Unit-2

v  Explain the bubble sort algorithm and trace with an example.(12)

         

OR

v  (a)Implement the linear search algorithm.(5)

          (b)Implement the binary search algorithm.(7)

UNIT-3

v  (a)What is  a doubly linked list?.(4)

          (b)Explain the delete operation on a doubly linked list.(8)

OR

v  (a)What is a circular linked list?.(4)

          (b)Explain the insert and delete operations on a circular linked list.(8)

UNIT-4

v  (a)What is a stack?(4)

(b)Implement stack using linked list.(8)

OR

v  (a)What is a queue?(4)

          (b)Implement queue using array.(8)

UNIT-5

v  Explain the deletion of a node from a binary tree.(12)

OR

v  (a)What is a graph?Which are the graph representation methods?(6)

(b)Explain the depth first search algorithm.(6)

        

Please Give Us Your 1 Minute In Sharing This Post!

SOCIALIZE IT →

Tweet

FOLLOW US →

SHARE IT →

Powered By: BloggerYard.Com