Scribd
Upload
5 views3 pages

DS Question Bank

Uploaded by

Jhanvikuvarba Solanki
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views3 pages

DS Question Bank

Uploaded by

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

‭DATA STRUCTURE QUESTION BANK‬

‭Unit-1‬

‭1.‬ W ‭ hat is data structure.Classify the different types of data structures and explain with‬
‭examples.‬
‭OR‬‭What are the two‬‭main types of data structures?‬
‭2.‬ ‭Discuss the common operations performed on data structures.‬
‭3.‬ ‭What is an algorithm?Explain different approaches to design an algorithm.‬
‭4.‬ ‭What is linked list?List out and Explain types of linked list in detail‬
‭5.‬ ‭Compare array and linked list.(Array Vs. Linked List)‬
‭6.‬ ‭Define abstract data type‬
‭7.‬ ‭Write an algorithm to perform all (create,insert,delete,display(traverse),count)operations‬
‭in a singly linked list‬
‭8.‬ ‭Write an algorithm to perform all (create,insert,delete,display(traverse))operations in a‬
‭doubly linked list.‬
‭9.‬ ‭State advantages,disadvantages and use of linked lists.‬

‭Unit-2‬

1‭ .‬ W ‭ hat is stack?explain representation of stack using array and linked list.‬


‭2.‬ ‭Write an algorithm to perform push,pop,peek(peep) operation on a stack using an array.‬
‭3.‬ ‭Write an algorithm to perform push,pop,peek(peep) operation on a stack using a linked‬
‭list.‬
‭4.‬ ‭What is stack?Explain any 3 stack applications in detail.‬
‭5.‬ ‭What is Queue?List Out and explain types of Queue in detail.‬
‭6.‬ ‭Write an algorithm to perform insert and delete operations on a simple(Linear) queue‬
‭using array.‬
‭7.‬ ‭Write an algorithm to perform insert and delete operations on a simple(Linear) queue‬
‭using a linked list.‬
‭8.‬ ‭Write an algorithm to perform insert and delete operations on a circular queue using‬
‭array.‬
‭OR‬‭Design an algorithm‬‭to perform insert operation in a circular queue.‬
‭9.‬ ‭Difference between stack and queue‬
‭10.‬‭Define recursion.‬
‭11.‬‭Convert the following infix expression to a postfix expression.‬
‭a.‬ ‭A*B+C/D‬
‭b.‬ ‭(A*B)+(C/D)-(D+E)‬
‭12.‬‭Evaluate the following infix expression using stack.‬
‭1.‬ ‭A – (B / C + (D % E * F) / G)* H‬
‭2.‬ ‭2 + 3 * 5 - 8 / 4‬
‭Ans:235*+84/-‬

‭Unit-3‬

1‭ .‬ W ‭ hat is a tree?List out and explain types of tree in detail.‬


‭2.‬ ‭Explain the following:‬
‭Tree‬ ‭Binary Tree‬
‭Full Binary Tree‬ ‭Complete Binary Tree‬
‭Degree‬ ‭In-Degree‬
‭Out-Degree‬ ‭Level Number‬
‭Height of tree‬ ‭Edge(Link)‬
‭Parent and Child node‬ ‭Siblings‬
‭Forest‬ ‭Leaf node‬
‭Ancestor node‬ ‭Descendant node‬
‭Path‬ ‭Root Node‬
‭Node‬ ‭Sub-tree‬
‭Depth of node‬ ‭Height of node‬
‭3.‬ ‭Differentiate between BFS and DFS‬
‭4.‬ ‭Explain the following:‬
‭Undirected Graph‬ ‭Connected Graph‬
‭Directed Graph(Diagraph)‬ ‭Path‬
‭Closed Path‬ ‭Simple Path‬
‭ ycle‬
C ‭Complete Graph‬
‭Regular Graph‬ ‭Weighted Graph‬
‭Loop‬ ‭Adjacent Nodes‬
‭Degree of Node‬ ‭Spanning Tree‬
‭Minimum Spanning Tree‬
‭5.‬ ‭Define a graph. What are the different ways to represent a graph?‬
6‭ .‬ ‭Give the BFS and DFS for the following spanning tree.‬

7‭ .‬ ‭Write a short note on BFS with example‬


‭8.‬ ‭Write a short note on DFS with example‬
‭9.‬ ‭Difference between BFS & DFS‬
‭10.‬‭List out shortest path algorithms.Explain algorithms in detail.(Dijkstra’s,Prim’s,Kruskal)‬
‭11.‬‭Using Prim's Algorithm, find the Minimum Spanning Tree (MST).Refer Examples PDF.‬
‭12.‬‭Using dijkstra’s Algorithm, find the Shortest Path.Refer Examples PDF.‬
‭13.‬‭Using Kruskal Algorithm, find the Minimum Spanning Tree (MST).Refer Examples‬
‭PDF.‬
‭14.‬‭Perform BFS & DFS for the following Graph(Refer Example PDF).‬

‭Unit-4‬

1‭ .‬ ‭ hat is searching?Explain types of searching techniques in detail.‬


W
‭2.‬ ‭What is linear search?Explain linear search algorithm with example.‬
‭3.‬ ‭Write an algorithm to perform binary search.‬
‭4.‬ ‭Search the number 50 from the given data using binary search technique.Illustrate the‬
‭searching process.‬
‭10,14,20,39,41,45,49,50,60‬
‭5.‬ ‭Difference between linear and binary search‬
‭6.‬ ‭What is sorting.List out and explain any 2 sort with examples.‬
‭7.‬ ‭Design an algorithm to perform Bubble sort.‬
‭8.‬ ‭Write an algorithm to perform selection sort.‬
‭9.‬ ‭Write an algorithm to perform Insertion sort.‬
‭10.‬‭Write an algorithm to perform merge sort.‬
‭11.‬‭Apply merge sort algorithm to the following elements 20 10 5 15 15 25 30 50 35‬
‭12.‬‭Explain quick sort with example‬‭OR‬‭Apply quick sort algorithm to the following‬
‭elements 40 21 8 17 51 34‬

You might also like