VIGNAN’S INSTITUTE OF INFORMATION TECHNOLOGY (A)

Visakhapatnam
(2024 Admitted Batch) I B. Tech- II Semester (VR23), February-25

Question Bank for MID-1 Portion

Name of the Subject: DATA STRUCTURES

Subject Code: 1005231201 Mid: I
Name of the Faculty: Mr. Ramaraju SVSV Palla Designation: Assistant Professor
EMAIL: s i v a r a m a r a j u @ v i g n a n i i t . e d u . i n phone no: 8185967153

Please follow the standard of the question paper as per the norms:

No. of Questions
As per the Bloom Taxonomy
UNIT Short
Level Essay Type
Answer Type
1
LEVEL – 1 (Easy) 3 4
2
3 Each unit LEVEL – 2 (Average) 4 4
4
LEVEL – 3 (Difficult) 3 4
5

UNIT WISE FORMAT FOR DESCRIPTIVE AND SHORT ANSWER TYPE QUESTIONS
UNIT-1 PART-A
Level of
Marks
Q. No Short Answer Questions Bloom T CO
(2M)
axonomy
1 List any four operations on data structure. L1 CO1 2M
2 Write any four applications of data structures L1 CO1 2M
3 Differentiate between Linear and Non-Linear data structures L2 CO1 2M
w.r.t. any 2 parameters.

4 Define searching and give its types L1 CO1 2M

5 What are the limitations of Linear search? L1 CO1 2M

6 Differentiate between binary search and sequential search. L2 CO1 2M

7 Define sorting and list 4 sorting techniques L2 CO1 2M

8 Differentiate between Stable and Un-Stable Sorting L2 CO1 2M

9 Explain the term: time complexity L2 CO1 2M

10 Explain the term: Space Complexity L2 CO1 2M

11 List the 3 types of Notation for representing complexity L1 CO1 2M

12 Define ADT and list the advantages of the same L1 CO1 2M

 UNIT-1 PART-B

(EITHER EACH QUESTION FOR 12 MARKS OR TWO QUESTIONS (6M + 6M)

Level of
Marks
Q. No Descriptive Questions Bloom CO
(12 M)
Taxonomy
A Write and explain the algorithm of linear search L2 CO1 6M
1 What are the advantages of linear search over binary search? Justify your
B L2 CO1 6M
observation with an example?

A Write and Explain the algorithm of Binary Search L1 CO1 6M

2 What is Data Structure. Explain the classifications of data
B L1 CO1 6M
structures.
A Find the position of element 92 using binary search method in an array ‘A’ L3 CO1 6M
3 given below: A {11, 5, 21, 3, 92, 17,2,43}

Explain the working of Bubble sort method with an example.

B L1 CO1 6M
A Explain the basic idea behind insertion sort and how it works. Illustrate with L3 CO1 6M
4 pseudo code and a suitable example.

B Write an algorithm for Selection Sort L1 CO1 6M

A Sort the following numbers in ascending order using Insertion sort. Given L3 CO1 6M
5 numbers “843, 41, 416, 1853, 74” and write the output after each iteration.

B Differentiate between bubble sort and selection sort. L2 CO1 6M

Sort the following values using Selection (35,50,45, 40,55, 30, 25, 20, 15).
A L2 CO1 6M
6 Illustrate each step of the sorting process

B Classify different types of data structures and their applications and L1 CO1 6M
example?
Sort the following numbers in ascending order using Bubble sort. Given
A L2 CO1 6M
7 Numbers: 348, 14, 614, 5381, 47 and write the output after each iteration.

B Write an algorithm for Insertion Sort L2 CO1 6M

A Write a C Program of insertion sort or selection sort using functions with L3 CO1 6M
example
8
Write a C Program of Bubble Sort using Functions with example
B L1 CO1 6M
A Write about the time complexity with all notation, with its respective L2 CO1 6M
9 graphs?
B Trace the following to search the element 45 is found or not using binary L2 CO1 6M
search technique: 10,20,30,45,50,60,70
A Find the time complexity of the following code and explain how it is L3 CO1 6M
obtained
10
for(i=0;i<n;i++)
{ for(j=0;j<n;j++)
{ printf(“Value of I =%d”,+i);
}
}

Differentiate between binary search and linear search with example.

B L2 CO1 6M
 UNIT-2 PART-A

Level of Bloom Marks

Q. No Short Answer Questions CO
Taxonomy (2M)
1 Write a code for creating a DLL-Node and represent with neat L3 CO2 2M
diagram?

2 List and represent different types of Linked lists L1 CO2 2M

List the advantages and disadvantages of representing a group of
3 L2 CO2 2M
items as an array versus a linked list.
Write the logic to count the number of nodes in a linked list and find
4 L2 CO2 2M
the time complexity
5 Memory representation of double linked list with all parameters? L2 CO2 2M
6 Compare single linked list, double linked list and circular linked list. L2 CO2 2M
w.r t. to any 2 parameters
7 Describe any two terms from the following: information Field/ Data L1 CO2 2M
Field, Address, Next Pointe w.r.t. Circular Linked List with diagram

Which of the search algorithm is not feasible to implement in a

8 L2 CO2 2M
linked list?
9 Write any two Advantages of Singly Linked List L1 CO2 2M
10 Describe any two terms from the following: Node, Null L2 CO2 2M
Pointer, Empty List w.r.t to linear linked list with diagram

UNIT-2 PART-B

(EITHER EACH QUESTION FOR 12 MARKS OR TWO QUESTIONS (6M + 6M)

Level of Bloom Marks
Q. No Descriptive Questions CO
Taxonomy (12 M)
A What is Linked List? Explain different types of linked list. with neat L1 CO2 6M
1 diagram
1. Create SLL using data fields 10, 20, 30, 40, 50 and show CO2
B L3 6M
procedure step by step with the help of diagram from start to end.
Search a node 40 from the SLL and show procedure step-by-step
with the help of diagram from start to end.

Explain different methods to represent singly linked list in the memory? CO2
A L2 6M
2
Write algorithm to delete an intermediate node from a singly linked list CO2
B L3 6M
A Explain how to represent doubly linked list in the memory. With neat L2 CO2 6M
3 diagram
B Write algorithm, pseudo code to insert and delete a node at beginning of L3 CO2 6M
Singly Linked list

A Discuss the applications of linked list. L2 CO2 6M

4
B Create Circular LL using data fields 10, 20, 30, 40, 50. And show the L3 CO2 6M
logic to delete element 50 with procedure.

A What is double linked list. Write the function to insert and remove L2 CO2 6M
5 elements from a doubly linked list at the end.

B Write algorithm to insert an intermediate node to a circular linked list. L3 CO2 6M

A Differentiate between arrays and linked list. L2 CO2 6M
 Write algorithm, pseudo code to insert and delete a node at beginning CO2
B L3 6M
6 of doubly Linked list
A Write algorithm, pseudo code to delete a node at beginning of circular L1 CO2 6M
7 Linked list
Write about circular linked lists and its types and memory representation CO2
B L3 6M
of CLL
A Discuss the advantages and disadvantage of linked list L1 CO2 6M
8 CO2
B What is Circular linked list. Write the function to insert and remove L2 6M
elements from a circular linked list at beginning

A Write a logic to create a double linked list of 3 nodes and above and L1 CO2 6M
9 display them.
B Develop an algorithm to reverse the nodes of a singly linked list? Show L3 CO2 6M
with example.

A Differentiate among singly linked list, doubly linked list and circular L2 CO2 6M
10 linked list with neat diagram
B Write a logic to create a single linked list of 3 nodes and above and L3 CO2 6M
display them.

UNIT-3 PART-A
Level of Bloom Marks
Q. No Short Answer Questions CO
Taxonomy (2M)
1 Define stack. L1 CO3 2M
2 What is the principle of stack. L2 CO3 2M
3 List out various operations of the stack. L1 CO3 2M
4 What is the condition for stack full. L1 CO3 2M
5 What is the condition for stack empty. L1 CO3 2M
6 Represent a STACK with all its properties with neat diagram L2 CO3 2M
7 Give any two applications of stack. L2 CO3 2M

8 List any 4 real time examples of stack L2 CO3 2M

9 Describe about the following terms: 1. PUSH, 2. POP L2 CO3 2M

Level of
Marks
Q. No Short Answer Questions Bloom CO
(6M)
Taxonomy
1 Explain the stack ADT, State and explain the different representation of stack
with example And diagram. L1 CO3 6M

2 Write and explain the algorithms of peek, ISFULL, ISEMPTY operations of

stack? L2 CO3 6M

3 Explain the stack overflow and underflow conditions with examples? L2 CO3 6M
Show the effect of PUSH and POP operation on to the stack of size 10. The
4
stack contains 10, 20, 22, 26, 28, and 30 being at top of the stack. Show
diagrammatically the effect of L1 CO3 6M
PUSH (46), PUSH (48) POP POP POP
Sketch the final structure of stack after performing the above said operations.
5 Design an algorithm to perform PUSH and POP operations in a stack L3 CO3 6M
Name & Signature of the faculty Signature of HoD