pROG

Question 1

What does a pointer store?

Answer 1

Address of a variable

Question 2

Which operator is used to access the value stored at the memory address held by a pointer?

Answer 2

*

Question 3

What is the correct way to declare a pointer to an integer?

Answer 3

int pointer;

Question 4

Which keyword is used to free dynamically allocated memory?

Answer 4

delete

Question 5

Which of the following is a correct way to declare an array of 10 integers?

Answer 5

int arr[10];

Question 6

Are dynamic data structures that provide flexibility and efficient operations compared to static arrays

Answer 6

Linked List

Question 7

Check if the stack is empty.

Answer 7

IsEmpty

Question 8

A pointer can point to any data type.

Answer 8

True

Question 9

An array in C++ can store different types of data in the same array.

Answer 9

FALSE

Question 10

When dynamically allocating an array, you must free the memory using delete[].

Answer 10

True

Question 11

Is used to retrieve the address of a variable.

Answer 11

The address-of operator (&)

Question 12

Which of the following is the correct way to define a structure?

Answer 12

struct myStruct{ int x; float y; };

Question 13

Points to the next node in the list

Answer 13

Next Pointer

Question 14

Visiting each node in the linked list, usually to read or process the data stored in each node.

Answer 14

Traversal

Question 15

Remove the element from the front of the queue.

Answer 15

Dequeue

Question 16

Finding a node in the linked list that contains a specific value.

Answer 16

Search

Question 17

Enhance traversal capabilities, allowing for easy movement in both directions.

Answer 17

Doubly Linked List

Question 18

The value held by the node.

Answer 18

Data

Question 19

Adding a new node to the linked list. This can be done at various positions:

Answer 19

Insertion

Question 20

Add an element to the top of the stack.

Answer 20

Push

Question 21

Points to the previous node in the list.

Answer 21

Previous Pointer

Question 22

Return the front element without removing it.

Answer 22

Peek

Question 23

A pointer/reference to the first node in the list.

Answer 23

Head

Question 24

Return the top element without removing it.

Answer 24

Peek

Question 25

Linked lists can grow or shrink as needed, unlike arrays which have a fixed size.

Answer 25

Dynamic Size

Question 26

Add an element to the end of the queue.

Answer 26

Enqueue

Question 27

Remove the element from the top of the stack.

Answer 27

Pop

Question 28

The basic unit of a linked list that contains data and a pointer to the next node.

Answer 28

Node

Question 29

A pointer/reference to the last node in the list (optional).

Answer 29

Tail

Question 30

Removing a node from the linked list. This can involve:

Answer 30

Deletion

Question 31

Basic Operations on Data Structures ARAU

Answer 31

Adding Data: (Create | Insert).
Removing Data:(Delete).
Accessing Data:(Search | Read).
Updating Data: (Update).

Question 32

Like a row of boxes where each box has a number.
-A simple list where each item is stored in a specific order

Answer 32

ARRAYS

Question 33

Like a chain of linked rings, where each ring points to the next one.
- A list where each item points to the next one in line.

Answer 33

LINKED LISTS

Question 34

Like a stack of plates where you add and remove from the top.
-A collection where the last item added is the first one to be removed (Last In, First Out - LIFO).

Answer 34

STACKS

Question 35

Like a line at a checkout where the first person in line is the first one served.
-A collection where the first item added is the first one to be removed (First In, First Out - FIFO).

Answer 35

QUEUES

Question 36

Like an upside-down family tree showing relationships between items.
-A structure that resembles an upside-down tree, with a root and branches showing how items are related.

Answer 36

TREES

Question 37

Like a map showing various points (cities) and connections (roads) between them.
- A network of points connected by lines, showing how items are linked.

Answer 37

GRAPHS

Question 38

Like a collection of unique items, no duplicates allowed.
-A collection of unique items with no duplicates.

Answer 38

SETS

Question 39

Like a real-world dictionary where you look up words (keys) to find their definitions (values).
-A collection of key-value pairs where each key is unique and maps to a specific value.

Answer 39

MAPS

Question 40

is a variable that stores the memory address of another variable. Hold the location where data is stored in memory.
-Variables that store memory addresses, allowing for efficient data manipulation and memory management.

Answer 40

POINTER

Question 41

allows programs to request memory at runtime, rather than at compile time. This is useful when the amount of memory needed isn’t known beforehand.

Answer 41

DYNAMIC MEMORY ALLOCATION

Question 42

Techniques (new and delete) to allocate and
deallocate memory at runtime, providing flexibility in handling data structures whose size isn’t known at compile time.

Answer 42

DYNAMIC MEMORY ALLOCATION

Question 43

Collection of elements of the same type stored in contiguous memory locations. Arrays allow you to manage multiple variables using a single name.

Answer 43

ARRAY

Question 44

User-defined data types that group different types of variables,
allowing for the representation of complex data entities.

Answer 44

STRUCTURE

Question 45

data structure that consists of a sequence of elements, where each element points to the next element in the sequence. Unlike arrays, linked lists do not require contiguous memory locations, allowing for efficient memory usage and dynamic sizing.

Answer 45

LINKED LIST

Question 46

Are dynamic data structures that provide flexibility and efficient operations compared to static arrays.

Answer 46

LINKED LIST

Question 47

The basic unit of a linked list that contains data and a pointer to the next node.

Answer 47

NODE

Question 48

A pointer/reference to the first node in the list.

Answer 48

HEAD

Question 49

A pointer/reference to the last node in the list (optional).

Answer 49

TAIL

Question 50

Adding a new node to the linked list.

Answer 50

INSERTION

Question 51

The new node becomes the head of the list.

Answer 51

At the beginning

Question 52

The new node is added after the last node.

Answer 52

At the end

Question 53

The new node is inserted between two existing nodes.

Answer 53

At a specific position

Question 54

Removing a node from the linked list.

Answer 54

DELETION

Question 55

The head of the list is removed, and the next node
becomes the new head.

Answer 55

Deleting the first node

Question 56

The last node is removed, and the second-to-last
node’s next pointer is set to null.

Answer 56

Deleting the last node:

Question 57

A node is removed based on its value or position,
updating the pointers of adjacent nodes accordingly.

Answer 57

Deleting a specific node

Question 58

Visiting each node in the linked list, usually to read or process the data stored in each node. This is typically done starting from the head and moving through each node using the next pointers until the end of the list is reached.

Answer 58

TRAVERSAL

Question 59

Finding a node in the linked list that contains a specific value. This
operation involves traversing the list and checking each node’s value until the desired value is found or the end of the list is reached.

Answer 59

SEARCH

Question 60

Add an element to the top of the stack.

Answer 60

PUSH

Question 61

Remove the element from the top of the stack.

Answer 61

POP

Question 62

Return the top element without removing it.

Answer 62

PEEK

Question 63

Check if the stack is empty.

Answer 63

IsEmpty

Question 64

Each node contains data and a pointer to the next node.

Answer 64

NODE STRUCTURE

Question 65

Contains a private pointer top and methods for stack operations.

Answer 65

STACK CLASS

Question 66

Allow you to view the top element and check if the stack is empty.

Answer 66

Peek and isEmpty

Question 67

Add an element to the end of the queue.

Answer 67

ENQUEUE

Question 68

Remove the element from the front of the queue.

Answer 68

Dequeue

Question 69

Return the front element without removing it.

Answer 69

PEEK

Question 70

Contains two pointers (front and rear) to facilitate efficient insertion and deletion.

Answer 70

Queue Class

Question 71

process of determining the computational resources required byCan algorithm, focusing primarily on its time complexity and space complexity.

Answer 71

Algorithm Analysis

Question 72

is crucial for evaluating algorithm efficiency, helping choose the best solution for a problem.

Answer 72

Algorithm Analysis

Question 73

measures the amount of time an algorithm takes to complete as a function of the length of the input.
-Understanding time complexity allows us to predict the performance of an algorithm.

Answer 73

TIME COMPLEXITY

Question 74

measures the total amount of memory space required
by the algorithm, including both the input and auxiliary space.
- space complexity helps developers understand the resource requirements of an algorithm, which is essential in environments with limited memory.

Answer 74

SPACE COMPLEXITY

Question 75

describes the upper bound of an algorithm’s time or space complexity. It provides a high-level understanding of the efficiency of an algorithm without getting bogged down in implementation details.

Answer 75

Big O notation

Question 76

The algorithm takes the same amount of time regardless of input size.

Answer 76

O(1): Constant time

Question 77

The algorithm’s run time increases linearly with the input size.

Answer 77

O(n): Linear time

Question 78

The run time grows proportionally to the square of the input size.

Answer 78

O(n^2): Quadratic time

Question 79

The algorithm reduces the problem size in each step.

Answer 79

O(log n): Logarithmic time

Question 80

To analyze an algorithm: IDU

Answer 80

1. Identify the input size.
2. Determine the operations performed by the algorithm.
3. Use Big O notation to express the time and space complexities.

Question 81

Each node points to the next node.

Answer 81

Singly Linked List

Question 82

Each node points to both the next and previous nodes.

Answer 82

Doubly Linked List

Question 83

The last node points back to the first node.

Answer 83

Circular Linked List

Question 84

Advantages

Answer 84

● Dynamic Size: Linked lists can grow or shrink as needed, unlike arrays which have a fixed size.
● Efficient Insertions/Deletions: Adding or removing elements is easier and more efficient, especially at the beginning or middle of the list.

Question 85

Disadvantages

Answer 85

● No Random Access: Unlike arrays, linked lists do not allow direct access to
elements; they must be accessed sequentially.
● Extra Memory Overhead: Each node requires additional memory for storing pointers.

Question 86

enhance traversal capabilities, allowing for easy movement in both directions.

Answer 86

Doubly linked lists

Question 87

The value held by the node.

Answer 87

DATA

Question 88

Points to the next node in the list.

Answer 88

Next Pointer

Question 89

Points to the previous node in the list.

Answer 89

Previous Pointer