DAY 25 Array & Linked List in Data Structure (12th July 24)

Which of the following is the correct way to declare an array

in C++?

• int array[10];

• array int[10];

• int[10] array;

• array[10] int;

What is the time complexity to access an element in an

array using an index?

• O(1)

• O(n)

• O(log n)

• O(n log n)

How can you initialize an array of integers with 5 elements

to zero in C++?

• int array[5] = {0};

• int array[5] = 0;

• int array = {0, 0, 0, 0, 0};

• int array[5] = {0, 0};

Which of the following correctly describes the way arrays

are stored in memory?

• Randomly

• Contiguously

• Non-contiguously

• None of the above

Given an array int arr[5] = {1, 2, 3, 4, 5};, what will be the

value of arr[2]?

• 1

• 2

• 3

• 4

What is the main advantage of a linked list over an array?

• Fixed size

• Easier access to elements using an index

• Dynamic size

• Faster access to elements

Which of the following is not a type of linked list?

• Singly linked list

• Doubly linked list

• Circular linked list

• Triply linked list

What does each node in a singly linked list contain?

• Data only

• Data and a reference to the next node

• Data and references to both the next and previous nodes

• Data and a reference to the previous node

What is the time complexity to insert an element at the

beginning of a singly linked list?

• O(1)

• O(n)

• O(log n)

• O(n log n)

In a circular linked list, the last node points to:

• The first node

• The middle node

• A null value

• The previous node