Scribd
Upload
39 views3 pages

Data Structure Question Bank

The document is a question bank for a course on Data Structures and Algorithms, covering various topics such as data types, algorithms, arrays, linked lists, stacks, and queues. It includes definitions, properties, operations, and examples related to each data structure. Additionally, it contains programming tasks and theoretical questions to assess understanding of the material.

Uploaded by

maheshnile15736
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
39 views3 pages

Data Structure Question Bank

The document is a question bank for a course on Data Structures and Algorithms, covering various topics such as data types, algorithms, arrays, linked lists, stacks, and queues. It includes definitions, properties, operations, and examples related to each data structure. Additionally, it contains programming tasks and theoretical questions to assess understanding of the material.

Uploaded by

maheshnile15736
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

CS – 231 Data Structure and Algorithm I

[ Prof.Ravi Junnakar ]

Questions Bank

Chapter 1 Introduction to Data Structure

1) What is data ? List the types of data.


2) Define the following terms.
a) Data Structure
b) Data type
c) ADT(Abstract Data Type)
d) Data object
e) Time Complexity
f) Space Complexity.
3) What is Linear Data Structure & Non linear Data Structure ?
4) Example of linear and non linear data structure.
5) What is Algorithm ? Explain the properties of Algorithm.
6) Define Big Oh & Omega Notation ?
7) Time Complexity of different N funcions.
8) Write short note on Asymptatic Notations.
9) Which notation are used to denote upper bond and lower bound time complexity of
the program.
10) What are component of space complexity.
11) Better algorithm improve program efficiency.true or false justify.
12) What is Precondition of Binary Search.
13) List various algorithm Strategies.

Chapter 2 : Array As Data Structure

1) What is array ? what is advantages and disadvantage of array?


2) List the operations of Array.
3) List the Application of Array.
4) Define the term
a)stable sorting
b)inplace sorting
c)internal sorting
d) External sorting
5) Define Divide and Conqure Strategy?
6) which sorting algorithms use Divide and Conqure Strategy ?
7) Best case & Worst case time complexity of various sorting and searching algorithms.
8) Define sential value.
9) Write a C program or function for Linear search,Sential search,Binary
Search,counting sort,selection sort(4 mark)
10) explain probability & ordered search.
11) Sorting Example on Bubble Sort ,Quick Sort,Merage sort,insertion sort,couning
sort,radix sort,selection sort,(4 mark).
12) list the comparision based and non comaprision based sorting algorihm.

Chapter No : 3 Linked List


1) What is linked list ? what are the types of linked list?
2) What is the difference between array and linked list ?
3) What is node structure of Singly linked list,Doubly linked list,Singly Circular Linked
List,Doubly Circular Linked List.
4) Defination of Circular linked list.
5) Functions for Singly linked list
a)create
b)display
c)search
d)sort
e)delete node at any position
f)insert node at any position

6) Functions for doubly linked list

a)create
b)display
c)search
d)sort
e)delete node at any position
f)insert node at any position
7) Linked List can traverse sequenstially.State true or false.
8) A linked List can store only integer values. True or false.
9) What is generalized linked list?explain node structure of generalized linked list.
10) difference between static and dynamic .

Chapter No : 4 Stack
1) What is Stack ? List the operation of Stack.
2) State the principal on stack work.
3) What is the application of stack ?
4) What is Top ?
5) What is the difference between peek () & pop ()?
6) Define underflow & overflow condition ?
7) What is recursion?
8) Which Data structure are used in recursion?
9) Explain Backtracking, List the Examples where backtracking is used.
10) Explain n Queen problem.
11) What is polish notation.
12) Program or Function on reverse string,checking string is palindrome or not.
13) Example of Infix to Postfix Convrsion . (Fix Question 4 marks)
14) Example of Postfix Evaluation.

Chapter 5: Queue
1) What is Queue ? List the operation of queue.
2) State the Principal on Queue work.
3) Difference between stack & queue.
4) What are the application of queue?
5) List the types of Queue.
6) What are the types of Priority queue?
7) What are the types of dqueue ?
8) Overflow and underflow queue.
9) Which types of queue are used in round robin algorithm.
10) Types of Queue like linear,circular,priority,doubly ended queue (exaplaination
any type).
11) Programs of static implementation of linear queue.
12) Programs of compare to linear queue.
13) Function of circular queue ,prirority queue add & delete operation.

You might also like