Which of these data types is used by operating system to manage the recursion?

JAVA - CLASSES AND METHODS MCQs • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • •

CS141 – CS240 – IT245 (2022) Q29: What is recursion in Java? A. Recursion is process of defining a method that calls itself repeatedly B. Recursion is a class C. Recursion is process of defining a method that completes its tasks immediately D. Recursion is process of defining a method that calls other method Q30: Which of these data types is used by the operating system to manage recursion in Java? A. Array B. Stack C. Tree D. Queue Q31: Priority queues always maintain the FIFO (First-in-first-out) discipline. A. True B. False Q32: The two popular implementations of the list abstract data types: A. The Array and LinkedList B. The ArrayList and Tree C. The LinkedList and Tree D. The ArrayList and LinkedList Q33: Stacks and queues can be implemented by arrays or linked lists. A. True B. False CS141 – CS240 – IT245 (2022) Q34: A_______ is a list that has three parts in a single node, includes one data part, a pointer to its previous node, and a pointer to the next node. A. Doubly linked list B. Simple Linked list C. Singly linked list D. Triply linked list Q35: In a single linked list, the address part in a node is also known as a______. A. head B. stick C. tail D. pointer Q36: Which of the following represents data structures that store homogeneous data elements? A. Arrays B. Linked lists C. Pointers D. Records Q37: Suppose p is a reference to a node in a doubly-linked list. Which of the following boolean expressions will be true when p currently refers to the last node of t...

Computers and Operating Systems The first Computers acquired more powerful operating systems in the 1960s with the emergence of time-sharing, which required a system to manage multiple users sharing CPU time and terminals. Two early time-sharing systems were CTSS (Compatible Time Sharing System), developed at the The In addition to such general-purpose systems, special-purpose operating systems run on small computers that control assembly lines, aircraft, and even home appliances. They are real-time systems, designed to provide rapid response to

• There is a bucket that holds balls. • Different types of balls are entered into the bucket. • The ball to enter the bucket last will be taken out first. • The ball entering the bucket next to last will be taken out after the ball above it (the newer one). • In this way, the ball entering the bucket first will leave the bucket last. • Therefore, the Last ball (Blue) to enter the bucket gets removed first and the First ball (Red) to enter the bucket gets removed last. This is known as Last-In-First-Out approach or LIFO. Where is LIFO used: • Data Structures: Certain data structures like Stacks and other variants of Stacks use LIFO approach for processing data. • Extracting latest information: Sometimes computers use LIFO when data is extracted from an array or data buffer. When it is required to get the most recent information entered, the LIFO approach is used. Program Examples for LIFO: Implementation: Using Stack data structure.

• • C++ Introduction • C++ Variables and Literals • C++ Data Types • C++ Basic I/O • C++ Type Conversion • C++ Operators • C++ Comments • C++ Flow Control • C++ if...else • C++ for Loop • C++ do...while Loop • C++ break • C++ continue • C++ switch Statement • C++ goto Statement • C++ Functions • C++ Functions • C++ Function Types • C++ Function Overloading • C++ Default Argument • C++ Storage Class • C++ Recursion • C++ Return Reference • C++ Arrays & String • C++ Arrays • Multidimensional Arrays • C++ Function and Array • C++ String • C++ Structures • C++ Structures • Structure and Function • C++ Pointers to Structure • C++ Enumeration • C++ Object & Class • C++ Objects and Class • C++ Constructors • C++ Objects & Function • C++ Operator Overloading • C++ Pointers • C++ Pointers • C++ Pointers and Arrays • C++ Pointers and Functions • C++ Memory Management • C++ Inheritance • C++ Inheritance • Inheritance Access Control • C++ Function Overriding • Inheritance Types • C++ Friend Function • C++ Virtual Function • C++ Templates C++ allows us to allocate the memory of a variable or an array in run time. This is known as dynamic memory allocation. In other programming languages such as Java and Python, the compiler automatically manages the memories allocated to variables. But this is not the case in C++. In C++, we need to deallocate the dynamically allocated memory manually after we have no use for the variable. We can allocate and then deallocate memory dynamically using th...

2. Which of these data types is used by operating system to manage the Recursion in Java? a) Array b) Stack c) Queue d) Tree View Answer Answer: b Explanation: Recursions are always managed by using stack. 3. Which of these will happen if recursive method does not have a base case? a) An infinite loop occurs b) System stops the program after some time c) After 1000000 calls it will be automatically stopped d) None of the mentioned View Answer Answer: a Explanation: If a recursive method does not have a base case then an infinite loop occurs which results in stackoverflow. 4. Which of these is not a correct statement? a) A recursive method must have a base case b) Recursion always uses stack c) Recursive methods are faster that programmers written loop to call the function repeatedly using a stack d) Recursion is managed by Java’s Run – Time environment View Answer Answer: d Explanation: Recursion is always managed by operating system. 5. Which of these packages contains the exception Stackoverflow in Java? a) java.lang b) java.util c) java.io d) java.system View Answer Answer: a Explanation: None. 6. What is the output of this program? 1. class recursion 2. { 3. int func ( int n) 4. { 5. int result; 6. result = func (n - 1); 7. return result; 8. } 9. } 10. class Output 11. a) 0 b) 1 c) Compilation Error d) Runtime Error View Answer Answer: d Explanation: Since the base case of the recursive function func() is not defined hence infinite loop occurs and results in stackover...

• v • t • e In recursion is a method of solving a The power of recursion evidently lies in the possibility of defining an infinite set of objects by a finite statement. In the same manner, an infinite number of computations can be described by a finite recursive program, even if this program contains no explicit repetitions. Recursive functions and algorithms [ ] A common Base case [ ] A recursive function definition has one or more base cases, meaning input(s) for which the function produces a result recursive cases, meaning input(s) for which the program recurs (calls itself). For example, the 0! = 1 and, for all n> 0, n! = n( n − 1)!. Neither equation by itself constitutes a complete definition; the first is the base case, and the second is the recursive case. Because the base case breaks the chain of recursion, it is sometimes also called the "terminating case". The job of the recursive cases can be seen as breaking down complex inputs into simpler ones. In a properly designed recursive function, with each recursive call, the input problem must be simplified in such a way that eventually the base case must be reached. (Functions that are not intended to terminate under normal circumstances—for example, some For some functions (such as one that computes the [ how?] where successive terms in the output are the partial sums; this can be converted to a recursion by using the indexing parameter to say "compute the nth term ( nth partial sum)". Recursive data types [ ] Many ...

• • C++ Introduction • C++ Variables and Literals • C++ Data Types • C++ Basic I/O • C++ Type Conversion • C++ Operators • C++ Comments • C++ Flow Control • C++ if...else • C++ for Loop • C++ do...while Loop • C++ break • C++ continue • C++ switch Statement • C++ goto Statement • C++ Functions • C++ Functions • C++ Function Types • C++ Function Overloading • C++ Default Argument • C++ Storage Class • C++ Recursion • C++ Return Reference • C++ Arrays & String • C++ Arrays • Multidimensional Arrays • C++ Function and Array • C++ String • C++ Structures • C++ Structures • Structure and Function • C++ Pointers to Structure • C++ Enumeration • C++ Object & Class • C++ Objects and Class • C++ Constructors • C++ Objects & Function • C++ Operator Overloading • C++ Pointers • C++ Pointers • C++ Pointers and Arrays • C++ Pointers and Functions • C++ Memory Management • C++ Inheritance • C++ Inheritance • Inheritance Access Control • C++ Function Overriding • Inheritance Types • C++ Friend Function • C++ Virtual Function • C++ Templates C++ allows us to allocate the memory of a variable or an array in run time. This is known as dynamic memory allocation. In other programming languages such as Java and Python, the compiler automatically manages the memories allocated to variables. But this is not the case in C++. In C++, we need to deallocate the dynamically allocated memory manually after we have no use for the variable. We can allocate and then deallocate memory dynamically using th...

Computers and Operating Systems The first Computers acquired more powerful operating systems in the 1960s with the emergence of time-sharing, which required a system to manage multiple users sharing CPU time and terminals. Two early time-sharing systems were CTSS (Compatible Time Sharing System), developed at the The In addition to such general-purpose systems, special-purpose operating systems run on small computers that control assembly lines, aircraft, and even home appliances. They are real-time systems, designed to provide rapid response to

2. Which of these data types is used by operating system to manage the Recursion in Java? a) Array b) Stack c) Queue d) Tree View Answer Answer: b Explanation: Recursions are always managed by using stack. 3. Which of these will happen if recursive method does not have a base case? a) An infinite loop occurs b) System stops the program after some time c) After 1000000 calls it will be automatically stopped d) None of the mentioned View Answer Answer: a Explanation: If a recursive method does not have a base case then an infinite loop occurs which results in stackoverflow. 4. Which of these is not a correct statement? a) A recursive method must have a base case b) Recursion always uses stack c) Recursive methods are faster that programmers written loop to call the function repeatedly using a stack d) Recursion is managed by Java’s Run – Time environment View Answer Answer: d Explanation: Recursion is always managed by operating system. 5. Which of these packages contains the exception Stackoverflow in Java? a) java.lang b) java.util c) java.io d) java.system View Answer Answer: a Explanation: None. 6. What is the output of this program? 1. class recursion 2. { 3. int func ( int n) 4. { 5. int result; 6. result = func (n - 1); 7. return result; 8. } 9. } 10. class Output 11. a) 0 b) 1 c) Compilation Error d) Runtime Error View Answer Answer: d Explanation: Since the base case of the recursive function func() is not defined hence infinite loop occurs and results in stackover...