Scribd
Upload
19 views2 pages

DS Important Questions

Uploaded by

Ram Thammi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views2 pages

DS Important Questions

Uploaded by

Ram Thammi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Q. No.

Questions
Unit-I

1 i Define Data Structure? Explain types of Data Structures.


Explain binary search and trace the steps to search for the element 63 for sorted
ii
list of elements 12,32,46,55,63, 76, 82, 98 using Binary search.
Illustrate the Insertion sort algorithm and explain the step by step procedure of
2 i Insertion Sort method for sorting the following unordered list of elements
35,47,51,72,42,66,12,24
Explain the Linear Probing and Quadratic Probing collision resolution
ii
technique with an example.
Write the bubble sort algorithm and explain the step by step procedure of
3 i bubble Sort method for sorting the following unordered list of elements
75,77,26,12,22,56,26,76.
Compare and Contrast the Linear and Binary Search algorithms and derive its
ii
best,worst and average time complexities
Illustrate the working of Radix sort algorithm and give its time and space
4 i complexities. Demonstrate the process of sorting the unordered list of elements
15, 1, 321, 10, 802, 2, 123, 90,109,11 using Radix sort.
Analyze the Merge sort algorithm and give its complexity analysis. Explain
ii how many passes are required to sort the following list of elements 10, 80, 30,
90, 40, 50, 70 using Merge sort.
Unit-II

List and Discuss the various applications of single linked lists with suitable
5 i
example.
Analyze Single linked list algorithm to insert a node at the beginning and
ii
ending.
6 i Discuss the deletion procedure for Single linked lists.
Discuss how to display elements of double liked list from Left to right and right
ii
to left
7 i Illustrate the insertion procedure for Double linked lists.
ii Differentiate between array and linked list.
Explain about double linked list algorithm to insert a node at the beginning and
8 i
ending
ii Discuss the insertion procedure for Circular Single linked lists.
Unit-III(Mid-I)

9 i Discuss the Priority Queues.


ii Explain representation of Queues using Linked List.
10 i Explain representation of Queues using Arrays.
ii List and explain about the basic operations that can be performed on a queue.
Unit-III(Mid-II)
How will you apply the stack in converting the infix expression
11 i A+(B*C-(D/E^F)*G)*H into its equivalent postfix notation ? Explain each step
by tracing the stack contents
ii Explain the stack application of reversing the list?
Write an algorithm for push, pop and display operations of stack with an
12 i
example?
Define stack data structure & evaluate the postfix expression 10 6 +2/3 2*- and
ii
explain each step by tracing the stack contents?
Unit-IV

13 i Define tree and explain the basic terminologies in tree with an example.
Construct a binary search tree for the following elements 75, 25, 89, 80, 20, 65,
ii
22, 10, 50 and apply delete operation
14 i Describe the memory representation of binary tree using array & linked list?
Define max heap? Implement the max for the following list of elements 5, 7,
ii
9,1,3,10,8,4.
Explain the construction of a binary search tree by inserting the element and
15 i delete operation 13,3,4,52,44,70,5,6,2,3,,9,31,6,48 in that order , starting from
an empty tree?
ii Construct an expression tree with suitable example.
16 i Explain the properties of binary tree with an example?
ii Discuss various tree traversal techniques with neat diagram?
Unit-V

Explain the principle Warshall’s algorithm. Explain the sequence of steps in


17 i
generating transitive closure for the directed graph with an example
ii Discuss Single Source shortest path with suitable example
18 i Define Graph. Explain in detail various representations of graph data structures.
ii Define DFS? Discuss the implementation of DFS with suitable example
Define Minimum cost Spanning Tree and Explain Prim’s Algorithm with
19 i
example
ii Explain the Kruskal’s algorithm for generating a minimum spanning tree.
20 i Implement the BFS algorithm with an example.
ii Write the Dijkstra’s shortest path and perform complexity analysis.

You might also like