Recursion Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Recursion ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Recursion comprehensively.

1.
For implementing recursive function the data structure used is:

A. Stack

B. Queue

C. Linked List

D. Tree

Answer Discus (0)

2.
Recursion is memory-intensive because:

A. Recursive functions tend to declare many local variables

B. Previous function calls are still open when the function calls itself and the activation records of these previous calls still occupy space on the call stack

C. Many copies of the function code are created

D. It requires large data values

Answer Discus (0)

3.
Which of the following statements is true ?

A. Recursion is always better than iteration

B. Recursion uses more memory compared to iteration

C. Recursion uses less memory compared to iteration

D. Iteration is always better and simpler than recursion

Answer Discus (0)

4.
A function, which invokes itself repeatedly until some condition is satisfied, is called a_________.

A. Recursive function

B. Big Theta θ(f)

C. Big Omega Ω(f)

D. None of the above

Answer Discus (0)

5.
A procedure that calls itself is called

A. Illegal call

B. Reverse polish

C. Recursive

D. None of the above

Answer Discus (0)

6.
A recursive agorithm must have

A. 1 part

B. 2 parts

C. 3 parts

D. 4 parts

Answer Discus (0)

7.
A recursive function is often less efficient compared to an iterative function. But it is more________.

A. Elegant

B. Complex

C. Simple

D. None of the above

Answer Discus (0)

8.
A subroutine can be coded so that it may call itself recursively, at___________, in order to perform its task.

A. One or more places

B. Two or more places

C. More places

D. None of the above

Answer Discus (0)

9.
An algorithm that calls itself directly or indirectly is known as

A. Sub algorithm

B. Recursion

C. Polish notation

D. Traversal algorithm

Answer Discus (0)

10.
An iterative function is preferred when its recursive equivalent is__________.

A. Complex

B. Simple

C. Efficient

D. None of the above

Answer Discus (0)

11.
Consider the array {1,1,1,1,1}:Which of the following techniques can be used to search an element in the above array?

A. Iterative linear search

B. Recursive linear search

C. Recursive binary search

D. All of the mentioned

Answer Discus (0)

12.
Consider the following code snippet to find the largest element in a linked list:Which of the following lines should be inserted to complete the below code?

A. Temp->next != 0

B. Temp != 0

C. Head->next != 0

D. Head != 0

Answer Discus (0)

13.
Consider the following code snippet to find the smallest element in a linked list:Which of the following lines should be inserted to complete the below code?

A. Temp > min_num

B. Val > min_min

C. Temp->val < min_num

D. Temp->val > min_num

Answer Discus (0)

14.
Consider the following code snippet to find the smallest element in an array:Which of the following lines should be inserted to complete the below code?

A. Arr[i] > min_element

B. Arr[i] < min_element

C. Arr[i] == min_element

D. None of the mentioned

Answer Discus (0)

15.
Consider the following code snippet to search an element in a linked list:Which of the following lines should be inserted to complete the below code?

A. Temp = next

B. Temp->next = temp

C. Temp = temp->next

D. Return 0

Answer Discus (0)

1 2 3 … 12 Next »

General Subjects

Business

Recursion Mcqs

Computer MCQS

Sciences MCQS

1. For implementing recursive function the data structure used is:

Answer & Solution

2. Recursion is memory-intensive because:

Answer & Solution

3. Which of the following statements is true ?

Answer & Solution

4. A function, which invokes itself repeatedly until some condition is satisfied, is called a_________.

Answer & Solution

5. A procedure that calls itself is called

Answer & Solution

6. A recursive agorithm must have

Answer & Solution

7. A recursive function is often less efficient compared to an iterative function. But it is more________.

Answer & Solution

8. A subroutine can be coded so that it may call itself recursively, at___________, in order to perform its task.

Answer & Solution

9. An algorithm that calls itself directly or indirectly is known as

Answer & Solution

10. An iterative function is preferred when its recursive equivalent is__________.

Answer & Solution

11. Consider the array {1,1,1,1,1}:Which of the following techniques can be used to search an element in the above array?

Answer & Solution

12. Consider the following code snippet to find the largest element in a linked list:Which of the following lines should be inserted to complete the below code?

Answer & Solution

13. Consider the following code snippet to find the smallest element in a linked list:Which of the following lines should be inserted to complete the below code?

Answer & Solution

14. Consider the following code snippet to find the smallest element in an array:Which of the following lines should be inserted to complete the below code?

Answer & Solution

15. Consider the following code snippet to search an element in a linked list:Which of the following lines should be inserted to complete the below code?

Answer & Solution

Engineering MCQS

General Subjects MCQS

1.
For implementing recursive function the data structure used is:

2.
Recursion is memory-intensive because:

3.
Which of the following statements is true ?

4.
A function, which invokes itself repeatedly until some condition is satisfied, is called a_________.

5.
A procedure that calls itself is called

6.
A recursive agorithm must have

7.
A recursive function is often less efficient compared to an iterative function. But it is more________.

8.
A subroutine can be coded so that it may call itself recursively, at___________, in order to perform its task.

9.
An algorithm that calls itself directly or indirectly is known as

10.
An iterative function is preferred when its recursive equivalent is__________.

11.
Consider the array {1,1,1,1,1}:Which of the following techniques can be used to search an element in the above array?

12.
Consider the following code snippet to find the largest element in a linked list:Which of the following lines should be inserted to complete the below code?

13.
Consider the following code snippet to find the smallest element in a linked list:Which of the following lines should be inserted to complete the below code?

14.
Consider the following code snippet to find the smallest element in an array:Which of the following lines should be inserted to complete the below code?

15.
Consider the following code snippet to search an element in a linked list:Which of the following lines should be inserted to complete the below code?