FOURTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/TECHNOLOGY-MARCH, 2010
DATA STRUCTURES
PART-A
(Maximum marks:15)
v Answer the following questions in one or two sentences:
1.State the method of accessing variables using pointers.
2.Differentiate between pass by value and pass by reference.
3.What is mean by space complexity?
4.Write the best-casre,worst-case and average-case time complexities of selection sort.
5.Write the structure definition to represent a node of doubly linked list.
6.What is a circular linked list?
7.Write any three applications of stack.
8.Write the postfix notation of(a+b)*c-d/e.
9.Write any three applications of tree.
10.Write the recursive program for the in-order traversal of a binary tree.
PART-B
(Maximum marks:60)
(Answer one full question from each unit)
Unit-1
v Explain and implement the pattern matching algorithm.(12)
OR
v (a)Explain array of structures with example.(8)
(b)Differeentiate between structure and union.(4)
Unit-2
v Explain and implement the quick sort algorithm.(12)
OR
v Explain and implement the insertion sort algorithm.(12)
UNIT-3
v (a)What is a singly linked list?.(4)
(b)Explain the insert and search operations on a singly linked list.(8)
OR
v (a)What is a doubly linked list?(4)
(b)Explain insertion of a node into doubly linked list.(8)
UNIT-4
v Explain and implement the double-ended queue.(12)
OR
v Implement queue using linked list.(12)
UNIT-5
v (a)What is a binary tree?.(2)
(b)Explain the deletion of a node from a binary tree.(10)
OR
v (a)Explain the adjacency matrix and adjacency list representation of a graph.(6)
(b)Explain the breadth first search algorithm.(6)
0 comments:
Post a Comment