What are the two essential cases in any recursive algorithm?

• Base case and Iterative case

• Base case and Recursive case

• Recursive case and Termination case

• Loop case and Exit case

In recursion, the base case is:

• A simple occurrence that can be solved directly

• A complex problem that needs further recursion

• A case that terminates the computer

• A repeated loop that never stops

What is an array?

• A collection of nodes pointing to each other

• A data structure that stores elements of the same type in a fixed size

• A database for storing numbers

• A dynamic list of elements

In Java, array indices start from:

• 1

• 0

• -1

• Any number

What is the time complexity of accessing an element in an array using its index?

• O(1)

• O(n)

• O(log n)

• O(n²)

A two-dimensional array can be visualized as:

• A stack

• A linked list

• A table with rows and columns

• A single-row list

What is NOT a basic operation of an array?

• Traversing

• Inserting

• Searching

• Merging two arrays into a single node

What is a major limitation of arrays?

• Dynamic size

• Fixed size

• No storage requirement

• Can only store strings

How is a linked list different from an array?

• It uses pointers to link elements dynamically

• It stores elements in a contiguous memory location

• It does not allow deletion of elements

• It has a fixed size

A node in a singly linked list contains:

• Only data

• Data and a reference to the next node

• Data and two references (next and previous)

• Only a reference to another node