VAAGDEVI ENGINEERING COLLEGE SET-1

P.O.BOLLIKUNTA, WARANGAL – 506 005

B. TECH II YEAR I SEMESTER, I - MID EXAMINATIONS SEP – 2024
Department of Computer Science and Engineering(AI&ML)
Sub: Data Structures

Time: 2 Hours Max. Marks: 30

Date:19/09/24 Note: This question Paper Contains two parts. Part A & B

Assessment pattern as per Bloom’s Taxonomy:

Remember Understand Apply Analyze Evaluate Create Total
5 15 10 30
Course Outcomes for Assessment in this Test:
COs Course Outcome
1 Ability to select the data structures that efficiently model the information in a problem.
Ability to assess efficiency trade-offs among different data structure implementations or
2
combinations
3 Implement and know the application of algorithms for sorting and pattern matching
Design programs using a variety of data structures, including hash tables, binary and general tree
4
structures, search trees, tries, heaps, graphs, and AVL-trees.
PART – A (10 X 1 = 10 Marks)
Marks
CHOOSE THE CORRECT ANSWER
Which of the following is a primitive data type [ ]
1. A) stack B) array C) int D) None 1

. ...... is not the operation that can be performed on queue. [ ]

2. A) Traversal B) Insertion C) sort D) Retrieval 1
Which of the following is a non linear data structure? [ ]
3 A) Stack B) Linked lists C) Linear arrays D ) tree 1
If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what
order will they be removed? [ ] 1
4.
A) ABCD B) DCBA C) DCAB D) ABDC
Which function used For deallocating the memory in C []
5. A) malloc B)new C)free D)All the above 1

FILL IN THE BLANKS

6. keyword used to allocate memory dynamically in C. 1
7. Graph is data structures. 1
The variable used to represent the position of stack is
8. 1
Process of inserting an element in stack is called_ .
9. 1
10. Full form of an ADT is 1
 PART – B Marks Mapping Bloom’s
ANSWER ANY FOUR OF THE FOLLOWING COs Taxonomy
QUESTIONS Levels
(4X 5 = 20 Marks)
1. Define Data Structures. Explain array with an example. 5 CO1 L1

2. Define Queue and explain the operations performed on a 5 CO1 L2

Queue with Example and write Queue Applications.
3. Demonstrate skip list representation of a dictionary. 5 CO4 L2

4. Define Dictionary? And Explain all operations with 5 CO2 L2&L3

example.

5. Define hashing? Explain different types of a hash function 5 CO4 L3

with example

6. Write a algorithm for insert operation in single linked 5 CO3 L3

list.

Assessment Summary

Evalu
Cos Remember Understand Apply Analyze Create Total
ate
1 5 5

2 10 10

3 5 5

4 5 5 10
 VAAGDEVI ENGINEERING COLLEGE SET-2
P.O.BOLLIKUNTA, WARANGAL – 506 005
B. TECH II YEAR I SEMESTER, I - MID EXAMINATIONS SEP – 2024
Department of Computer Science and Engineering(AI&ML)
Sub: Data Structures

Time: 2 Hours Max. Marks: 30

Date:19/09/24 Note: This question Paper Contains two parts. Part A & B

Assessment pattern as per Bloom’s Taxonomy:

Remember Understand Apply Analyze Evaluate Create Total
5 5 20 30
Course Outcomes for Assessment in this Test:
COs Course Outcome
1 Ability to select the data structures that efficiently model the information in a problem.
Ability to assess efficiency trade-offs among different data structure implementations or
2
combinations
3 Implement and know the application of algorithms for sorting and pattern matching
Design programs using a variety of data structures, including hash tables, binary and general tree
4
structures, search trees, tries, heaps, graphs, and AVL-trees.
PART – A (10 X 1 = 10 Marks)
Marks
CHOOSE THE CORRECT ANSWER
Which of the following is a primitive data type
1. A) stack B) array C) int D) None 1

. ...... is not the operation that can be performed on queue.

2. A) Traversal B) Insertion C) sort D) Retrieval 1
Which of the following is a non linear data structure?
3 A) Stack B) Linked lists C) Linear arrays D)none 1
If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what
order will they be removed? [ ] 1
4.
A) ABCD B) DCBA C) DCAB D) ABDC
Which function used For deallocating the memory in C []
5. A) malloc B)new C)free D)All the above 1

FILL IN THE BLANKS

6. keyword destroy a pointer in C. 1
7. Stack and Queues are data structures. 1
In general, the index of the first element in an array is
8. 1
. contains address of first node in a single linked list.
9. 1
10. Full form of an ADT is 1
 PART – B Marks Mapping Bloom’s
ANSWER ANY FOUR OF THE FOLLOWING COs Taxonomy
QUESTIONS Levels
(4X 5 = 20 Marks)
1. Implement STACK program using linked list. 5 CO1 L1

2. Write Algorithm searching of a node into a single 5 CO3 L3

linked list.
3. Write Dictionary ADT. 5 CO2 L2

4. Define Dynamic hashing? Explain Global depth , Local 5 CO4 L3

depth.

5. Explain chaining and Rehashing Techniques with 5 CO4 L3

example.

6. Explain about linked list. 5 CO3 L3

Assessment Summary

Evaluate
Cos Remember Understand Apply Analyze Create Total

1 5 5

2 5 5

3 10 10

4 10 10
 VAAGDEVI ENGINEERING COLLEGE SET-3
P.O.BOLLIKUNTA, WARANGAL – 506 005
B. TECH II YEAR I SEMESTER, I - MID EXAMINATIONS SEP – 2024
Department of Computer Science and Engineering(AI&ML)
Sub:Data Structures

Time: 2 Hours Max. Marks: 30

Date:19/09/24 Note: This question Paper Contains two parts. Part A & B

Assessment pattern as per Bloom’s Taxonomy:

Remember Understand Apply Analyze Evaluate Create Total
15 5 10 30
Course Outcomes for Assessment in this Test:
COs Course Outcome
1 Ability to select the data structures that efficiently model the information in a problem.
Ability to assess efficiency trade-offs among different data structure implementations or
2
combinations
3 Implement and know the application of algorithms for sorting and pattern matching
Design programs using a variety of data structures, including hash tables, binary and general tree
4 structures, search trees, tries, heaps, graphs, and AVL-trees.
PART – A (10 X 1 = 10 Marks)
Marks
CHOOSE THE CORRECT ANSWER
Linked list is which data type [ ]
1. A) linear B) non linear C) both D) None 1

Queue is also known as this data structure []

2. A) FIFO B) LIFO C)FILO D)None 1
Which of the following data structures are indexed structures? []
3 A) Stack B) Linked lists C) Linear arrays D None of the above
1
. ...... is not the operation that can be performed on queue. [ ]
A) Traversal B) Insertion C) sort D) Retrieval 1
4.

Which of the following are applications of linked lists? [ ]

5. A) Implementing file System B)hashing C)Binary tree implementation D)All the above 1

FILL IN THE BLANKS

6. keyword destroy a pointer in C. 1
7. Stack and Queues are data structures. 1
index of the first element in an array is
8. 1

9. . contains address of first node in a single linked list. 1

Full form of an ADT is
10. 1
 PART – B Marks Mapping Bloom’s
ANSWER ANY FOUR OF THE FOLLOWING COs Taxonomy
QUESTIONS Levels
(4X 5 = 20 Marks)
1. Implement STACK program using linked list. 5 CO1 L1

2. Explain Insertion and deletion of a node into a single 5 CO3 L3

linked list.
3. What is quadratic probing explain it with an example. 5 CO2 L2

4. What is Collision? Explain different Collision Resolution 5 CO4 L3

Techniques with example..

5. Define Following terms. A) Hash key B) Hash Table C) 5 CO4 L1

Hash Function D) Bucket

6. Define Data Structures.and Compare Array and linked 5 CO1 L1

list with all parameters.

Assessment Summary

Evalu
Cos Remember Understand Apply Analyze Create Total
ate

1 10 10

2 5 5

3 5 5
4 5 5 10