Module 1

Question 1

What is an Abstract Data Type (ADT)?

Answer 1

An ADT is a model for data characterized by a known set of behaviors (operations or methods). It defines what operations are to be performed

Question 2

Why is an Abstract Data Type called ‘abstract’?

Answer 2

Because it provides an implementation-independent view of data

Question 3

What does an ADT specify and not specify?

Answer 3

It specifies what operations can be performed

Question 4

Give an example showing that an ADT can have multiple implementations.

Answer 4

The List ADT can be implemented using arrays

Question 5

What is the process of providing only essentials and hiding details called?

Answer 5

Abstraction.

Question 6

List the main characteristics of an Abstract Data Type (ADT).

Answer 6

1. Facility to create a container to hold data; 2. Facility to add a new element; 3. Facility to remove an element that meets a criterion; 4. Facility to find an element that meets a criterion; 5. Facility to destroy the container when no longer needed.

Question 7

What does ‘implementation-independent’ mean in the context of ADTs?

Answer 7

It means that the ADT describes operations and behavior without depending on any specific way of implementing or storing the data.

Question 8

How does abstraction help in programming with ADTs?

Answer 8

It simplifies development by focusing on what operations an ADT performs rather than how it performs them

Question 9

Stack

Answer 9

A linear data structure where elements are arranged in order and all operations occur at one end called the top; follows the LIFO (Last In

Question 10

Stack Operations

Answer 10

Push (insert)

Question 11

Stack Underflow

Answer 11

Occurs when attempting to pop an element from an empty stack.

Question 12

Stack Overflow

Answer 12

Occurs when attempting to push an element onto a full stack.

Question 13

Real-life Example of Stack

Answer 13

A pile of plates — the last plate added is the first to be removed (LIFO).

Question 14

Time Complexity of Stack Operations

Answer 14

All primary stack operations (push

Question 15

Applications of Stack

Answer 15

Undo/Redo operations

Question 16

Queue

Answer 16

A linear data structure where insertion happens at the rear and deletion happens at the front; follows the FIFO (First In

Question 17

Queue Operations

Answer 17

Enqueue (insert)

Question 18

Difference Between Stack and Queue

Answer 18

Stack is LIFO (last in

Question 19

Time Complexity of Queue Operations

Answer 19

All basic queue operations (enqueue

Question 20

Real-life Examples of Queue

Answer 20

People standing in a line

Question 21

Linked List

Answer 21

A linear data structure consisting of nodes connected by pointers; each node contains data and a pointer to the next node.

Question 22

Linked List Operations

Answer 22

Get (retrieve)

Question 23

Difference Between Linked List and Array

Answer 23

Arrays use contiguous memory and allow random access; linked lists use pointers

Question 24

Advantages of Linked List

Answer 24

Dynamic size and easy insertion/deletion of nodes.

Question 25

Disadvantages of Linked List

Answer 25

No random access

Question 26

Singly Linked List

Answer 26

A list where each node has data and a pointer to the next node only.

Question 27

Linked List Representation

Answer 27

Each node has two parts: data (stores element) and next (stores address of next node); the list starts with a pointer called head.

Question 28

Searching

Answer 28

The process of finding the location of a specific element in a collection of data.

Question 29

Linear Search

Answer 29

A simple search algorithm that checks each element of the list sequentially until the desired element is found or the list ends.

Question 30

How Linear Search Works

Answer 30

Starts from the first element and compares each one with the target until a match is found or the list is fully traversed.

Question 31

Time Complexity of Linear Search

Answer 31

O(n) — where n is the number of elements in the list.

Question 32

Limitation of Linear Search

Answer 32

It is inefficient for large data sets because it checks every element.

Question 33

Binary Search

Answer 33

A search algorithm that works on sorted lists by repeatedly dividing the search interval in half.

Question 34

How Binary Search Works

Answer 34

Compare the target element with the middle element; if it matches

Question 35

Condition for Binary Search

Answer 35

The list must be sorted in ascending or descending order before performing the search.

Question 36

Time Complexity of Binary Search

Answer 36

O(log n) — where n is the number of elements.

Question 37

Advantage of Binary Search

Answer 37

Much faster than linear search for large

Question 38

Disadvantage of Binary Search

Answer 38

Requires the data to be sorted before searching.

Question 39

Sorting

Answer 39

The process of arranging data elements in a specific order

Question 40

Selection Sort

Answer 40

A simple comparison-based algorithm that repeatedly selects the smallest (or largest) element and swaps it into its correct position.

Question 41

How Selection Sort Works

Answer 41

Find the smallest element and place it at the beginning; repeat for the remaining unsorted portion until the list is sorted.

Question 42

Time Complexity of Selection Sort

Answer 42

O(n²) — for both best and worst cases.

Question 43

Space Complexity of Selection Sort

Answer 43

O(1) — sorts in place using no extra space.

Question 44

Advantage of Selection Sort

Answer 44

Simple to understand and implement.

Question 45

Disadvantage of Selection Sort

Answer 45

Inefficient for large lists due to its O(n²) time complexity.

Question 46

Bubble Sort

Answer 46

A simple sorting algorithm that repeatedly steps through the list

Question 47

How Bubble Sort Works

Answer 47

On each pass

Question 48

Flag in Bubble Sort

Answer 48

A Boolean variable used to track if any swaps occurred during a pass; if no swaps occur

Question 49

Time Complexity of Bubble Sort

Answer 49

Worst and average case: O(n²); Best case (already sorted): O(n).

Question 50

Advantage of Bubble Sort

Answer 50

Easy to implement and understand.

Question 51

Disadvantage of Bubble Sort

Answer 51

Very inefficient for large lists.

Question 52

Stability of Bubble Sort

Answer 52

It is a stable sort — equal elements retain their relative order.