FOURTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/TECHNOLOGY-OCTOBER, 2009
DATA STRUCTURES
PART-A
(Maximum marks:15)
v Answer the following questions in one or two sentences:
1.What is data structure?
2.Declare a pointer to an array of ten integers.
3.What is the performance of the insertion sort on an array which is sorted in the reverse order?
4.Name an unstable sorting algorithm.A sorting algorithm is stable if it preserves the order of equal elements.
5.Briefly describe a linear linked list.
6.List two applications of linked list.
7.Define stack.
8.Why heap preferred to implement priority queue?
9.How many leaf node does the full binary tree of height 3 have?
10.list two applications of graph.
PART-B
(Maximum marks:60)
(Answer one full question from each unit)
Unit-1
v (a).With proper example explain recursion.(7)
(b)Write notes on(i)Array of pointers (ii)Void pointer.(5)
OR
v (a).Explain declaration and initialization of structure.(5)
(b)Write a function in C to check whether two strings are equal.Use pointers to access the strings.(7)
Unit-2
v (a)Write an algorithm for quick sort.(7)
(b)Trace the execution of insertion sort algorithm on the list given below:
65
|
55
|
75
|
60
|
72
|
62
|
(5)
OR
v (a)Explain merge sort with example.(7)
(b)Write an algorithm to search an element in a list using binary search.(5)
UNIT-3
v (a)Explain the operations insert and delete performed on singly linked list.(6)
(b)Write an algorithm to search an element in the linked list.(6)
OR
v Define doubly link list.Write an algorithm for the operation delete performed on it.(12)
UNIT-4
v (a)Illustrate with suitable diagram the evaluation of the expression:
4
|
5
|
*
|
6
|
-
|
7
|
/
|
8
|
+
|
(7)
(b)Explain different operations performed on stack.(5)
OR
v (a)Define priority queue.Explain the operation insert performed on priority queue.(6)
(b)Writes notes on(i)Double ended queue (ii)Circular queue.(6)
UNIT-5
v (a)Write an algorithm to implement the operation insert in a binary tree.(6)
(b)Write about the binary search tree.(6)
OR
v With appropriate example explain depth first search.(12)
0 comments:
Post a Comment