FOURTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/TECHNOLOGY-MARCH, 2011
DATA STRUCTURES
PART-A
(Maximum marks:15)
v Answer the following questions in one or two sentences:
1.What is pattern matching?
2.What is dynamic memory allocation?
3.Define merging.
4.What do you mean by external sorting?
5.Define circularly doubly linked list.
6.Write down the algorithm for displaying all elements in a list.
7.What is deque?
8.List the applications of queue.
9.What do you mean by depth of a tree?
10.Define adjacency matrix of a graph.
PART-B
(Maximum marks:60)
(Answer one full question from each unit)
Unit-1
v (a)Write a C program to perform the following string operations:
(i)Reverse of a string (ii)Compare two strings.(6)
(b)What is recursion and find the GCD of two numbers using recursion?.(6)
OR
v (a)Describe array of structures with an example.(6)
(b)Write a C program to sort numbers using function and pointers.(6)
Unit-2
v (a)Implement insertion sort algorithm(6)
(b)Compare linear search and binary search algorithms.(6)
OR
v (a)Write down the algorithm for merging two sorted arrays.(8)
(b)How records are sorted using external sort algorithm?(4)
UNIT-3
v Discuss about following basic operations in a doubly linked list.
(i)Insertion of a new node
(ii)Traversing the list
(iii)Delete a node(12)
OR
v Discuss about circular linked list and write down the procedure for insertion of a new node and display all the elements.(12)
UNIT-4
v (a)Implement stack operations using array.(8)
(b)Write short note on deque.(4)
OR
v (a)Explain the evaluation of postfix expression of P=Q*R/S with following values,P=4,Q=6,R=8,S=12.(6)
(b)Write down the procedures for insertion,deletion and display of elements in a circular queue.(6)
UNIT-5
v (a)Write an algorithm to search an element in BST.(6)
(b)Write the procedure to find the depth of a tree.(6)
OR
v (a)Write an algorithm to insert an element into BST.(6)
(b)Write down the BFS algorithm in a graph.(6)
0 comments:
Post a Comment