Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Tests > Test: Recursion- 2 - Computer Science Engineering (CSE) MCQ

Test Description

Test: Recursion- 2 for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Test: Recursion- 2 questions and answers have been prepared
according to the Computer Science Engineering (CSE) exam syllabus.The Test: Recursion- 2 MCQs are made for Computer Science Engineering (CSE) 2024 Exam.
Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Recursion- 2 below.

Solutions of Test: Recursion- 2 questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Recursion- 2 solutions in
Hindi for Computer Science Engineering (CSE) course.
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Recursion- 2 | 20 questions in 60 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study for Computer Science Engineering (CSE) Exam | Download free PDF with solutions

Detailed Solution for Test: Recursion- 2 - Question 1

Test: Recursion- 2 - Question 2

Consider the following recursive function fun(x, y). What is the value of fun(4, 3)

Detailed Solution for Test: Recursion- 2 - Question 2

1 Crore+ students have signed up on EduRev. Have you? Download the App |

Detailed Solution for Test: Recursion- 2 - Question 3

Detailed Solution for Test: Recursion- 2 - Question 4

Detailed Solution for Test: Recursion- 2 - Question 5

Test: Recursion- 2 - Question 9

Consider the following recursive C function that takes two arguments

unsigned int foo(unsigned int n, unsigned int r){

if(n >0) return (n%r + foo (n/r, r));

else return 0;

}

Q.

What is the return value of the function foo when it is called as foo(345, 10) ?

Detailed Solution for Test: Recursion- 2 - Question 9

Test: Recursion- 2 - Question 10

Consider the same recursive C function that takes two arguments

**Q. What is the return value of the function foo when it is called as foo(513, 2)?**

Detailed Solution for Test: Recursion- 2 - Question 10

Detailed Solution for Test: Recursion- 2 - Question 11

Detailed Solution for Test: Recursion- 2 - Question 12

Test: Recursion- 2 - Question 13

Consider the following code snippet:

What will happen when the above snippet is executed?

Detailed Solution for Test: Recursion- 2 - Question 13

Test: Recursion- 2 - Question 14

Consider the C function given below.

**Q. Which one of the following is TRUE?**

Detailed Solution for Test: Recursion- 2 - Question 14

Test: Recursion- 2 - Question 16

Consider the following C function:

The value returned by f(1) is

Test: Recursion- 2 - Question 17

Consider the following C function.

**Q. The return value of fun(5) is __________.**

Detailed Solution for Test: Recursion- 2 - Question 17

Test: Recursion- 2 - Question 18

Consider the following recursive C function. If get(6) function is being called in main() then how many times will the get() function be invoked before returning to the main()?

Detailed Solution for Test: Recursion- 2 - Question 18

Detailed Solution for Test: Recursion- 2 - Question 19

Test: Recursion- 2 - Question 20

The function f is defined as follows:

Assuming that arbitrarily large integers can be passed as a parameter to the function, consider the following statements.

1. The function f terminates for finitely many different values of n ≥ 1.

ii. The function f terminates for infinitely many different values of n ≥ 1.

iii. The function f does not terminate for finitely many different values of n ≥ 1.

iv. The function f does not terminate for infinitely many different values of n ≥ 1.

Which one of the following options is true of the above?

Detailed Solution for Test: Recursion- 2 - Question 20

Information about Test: Recursion- 2 Page

In this test you can find the Exam questions for Test: Recursion- 2 solved & explained in the simplest way possible.
Besides giving Questions and answers for Test: Recursion- 2, EduRev gives you an ample number of Online tests for practice

Download as PDF