Recursive function to find factorial of a number is O int fact(int n) { if(n=30) return 0; else return n'fact(n-1); } O int fact(int n) { if(n=31) return n; else return n"fact(n+1);} O int fact(int n) (if(n=3D0) return 1; else return n"fact(n-1); } int fact(int n) { int f-1; while(n!-1) ( f'=n; n-;} return f; }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
https://sbu.mastersofterp.in/ITLE/itmsN+vpnr8D2k+qf2a5x3DDBEIROPPAH6
softerp.in/ITLE/itmsN+vpnr8D2k+qf2a5ADDBEIROPPAh6txlyYhBIZDbs=
Seat No: SBU200013
PH
Course Name: BCA-101-PROGRAMMING IN C
AVAIL
Test Name: BCA-101 Programming In
C End Sem Exam 2021 Section A
Time Remaining: 0:7:42
Instruction: Please don't close the browser once you started the test else your attempt will be lost !
Question No : 16
Recursive function to find factorial of a number is
O int fact(int n) { if(n=%3D0) return 0; else return n°fact(n-1);}
O int fact(int n) { if(n=31) return n; else return n"fact(n+1); }
O int fact(int n) { if(n=%3D0) return 1; else return n'fact(n-1); }
O int fact(int n) { int f-1; while(n!%-1) {f=n; n-;} return f; }
Previous
Save & Next
Skip
Clear
Mark As Review
Finish Test
РОсо
SHOT ON Pосо м2 PRO
Transcribed Image Text:https://sbu.mastersofterp.in/ITLE/itmsN+vpnr8D2k+qf2a5x3DDBEIROPPAH6 softerp.in/ITLE/itmsN+vpnr8D2k+qf2a5ADDBEIROPPAh6txlyYhBIZDbs= Seat No: SBU200013 PH Course Name: BCA-101-PROGRAMMING IN C AVAIL Test Name: BCA-101 Programming In C End Sem Exam 2021 Section A Time Remaining: 0:7:42 Instruction: Please don't close the browser once you started the test else your attempt will be lost ! Question No : 16 Recursive function to find factorial of a number is O int fact(int n) { if(n=%3D0) return 0; else return n°fact(n-1);} O int fact(int n) { if(n=31) return n; else return n"fact(n+1); } O int fact(int n) { if(n=%3D0) return 1; else return n'fact(n-1); } O int fact(int n) { int f-1; while(n!%-1) {f=n; n-;} return f; } Previous Save & Next Skip Clear Mark As Review Finish Test РОсо SHOT ON Pосо м2 PRO
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Computational Systems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education