FORM NO. F/ EVAL / 004 Rev.00 Date 20.03.

2020 Page 1 of 5

CONTINUOUS ASSESSMENT TEST- I (ILM-Module I) – Open Book Test

SUB. CODE: CBCS22002 [Link]:DATA STRUCTURES
DEGREE :[Link] (CSE) AI BRANCH: CSE
YEAR/SEMESTER: II/III SECTIONS/COMMON TO: SLOT - A
[Link]: 30 DURATION: 1 Hr
DATE: 14.10.2025 PORTION: 1 Unit
[Link] Question Marks CO BL

PART A - 10x1=10 Marks - Answer All Questions (MCQ)

1 Which of the following is not a linear data structure? A) 1 1 L1

Array B) Linked List C) Stack D) Graph
2 The main purpose of a data structure is: A) To store data 1 1 L2
B) To organize and manage data efficiently C) To
perform mathematical operations D) To display data in
graphical form
3 What is an Abstract Data Type (ADT)? A) A data type 1 1 L2
defined by the user B) A type where only operations are
specified, not implementation C) A data type predefined
in C/C++ D) A class in object-oriented programming
4 Which of the following is not typically considered an 1 1 L1
ADT? A) List B) Stack C) Queue D) Integer
5 What is the time complexity of accessing an element in 1 1 L2
an array by index? A) O(n) B) O(log n) C) O(1) D) O(n
log n)
6 In a list ADT, which operation inserts a new item at the 1 1 L2
end? A) insertFirst()B) insertMiddle()C) insertLast()D)
insertAtHead()
7 What does a node in a singly linked list contain? A) Data 1 1 L2
and two pointers B) Only data C) Data and one pointer to
the next node D) Only a pointer
8 Insertion at the beginning of a singly linked list is: A) 1 1 L1
O(n) B) O(1) C) O(log n) D) O(n log n)
9 Which operation is more efficient in a singly linked list 1 1 L2
compared to an array? A) Random access B) Searching
C) Insertion at beginning D) None
10 A doubly linked list contains: A) Data and one pointer B) 1 1 L2
Data and two pointers C) Only pointers D) Three data
fields
PART B- 2x10 =20 Marks - Answer All Questions
(Descriptive)
11 Explain Abstract Data Types (ADT) with examples. 10 1 L3
Discuss the List ADT in detail, and explain how it can be
implemented using arrays and linked lists. Compare both
implementations in terms of time and space complexity.
12 Describe the structure and operations of a Doubly Linked 10 1 L3
List. Write algorithms for insertion and deletion of a
node in a doubly linked list. Explain with proper
diagrams and discuss advantages over singly linked list.
 FORM NO. F/ EVAL / 004 Rev.00 Date 20.03.2020 Page 2 of 5

CONTINUOUS ASSESSMENT TEST- I (ILM-Module I) – Open Book Test

SUB. CODE: CBCS22002 [Link]:DATA STRUCTURES
DEGREE :[Link] (CSE) AI BRANCH: CSE
YEAR/SEMESTER: II/III SECTIONS/COMMON TO: SLOT - A
[Link]: 30 DURATION: 1 Hr
DATE: 14.10.2025 PORTION: 1 Unit
[Link] Question Marks CO BL

PART A - 10x1=10 Marks - Answer All Questions (MCQ)

1 Which of the following is not a linear data structure? A) 1 1 L1

Array B) Linked List C) Stack D) Graph
2 The main purpose of a data structure is: A) To store data 1 1 L2
B) To organize and manage data efficiently C) To
perform mathematical operations D) To display data in
graphical form
3 What is an Abstract Data Type (ADT)? A) A data type 1 1 L2
defined by the user B) A type where only operations are
specified, not implementation C) A data type predefined
in C/C++ D) A class in object-oriented programming
4 Which of the following is not typically considered an 1 1 L1
ADT? A) List B) Stack C) Queue D) Integer
5 What is the time complexity of accessing an element in 1 1 L2
an array by index? A) O(n) B) O(log n) C) O(1) D) O(n
log n)
6 In a list ADT, which operation inserts a new item at the 1 1 L2
end? A) insertFirst()B) insertMiddle()C) insertLast()D)
insertAtHead()
7 What does a node in a singly linked list contain? A) Data 1 1 L2
and two pointers B) Only data C) Data and one pointer to
the next node D) Only a pointer
8 Insertion at the beginning of a singly linked list is: A) 1 1 L1
O(n) B) O(1) C) O(log n) D) O(n log n)
9 Which operation is more efficient in a singly linked list 1 1 L2
compared to an array? A) Random access B) Searching
C) Insertion at beginning D) None
10 A doubly linked list contains: A) Data and one pointer B) 1 1 L2
Data and two pointers C) Only pointers D) Three data
fields
PART B- 2x10 =20 Marks - Answer All Questions
(Descriptive)
11 Explain Abstract Data Types (ADT) with examples. 10 1 L3
Discuss the List ADT in detail, and explain how it can be
implemented using arrays and linked lists. Compare both
implementations in terms of time and space complexity.
12 Describe the structure and operations of a Doubly Linked 10 1 L3
List. Write algorithms for insertion and deletion of a
node in a doubly linked list. Explain with proper
 FORM NO. F/ EVAL / 004 Rev.00 Date 20.03.2020 Page 3 of 5

diagrams and discuss advantages over singly linked list.

Course Outcomes (CO) Blooms Taxonomy Levels (BL)

CO1 CO2 CO3 CO4 CO5 CO6 L1 L2 L3 L4 L5 L6
Marks 12 3 7 2

CO1 Understand space and time complexity of various algorithms and implement various
operations on arrays and linked list.
CO2
CO3
CO4
CO5
CO6

BL –Bloom’s Taxonomy Levels (L1- Remembering, L2-Understanding, L3 –Applying, 4- Analyzing,

L5- Evaluating, L6- Creating), CO – Course Outcomes, PI Code – Performance Indicator Code

Name of the Staff: [Link]

Dept:

Number of pages in the question paper: 3

Total number of students in the class:

Date of Submission:

Signature of the staff:

Signature of the HOD of the Staff concern:

Mobile number of staff: 9789167999

Important:
Checked the question paper as per the pattern, checked the answer key for the
split up of marks and the answer key is retained in the department.

HOD/CAT coordinator signature:

 FORM NO. F/ EVAL / 004 Rev.00 Date 20.03.2020 Page 4 of 5

Answer Key (CAT I-Open Book Test)

SUB. CODE: CBCS22002 [Link]:DATA STRUCTURES

DEGREE :[Link] (CSE) AI BRANCH: CSE
YEAR/SEMESTER: II/III SECTIONS/COMMON TO: SLOT - A
[Link]: 30 DURATION: 1 Hr
DATE: 14.10.2025 PORTION: 1 Unit

Q. No Contents of the Answer * Allocation of

Marks
1 D) Graph 1
2 B) To organize and manage data efficiently 1
3 B) A type where only operations are specified, not implementation 1
4 D) Integer 1
5 C) O(1) 1
6 C) insertLast() 1
7 C) Data and one pointer to the next node 1
8 B) O(1) 1
9 C) Insertion at beginning 1
10 B) Data and two pointers 1
11 Definition of ADT (conceptual, not tied to implementation). 10
Example ADTs: Stack, Queue, List, etc.
Detailed explanation of List ADT:
Operations: insertion, deletion, traversal, search, etc.
Array implementation of List:
Fixed size, random access, insertion/deletion expensive (O(n)).
Linked list implementation:
Dynamic size, sequential access, efficient insertion/deletion.
Comparison table (optional but recommended):
Time complexity (insert, delete, access)
Space usage
pros and cons of each approach.
12 Definition and structure: 10
Each node contains: data, prev pointer, next pointer.
Diagram of doubly linked list (3 nodes ideal).
Algorithms:
Insertion at beginning, end, and specific position.
Deletion of a given node.
Sample pseudo-code or simple code snippets.
Advantages over singly linked list:
Bidirectional traversal.
Easier deletion when given a pointer to a node.
Time complexity: O(1) for insertion/deletion if pointer is given.
Use cases in real-world applications.

Prepared by [Link] Reviewed and Approved by

Subject In charge HoD

 FORM NO. F/ EVAL / 004 Rev.00 Date 20.03.2020 Page 5 of 5

*Key words / Formula / Diagram / Definitions etc., - as appropriate