Scribd
Upload
11 views

Set1 Dsmodel

The document contains exam questions divided into three parts - abstract data types, data structures, and algorithms. Part A contains 10 two-mark questions on ADTs, trees, graphs and their applications. Part B contains 5 thirteen-mark questions involving implementations of linked lists, stacks, trees and graph traversals. Part C contains 1 fifteen-mark question on minimum spanning trees or hashing with linear probing.

Uploaded by

Vincy John
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views

Set1 Dsmodel

The document contains exam questions divided into three parts - abstract data types, data structures, and algorithms. Part A contains 10 two-mark questions on ADTs, trees, graphs and their applications. Part B contains 5 thirteen-mark questions involving implementations of linked lists, stacks, trees and graph traversals. Part C contains 1 fifteen-mark question on minimum spanning trees or hashing with linear probing.

Uploaded by

Vincy John
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

PART-A(10*2=20)

1.State the uses of Abstract Data Type(ADT)


2.What is Bi-Connectivity?
3.Write the difference between Linear Queue and Circular Queue.
4.State the Properties of Binary Search Tree.
5.State the uses of topological sort.
6.Compare Linear and Binary Search.
7.Depth of complete binary tree is 8 and compute the number of nodes in leaf node.
8.Define Euler Circuits.
9.what are the representation of graph.
10.List out the Application of Stacks.

PART-B(5*13=65)
11.a)Explain how Polynomial expression can be implemented using linked list.(13)
Or
b)Write the routine to perform following operation on circular linked list.(13)
i)insertion
ii)deletion.
iii)Display.

12.a)write an algorithm to perform push and pop operation om stack using linked list.(13)
Or
b) write the procedure tp convert the infix to postfix expression and steps involved in evaluating the
postfix expression.convert the expression A-(B/C+(D%E*F)/G)*H to postfix form.Evaluate the given
expression 934*8+4/- (13)
13.a.i)Write the following routine to implement the binary search tree operation
i) search operation(4)
ii)Find Min(),Find Max()(4)
ii)write a routine to implement the AVL Tree operation
i)Rotation (5)
(Or)
b)Identify the types of priority queue and explain about min heap insertion and deletion operations.
14.a)Explain about the B+ tree with an algorithm to insert a node into tree and write a difference
between B tree and B+ tree.
(Or)
b)Outline the breadth first search and depth first search traversal of a graph with an example.(13)
15.a)Write an algorithm to Implement the bubble sort with an suitable example(8)
b)Write an algorithm for insertion sort and explain it with an example(7)
(Or)
b)Discuss the collision resolution strategies using in hash system with an example(13)

PART-C(1*15=15)
16.a.i)Write a routine for Kruskal algorithm.(7)
ii)Find the minimum spanning tree for the given tree using prims algorithm and write an algorithm
(8)

(Or)

b)The keys 12,18,13,2,3,23,5 and 15 are inserted into an initially empty hash table of length 10 using
linear probing with hash function h(k)=k mod 10.what is the resultant of hash table? (15)

You might also like