What is the difference between recursion and iteration?

What is the difference between recursion and iteration?
by

1 Answer

Answer :

A: Recursion is usually slower than iteration due to overhead of maintaining stack, whereas, Iteration does not use stack so it’s faster than recursion. Recursion uses more memory than iteration, whereas, Iteration consume less memory. Recursion makes code smaller, whereas, Iteration makes code longer.
by

Related questions

What is recursion?

Description : What is recursion?

Last Answer : A: It is a process in which a function calls itself repeatedly until some base condition is satisfied.

At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution

Description : At any iteration of simplex method, if Δj (Zj – Cj) corresponding to any nonbasic variable Xj is obtained as zero, the solution under the test is (A) Degenerate solution (B) Unbounded solution (C) Alternative solution (D) Optimal solution

Last Answer : (C) Alternative solution

Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. (C) that exchanges inner loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Description : Loop unrolling is a code optimization technique: (A) that avoids tests at every iteration of the loop (B) that improves performance by decreasing the number of instructions in a basic block. ... loops with outer loops (D) that reorders operations to allow multiple computations to happen in parallel.

Last Answer : (A) that avoids tests at every iteration of the loop

What is difference between recursion and tail recursion?

Description : What is difference between recursion and tail recursion?

Last Answer : Tail recursion is a compiler optimisation. When the final statement of a function is a recursive call into the same function, the compiler can eliminate that call completely. Consider the (simplified) ... instance. That being the case, instead of calling the function a second time and thus crea

What is recursion?

Description : What is recursion?

Last Answer : Recursion is when a method calls itself. 

The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds. a) True b) False

Description : The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The ... are backed up through the tree as the recursion unwinds. a) True b) False

Last Answer : a) True

Backtracking is based on ____________ a) Last in first out b) First in first out c) Recursion d) Both Last in first out & Recursion

Description : Backtracking is based on ____________ a) Last in first out b) First in first out c) Recursion d) Both Last in first out & Recursion

Last Answer : d) Both Last in first out & Recursion

Define what is recursion?

Description : Define what is recursion?

Last Answer : C language a function may call another function. When a function calls itself, it is referred to as recursive call and the process is known as recursion. C provides very good facilities for recursion.

Calculate factorial of a number using recursion.

Description : Calculate factorial of a number using recursion.

Last Answer : #include #include int factorial(int no) { if(no==1) return(1); else return(no*factorial(no-1)); } void main() { intfact,no; clrscr(); printf("\n Enter number"); scanf("%d",&no); fact=factorial(no); printf("\n Factorial number=%d",fact); getch(); }

If the value of a number (N) is entered through keyboard. Write a program using recursion to calculate and display factorial of number (N).

Description : If the value of a number (N) is entered through keyboard. Write a program using recursion to calculate and display factorial of number (N). 

Last Answer : #include<stdio.h> #include<conio.h> int factorial(int N); void main() { int N,fact; clrscr(); printf("Enter number:"); scanf("%d",&N); fact=factorial(N); printf( ... N) { if(N==1) return(1); else return(N*factorial(N-1)); }

Develop a program to find factorial of a number using recursion.

Description : Develop a program to find factorial of a number using recursion.

Last Answer : #include<stdio.h> #include<conio.h> int factorial(int num) { if(num==1) { return 1;  } else { return(num*factorial(num-1));  } } void main() { int ... ;num); result=factorial(num); printf("Factorial of %d is %d",num,result); getch(); }

Will the next iPhone be an iteration (5s) or evolution (6)?

Description : Will the next iPhone be an iteration (5s) or evolution (6)?

Last Answer : Yup

What is an indefinite iteration?

Description : What is an indefinite iteration?

Last Answer : Need answer

Traditional Work Breakdown Structures tend to a. focus on the design of the system as oppose to the needs of the current phase and iteration b. force too many levels of detail early on for large project and they tend to allow too few level of detail for small projects c. be too specific for the project and difficult to compare across projects d. all of the above e. none of the above

Description : Traditional Work Breakdown Structures tend to  a. focus on the design of the system as oppose to the needs of the current phase and  iteration  b. force too many levels of detail early on for large ... project and difficult to compare across projects  d. all of the above  e. none of the above

Last Answer : d. all of the above

From where did the new fact inferred on new iteration is derived? a) Old fact b) Narrow fact c) New fact d) All of the mentioned

Description : From where did the new fact inferred on new iteration is derived? a) Old fact b) Narrow fact c) New fact d) All of the mentioned

Last Answer : c) New fact

following are structured programs written in simple structures. a Sequence b. Selection c. Iteration d. All of these

Description : following are structured programs written in simple structures. a Sequence b. Selection c. Iteration d. All of these

Last Answer : d. All of these

Iteration also called: a. Repetition b. Straight c. Selection d. Sequence

Description : Iteration also called: a. Repetition b. Straight c. Selection d. Sequence

Last Answer : a. Repetition

In_ instructions are followed one after the other in the preset order in which they appear within program: a. Sequence b Selection c. Break d. Iteration

Description : In_ instructions are followed one after the other in the preset order in which they appear within program: a. Sequence b Selection c. Break d. Iteration

Last Answer : a. Sequence

_is sequence of instructions is executed and repeated any no. of times in loop until logical condition is true: a. Iteration b. Repetition c Botha&b d. None of these

Description : _is sequence of instructions is executed and repeated any no. of times in loop until logical condition is true: a. Iteration b. Repetition c Botha&b d. None of these

Last Answer : c Botha&b

Structured programming codes includes ? sequencing alteration iteration multiple exit from loops only A, B and C

Description : Structured programming codes includes ? sequencing alteration iteration multiple exit from loops only A, B and C

Last Answer : only A, B and C

Advantage of Gauss-Seidel method is a) applicable for large power system network b) calculation time for each iteration is less c) number of iterations are less d) all of the above

Description : Advantage of Gauss-Seidel method is a) applicable for large power system network b) calculation time for each iteration is less c) number of iterations are less d) all of the above

Last Answer : b) calculation time for each iteration is less

The spiral model of software development (A) Ends with the delivery of the software product (B) Is more chaotic than the incremental model (C) Includes project risks evaluation during each iteration (D) All of the above

Description : The spiral model of software development (A) Ends with the delivery of the software product (B) Is more chaotic than the incremental model (C) Includes project risks evaluation during each iteration (D) All of the above

Last Answer : (C) Includes project risks evaluation during each iteration

What is the difference between a sequential file and a random file?

Description : What is the difference between a sequential file and a random file?

Last Answer : Ans: Sequential file access is the method employed in tape drives where the files are access in a sequential manner. So if you have to get a file in the end of the tape you have to start ... Disks and Optical drives, wherever the files is placed it will go to that particular place and retrieve it.

What is the difference between Call by value and Call by reference?

Description : What is the difference between Call by value and Call by reference?

Last Answer : A: Call By Value : When a function is called by value, then the value of the actual parameter is copied to the formal parameter (i.e. a separate copy is made). Any changes made with the ... with the values at that address of the formal parameter affects (changes) the value of the actual parameter.

What is the difference between naming conventions and naming rules?

Description : What is the difference between naming conventions and naming rules?

Last Answer : A: Violating naming rules will result in a syntax error, whereas, violating naming conventions will not result in any error.

What is the difference between keywords and reserved words?

Description : What is the difference between keywords and reserved words?

Last Answer : A: Keywords have a special meaning in a language, and are part of the syntax. Reserved words are words that cannot be used as identifiers (variables, functions, etc.), because they are reserved by the ... goto is a reserved word but not a keyword (as a consequence, you cannot use it at all)

What is the difference between linear and binary search?

Description : What is the difference between linear and binary search?

Last Answer : A: Linear search does not require the array to be sorted, whereas, binary search requires that the array be sorted. Linear search checks for the search item in a linear fashion from the beginning cell till the end, ... tell what is control variable in your loop. So if your loop is for(int i = 1; i

What is the difference between selection sort and bubble sort?

Description : What is the difference between selection sort and bubble sort?

Last Answer : A: In selection sort, successive rounds are executed to select the element which is required to be placed in their sorted position, whereas, in bubble sort, every consecutive pairs of elements are compared ... element at every pass, whereas, in bubble sort we get the largest element in every pass.

What is the difference between break and continue?

Description : What is the difference between break and continue?

Last Answer : A: break keyword stops the complete loop and takes the control out of the loop, whereas, the continue keyword just stops the current iteration and takes the control to the next iteration.

What is the difference between length() and length?

Description : What is the difference between length() and length?

Last Answer : A: length() function is used to find the number of characters present in a String, whereas, length keyword is used to find the number if cells in an array.

What is the difference between function overloading and function overriding?

Description : What is the difference between function overloading and function overriding?

Last Answer : A: In function overloading only the function name is same but function signature (list of parameters) is different, whereas, in function overriding both the function name as well as function ... is an example of static polymorphism, whereas, function overriding is an example of dynamic polymorphism.

What is the difference between do-while and while?

Description : What is the difference between do-while and while?

Last Answer : A: do-while lop is exit controlled (i.e. condition is checked at the exit) and runs at least once even if the condition is false whereas, while loop is entry controlled (i.e. condition is checked at the entry) and does not run even once if the condition is false.

What is the difference between for and while?

Description : What is the difference between for and while?

Last Answer : A: The difference lies in the way they are commonly used. for loop is commonly used when the number of iterations are known whereas, while loop is commonly used when the number of iterations are not known.

What is the difference between if and switch?

Description : What is the difference between if and switch?

Last Answer : A: (a) if can compare conditions for all data types whereas, switch can only check integers and characters. (b) all kinds of relations can be checked using if whereas only equality relation can be checked using switch.

What is the difference between casting and coercion?

Description : What is the difference between casting and coercion?

Last Answer : A: Type Casting refers to Explicit type conversion i.e. When the conversion takes place with the programmer’s intervention, whereas, Coercion refers to Implicit type conversion i.e. When the conversion takes place on its own without the programmer’s intervention.

What is the difference between throws and throw?

Description : What is the difference between throws and throw?

Last Answer : A: Using throws keyword, we can give system defined error message if any error occurs, while using throw keyword, we can force an exception and give user-defined error messages.

What is the difference between print() and println() methods?

Description : What is the difference between print() and println() methods?

Last Answer : A: The print() functions prints a line and the control remains on the same line, whereas, the println() function prints a line and the control moves on to the next line.

Methods can be overloaded with a difference only in the type of the return value .. A) Not supported B) False C) True D) None of the above

Description : Methods can be overloaded with a difference only in the type of the return value .. A) Not supported B) False C) True D) None of the above

Last Answer : B) False

_____ produces the relation that has attributes of R1 and R2 (A) Cartesian product (B) Difference (C) Intersection (D) Product

Description : _____ produces the relation that has attributes of R1 and R2 (A) Cartesian product (B) Difference (C) Intersection (D) Product

Last Answer : A) Cartesian product

The essential difference between traps and interrupts is (A) traps are asynchronous and interrupts are synchronous with the program (B) traps are synchronous and interrupts are asynchronous with the program (C) traps are synchronous and interrupts are asynchronous with the I/O devices. (D) None of these.

Description : The essential difference between traps and interrupts is (A) traps are asynchronous and interrupts are synchronous with the program (B) traps are synchronous and interrupts are asynchronous with the program ( ... synchronous and interrupts are asynchronous with the I/O devices. (D) None of these.

Last Answer : (B) traps are synchronous and interrupts are asynchronous with the program

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?

Description : A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are ... (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Last Answer : Answer: D

ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ............... (1) Race condition (2) Saturation (3) Delay (4) High impedance

Description : ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ............... (1) Race condition (2) Saturation (3) Delay (4) High impedance

Last Answer : Answer: 2  Explanation: Emitter-coupled logic (ECL) is the fastest of all logic families and therefore is used in applications where very high speed is essential. High speeds have become ... configuration, in which they are never driven into saturation and thereby the storage time is eliminated.