Find Factorial of a number using recurssion

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/TCS-NQT-PREPARATION/advanced-coding/coding-questions/coding-question/asset-find-factorial-of-a-number-using-recurssion after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. TCS One Shot Free Videos & Notes: TCS Preparation
  2. Numerical Ability (Foundation Section): Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Statistics, Arithmetic, Partnership, Speed Mathematics and Basic Mathematics
  3. Reasoning Ability (Foundation Section): Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, Logical Sequence Of Words
  4. New Pattern-Verbal Ability (Foundation Section): Sentence Completion (Fill in the blanks), English Writing Ability
  5. Old Pattern-Verbal Ability (Foundation Section): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Articles, Direct and Indirect Speech, Conjunction, Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Verbal Analogy (Word Based Analogy), Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Cloze Test (Cloze Passage), Sentence Construction, Verb
  6. Advanced Quantitative Ability: TCS NQT Advanced Quantitative Ability
  7. Advanced Reasoning Ability: TCS NQT Advanced Reasoning Ability
  8. Advanced Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Python for Placements by Yash Sir, DSA using Python, Object Oriented Programming (OOPS), Programming in C++, Java
  9. TCS Full Length Mock Test:
  10. TCS Interview & Resume Prep: MR & HR Interview Preparation, TCS Interview Preparation, Mock Interview, Interview Recordings, Resume Preparation, Resume Review
  11. Mega Test:
  12. Grand Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a programming tutorial that explains how to calculate the factorial of a positive integer using recursion in C. The lesson begins with a problem statement and two examples, illustrating the mathematical concept of factorial. The instructor then introduces the two main approaches: iteration and recursion, and focuses on the recursive method. The core of the lesson involves deriving the recursive formula, n! = n * (n-1)!, and then writing the corresponding C code. The code includes a function `factorial` with a base case for n=0 and a recursive call. The video concludes with a step-by-step walkthrough of the function's execution for n=4, showing how the recursive calls build up and then resolve to produce the final result of 24.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video starts with the Knowledge Gate logo, followed by a slide introducing the topic: finding the factorial of a positive integer N. The instructor presents two examples: for N=5, the output is 120 (5*4*3*2*1), and for N=4, the output is 24 (4*3*2*1). The instructor then introduces the two main methods for solving this problem: iteration and recursion, writing them on the screen as the primary approaches to be discussed.

  2. 2:00 – 5:00 02:00-05:00

    The instructor explains the recursive approach. He writes the mathematical formula for factorial, n! = n * (n-1)!, and then begins to write the C code. He defines a function `unsigned int factorial(unsigned int n)` and explains the base case: if n is 0, return 1. He then writes the recursive case: return n * factorial(n-1). The instructor then shows the main function, which reads an integer from the user and calls the factorial function, printing the result. He uses a laser pointer to highlight key parts of the code as he explains them.

  3. 5:00 – 5:39 05:00-05:39

    The instructor demonstrates the execution of the recursive function for n=4. He draws a call stack, showing the sequence of function calls: `fact(4)` calls `fact(3)`, which calls `fact(2)`, which calls `fact(1)`, which calls `fact(0)`. He explains that `fact(0)` returns 1, and this value is then used to calculate `fact(1) = 1 * 1 = 1`, `fact(2) = 2 * 1 = 2`, `fact(3) = 3 * 2 = 6`, and finally `fact(4) = 4 * 6 = 24`. The final result, 24, is printed as the output.

The video provides a clear, step-by-step tutorial on implementing a recursive solution for the factorial problem in C. It effectively bridges the gap between the mathematical definition of factorial and its programming implementation. The lesson progresses logically from problem definition to algorithm design (recursion), code writing, and finally, a detailed walkthrough of the execution flow, making it an excellent resource for understanding recursion.

Loading lesson…