www.Vidyarthiplus.

com

UNIT I
PART A
1.

Define Data Structure.

2.

Define ADT

3.

Write about Linked List.

4.

What is the advantage of using Doubly Linked List?

5.

Explain about Circular Linked List. Mention the advantage of this.

6.

Describe about Stack model.

7.

Mention the applications of Stack.

8.

Briefly discuss about Queue ADT.

9.

Define Big-O Notaion

10.

Write about Running Time computations

PART B
1.

Explain about the Array implementation of Stack.

2.

Explain about the Pointer implementation of Stack.

3.

Describe about the Array implementation of Queue

4.

a. Write about Circular Linked List with its advantages.

b. Write about Doubly Linked List with its advantages.

5. Write in detail about the operations of Singly Linked list
6. compute the Running time of the subsequent
(a).
void find_result()
{
int j,i=10,s=0;
for(j=0;j s = s + j;

www.Vidyarthiplus.com

www.Vidyarthiplus.com
printf(%d,s);
}

(b)
void print_sum(int a[][])
{
int i,j;
float s=0;
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
if(i==j)
s = s + a[i][j];
}
}
printf(%f,s); }

7. discuss about the concept of Balancing the Symbols and Evaluation of Postfix
Expression using stack.
8. explain about the conversion of Infix into Postfix Notation using Stack and the usage
of stack while compiling the functions in a program.

www.Vidyarthiplus.com

www.Vidyarthiplus.com

UNIT II
Part A
1.

What is a Tree ADT. describe height of a tree with example.

2.
What is a Binary tree? What is the avg. depth of a binary search tree? Draw Worst-case binary
tree and specify its depth.
3.

Write algorithm to insert a value into binary search tree.

4.

What is an expression tree? Draw an expression tree for a*b*c+e/d.

5.

What is lazy deletion?

6.

What are self-adjusting data structures?

7.

List the situations in which single rotations be performed in an AVL tree.

8.

What is B-Tree? List the applications of B-Tree.

9.

describe priority queue. Mention the properties of Binary Heap.

10.

Give a tree representation of the formula (a+b)*(c+d).

11.

What is the worst case search time in a balanced binary tree.

12.

Give prefix, infix, postfix expression corresponding to the subsequent tree.

Part B
1.

Write algorithms to implement the basic binary search tree operations-search, delete.

2.
Show the outcome of inserting 3,1,4,6,9,2,5,7 into an initially empty binary search tree. Show
the outcome of deleting the root.
3.

Show that the complexity of binary search algorithm for avg. and worst case is O(log2n).

4.

Explain the concepts for performing single and double rotations of AVL Trees?

5.

Show the outcome of inserting 2,1,4,5,9,3,6,7 into an initially empty AVL tree.

6.

Describe a data structure in which sequence of M operations takes total time of O(M log N).

7.

a.What are B-Trees.?

bWite algorithms to perform Insert and Delete into a B-Tree.

www.Vidyarthiplus.com

www.Vidyarthiplus.com
8.

Write algorithm to discuss various kinds tree traversals. discuss with example.

9.

Write the algorithm to insert an element from the binary heap tree. discuss with example.

10.

Write the algorithm to delete an element from the binary heap tree. discuss with example.

11.
Show the outcome of inserting 10,12,1,14,6,5,8,15,3,9,4,11,13,and 2, 1 at a time, into an initially
empty binary heap.

UNIT III

PART A
1.

Sort the sequence 3,1,4,5,9,2,6,5 using insertion sort.

2.

What is the running time of insertion sort in all elements are equal?

3.

Show the outcome on running Shell sort on the input 9,8,7,6,5,4,3,2,1 using the shell sizes 7,3,1.

4.

Write about the running time of heap sort.

5.

sort 3,1,4,1,5,9,2,6 using merge sort.

6.

Write algorithm for linear search.

7.

Give best, worst, avg. case analysis of sequential search

8.

Write about diminishing increment sort.

9.

What is meant by External Sorting?

10.

Explain about Multiway Merge Sorting.

11.

Construct a heap tree : 99,77,44,22,1,76,89,91,90

12.

Explain about the basics of Hashing technique

13.

Write about bucket sorting.

14.

Define open hashing and closed hashing.

www.Vidyarthiplus.com

www.Vidyarthiplus.com

PART B

1.

Write algorithm to implement insertion sort and explain about the running time.

2.
102.

Show how heap sort processes the input 142, 543, 123, 65, 453, 879, 572, 434, 111, 242, 811,

3.

Write algorithm for binary search, discuss with example.

4.

Write the algorithm to perform Shell Sort with example.

5.
Write the routine to implement merge sort. Perform the merge sort for the subsequent list of
elements: 24,13,26,1,2,27,38,15.
6.

Write the routine to implement Quick Sort and discuss with an example.

7.

Write the routine to implement Polyphase Sorting.

8.

Write the routine to implement Multiway Merge Sorting.

9.

Write the algorithm to perform Heap Sort and discuss with example.

10.

Explain about Linear Probing and Quadratic probing techniques used in Hashing Techniques

11.

Explain about Linear Probing and Double Hashing techniques used in Hashing Techniques

UNIT IV
1.

What is a Graph ADT?

2.

Define the following:path, simple path, cycle, connected graph, complete graph.

3.

What are the 2 ways of representing graphs?

4.

List the techniques used in reducing the running time of Dijkstras algorithm.

5.

What is meant by negative edge cost?

6.

What is DAG?

7.

Write an algorithm to perform Depth 1st Search in an undirected graph.

8.

What is meant by Minimum Spanning Tree?

9.

Define depth 1st search.

www.Vidyarthiplus.com

www.Vidyarthiplus.com
10.

Describe the subsequent

a.

Class NP

b.

NP Complete issues

PART B
1.

Describe the implementation of Dijkstras algorithm with an example.

2.
Describe the Prims algorithm for finding the minimum spanning tree in an undirected graph and
analyze its running time.
3.
Describe the Kruskals algorithm for finding the minimum spanning tree in an undirected graph
and analyze its running time.
4.
What is an Euler circuit? discuss the procedure to obtain an Euler circuit in an undirected graph
with an example.
5.

Describe how to solve the Traveling Salesperson issue with example.

6.

Explain about the applications of Depth 1st Search.

7.

Explain about Network Flow issue.

UNIT V
PART A

1.

What is a Greedy Algorithmic Technique?

2.

Write notes on Huffman Codes.

3.

Describe the on-line algorithms used in bin packing issue.

4.

What are Randomized Algorithms?

5.

What is Backtracking Technique?

PART B
www.Vidyarthiplus.com

www.Vidyarthiplus.com

1.

Describe how greedy algorithm can be used in solving scheduling issue.

2.

Describe the off-line algorithms used in bin packing issue.

3.

What is dynamic programming? discuss with an example.

4.

Explain the divide and conquer technique.

5.
a.A file contains only colons, newlines, commas and digits in the subsequent frequency:
colon(100), space(605), new line(100), comma(705), 0(431), 1(242), 2(176), 3(59), 4(185), 5(250), 6(174),
7(199), 8(205), 9(217).Discuss a Greedy algorithm to compress the file.
6.

Describe in detail how greedy algorithms can be used in the Selection issue.

7.

What are Randomized Algorithms? Write notes on Random number generators.

8.

Explain about Backtracking algorithm with example.

www.Vidyarthiplus.com