Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 3
Hindusthan College of Engineering And Technology
Approved by AICTE, New Delhi, Accredited with ‘A’ Grade by NAAC
(An Autonomous Institution, Affiliated to Anna University, Chennai) Coimbatore – 641 032
END SEMESTER UG/PG DEGREE EXAMINATIONS – MAR/APR 2020
DEPARTMENT : Information Technology COURSE CODE AND TITLE :16IT3202- Data Structures QP CODE: 16IT3202 Semester: III Duration: 3 Hours Maximum: 100 Marks BLOOMS TAXONOMY LEVEL (BTL) LEVEL L1 L2 L3 L4 L5 L6 TOTAL % 22% 36% 42% - - - 100%
PART A (Answer All Questions) (10 X 2 = 20)
BTL CO Mark (Two questions from each unit)
1. Define Abstract Data Type. U 1 2
2. List the advantages of linked lists over arrays. R 1 2
3. Use stack to convert the given infix expression to postfix:( a+b) * c + (d+e+f) / g AP 2 2
4. Cite about double ended queues. U 2 2
5. How do you represent a binary tree in memory? R 3 2
6. Infer in what way an AVL tree is better than a binary tree? R 3 2
7. What is meant by Minimum spanning tree? R 4 2
8. Identify the difference between feasible solution and optimal solution. U 4 2
9. Sort the elements using 77, 49, 25, 12, 33 and 81 using Selection sort. AP 5 2
10. Give the significance of extendible Hashing. U 5 2
PART B (Answer All Questions) ( 5 X 14 = 70) (One question from each unit – it can be either one division with 14 Marks or 7 + 7) 11 Write routines to create a singly linked list and to insert element at different U 1 7+7 positions in a singly linked list. OR
U 12 State the ADT operations of circular linked list and write routines to 1 14 implement the same. 13 R 2 14 Explain with an example to evaluate an expression using stack. OR
14 What are circular queues? Write the necessary procedure to insert element R 2 14 and delete elements from Circular Queues using Array Implementation.
Describe the routine for AVL tree insertion. Insert the following elements in 15 U 3 14 the empty tree and balance the tree after each insertion. 2 5 4 6 7 9 8 3 1 10 OR
Construct a min heap for the sequence of number 45,27,36,18,16,21,23,10.
i U Find out the parent of node 10, 21, and 23. Which element will be deleted 16 when the delete algorithm is called thrice? 3 8+6 ii U Discuss the applications of a binary heap.
Using Dijkstra’s shortest path algorithm, find out a least cost path to all other nodes starting from vertex A. A B C D E 17 A 0 ∞ ∞ 7 ∞ AP 4 14 B 3 0 4 ∞ ∞ C ∞ ∞ 0 ∞ 6 D ∞ 2 5 0 ∞ E ∞ ∞ ∞ 4 0 OR
Show the working of Floyd-Warshall’s algorithm to find the shortest path
between all pair of nodes in following graph.
18 AP 4 14
Apply quick sort algorithm to show the elements 42, 34, 75, 23, 21, 18, 90, 19 AP 5 14 67, 78. Trace the sorting process of algorithm. Aldo write the pseudo code of quick sort algorithm. OR
20 Calculate hash values of keys:1892, 1921, 2007, 3456 using different AP 5 7+7 methods of hashing. PART – C (1 X 10 = 10) (Application/Design/Analysis/Evaluation/Creativity/Case Study)
Given a linked list that contains alphabets. The alphabets may in upper case 21 AP 1 10 or lowercase. Create two linked list - one which stores uppercase alphabets and the other that stores lower case alphabets. OR
Draw the binary search tree for the following input list 60, 22 AP 3 10 25,75,15,50,66,33,44. Trace an algorithm to delete the nodes 25, 75, 44 from the tree.
