Question 1

What is recursion in programming?

Accepted Answer

A function calling itself.

Answer

A function calling multiple functions.

Answer

A function calling another function.

Answer

A function calling a built-in function.

Question 2

What is the base case in recursion?

Accepted Answer

The condition that terminates the recursion.

Answer

The step after the recursion.

Answer

The first step of the recursion.

Answer

The final step of the recursion.

Question 3

What is the output of a recursive function after the recursion has terminated?

Accepted Answer

The final result or value returned by the function.

Answer

The sum of all the values returned by the function in each recursive call.

Answer

The initial input passed to the function.

Answer

The number of times the function has been called.

Question 4

Which of the following is an example of recursive function?

Accepted Answer

Calculating the factorial of a number.

Answer

Sorting an array using a loop.

Answer

Finding the maximum value in an array.

Answer

Searching for an element in an array.

Question 5

What is a recursive data structure?

Accepted Answer

A data structure that can contain an instance of itself as a part of its own definition.

Answer

A data structure that requires external libraries to implement.

Answer

A data structure that can be traversed using loops.

Answer

A data structure that can only store primitive data types.

Question 6

What is a stack in computer science?

Accepted Answer

A data structure that follows the Last In, First Out (LIFO) principle.

Answer

A data structure that follows the First In, First Out (FIFO) principle.

Answer

A data structure that sorts its elements in ascending order.

Answer

A data structure that allows random access to its elements.

Question 7

Which operation is used to remove an element from the front of a queue?

Accepted Answer

Dequeue

Answer

Enqueue

Answer

Push

Question 8

What happens when a stack is empty and we try to perform a Pop operation?

Accepted Answer

Underflow error occurs.

Answer

The top element is removed.

Answer

The stack is resized.

Answer

Overflow error occurs.

Question 9

Which data structure uses the Last In, First Out (LIFO) principle?

Accepted Answer

Stack.

Answer

Tree.

Answer

Heap.

Answer

Queue.

Question 10

Which of the following operations can be performed on a stack?

Accepted Answer

Push, Pop, isEmpty, isFull

Answer

Insert and Delete.

Answer

Search and Sort.

Answer

Enqueue and Dequeue.

Question 11

Which operation is used to add an element to the top of a stack?

Accepted Answer

Push.

Answer

Insert.

Answer

Remove.

Answer

Pop.

Question 12

What is the main characteristic of a queue data structure?

Accepted Answer

First-In-First-Out (FIFO)

Answer

Last-In-First-Out (LIFO)

Answer

Random access

Answer

Largest-In-First-Out (LIFO)

Question 13

When using a queue data structure, which operation adds an element to the rear?

Accepted Answer

Enqueue

Answer

Dequeue

Answer

Remove

Question 14

State the output of the following recursive function when the function is called

Output power(3)

Accepted Answer

8

Answer

6

Answer

0

Answer

9

Related quizzes

Related quizzes