DS All Assignments
DS All Assignments
Bloom’s
Q. No. Question CO Marks
Level
Define the following terms with examples:
1 a)Data b) Data types c) Data structure CO1 Remember 2
d) Linear and non-linear data structure
Bloom’s
Q. No. Question CO Marks
Level
Define the following terms:
1 CO2 Remember 2
a) Linear Search b) Binary Search c) Hashing
5 The employee IDs are: 25, 40, 15, 35, 50, 20. CO2 Analyze 4
a) Insert these IDs into the hash table and resolve any
collisions using linear probing.
b) Analyze the advantages and limitations of using linear
probing in this context.
M.G.M’s College of Engineering, Nanded
Department of Computer Science & Engineering
Academic Year 2024-25 (ODD Semester)
Assignment-III
Class: SY(CSE) Sub: Data Structures
Bloom’s
Q. No. Question CO Marks
Level
What is stack overflow and stack underflow? How these
1 CO3 Remember 2
conditions are detected in stack?
Bloom’s
Q. No. Question CO Marks
Level
Define the following data structures and provide one
1 example problem that can be efficiently solved using each: CO4 Remember 2
a) Linked List b) Tree
Bloom’s
Q. No. Question CO Marks
Level
List the basic operations and their corresponding time
1 complexities for the following data structures: CO5 Remember 2
a) Stack b) Queue