Computer Science Recursion Quiz

What is recursion in computer science?

• A) A method of simplifying a complex problem by breaking it into sub-problems

• B) A powerful concept that involves a function calling itself until a specific condition is met

• C) A data structure used to store elements in a contiguous memory location

• D) A type of algorithm that prevents infinite loops in programming

Which data structure is most commonly used for recursion to keep track of function calls?

• A) Queue

• B) Array

• C) Stack

• D) Map

What principle do stacks operate on?

• A) "First In, First Out" (FIFO)

• B) "Last In, First Out" (LIFO)

• C) "First Come, First Served" (FCFS)

• D) "First In, Last Out" (FILO)

What makes linked lists suitable for dynamic insertion and deletion of elements?

• A) They store elements in a contiguous memory location

• B) Each node contains a value and a pointer to the previous node

• C) They follow the "First In, First Out" (FIFO) principle

• D) Each node contains a value and a pointer to the next node

Queues follow which principle?

• A) "First In, Last Out" (FILO)

• B) "Last In, First Out" (LIFO)

• C) "First In, First Out" (FIFO)

• D) "Last Come, First Served" (LCFS)

What is the base condition in the recursive summation function provided in the learning material?

• if n == 1

• if n < 1

• if n == 0

• if n > 0

What does the recursive factorial function return when the base condition is met?

• 0

• n

• 1

• n - 1

In the 'other_sum' recursive function, what is added to the result each time the function calls itself?

• 3

• 2

• 5

• n

What is the base condition in the 'other_sum' recursive function?

• if n == 0

• if n < 1

• if n == 1

• if n > 1

What is the initial value of sum in the `other_sum_iterative` function before the loop starts?

• 0

• 2

• 3

• 5