Function_Practice Question

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/INFOSYS-PREPARATION/programming-fundamentals/functions-ca695d/basic-recursion/asset-function-practice-question after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Reasoning Ability: Seating Arrangements, Syllogisms, Coding Decoding, Series (Number and Letter Series) (Numerical Relations and Reasoning), Crypt Arithmetic, Clock, Calendar, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Blood Relations, Directions (Direction Test), Inequality
  2. Technical Ability (Aptitude): Percentage, Ratio and Proportion (Ratios), HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Permutation and Combination, Probability, Profit and Loss, Time and Work, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Age Problems, Partnership, Data Interpretation, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Statistics, Mental Ability
  3. Verbal Ability: Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Facts, Inference and Judgements
  4. Programming Fundamentals: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  5. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Python for Placements by Yash Sir, DSA using Python, Object Oriented Programming (OOPS)
  6. Pseudo Code: Pseudo Codes
  7. Puzzle Solving: Puzzle Solving (Puzzles)
  8. English Grammar: Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Active Passive Voice (Voice), Determiner, Adverb, Verb
  9. Essay Writing: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a detailed walkthrough of a recursive function problem designed to test understanding of algorithmic logic. The specific task is to find the output of the function x when the input n is 6. The instructor, Sanchit Jain Sir, uses a whiteboard-style presentation to break down the pseudo-code. The code defines a function int x(int n) with a conditional check: if n is less than 3, it returns 1; otherwise, it returns the sum of x(n-1) called twice plus 1. The lecture focuses on tracing the execution path and calculating the final integer value through step-by-step evaluation.

Chapters

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

    The instructor introduces the problem statement 'Find the output of the following pseudo code on n = 6?'. He writes the function definition int x(int n) and the logic if (n < 3) return 1; Else return x(n-1) + x(n-1) + 1;. He begins drawing a recursion tree in red ink. The root is x(6), which splits into x(5), x(5), and 1. He expands the tree downwards, showing x(5) splitting into x(4), x(4), and 1, continuing until x(2) is reached. He marks x(2) as the base case because 2 < 3, meaning it returns 1 immediately without further recursion.

  2. 2:00 – 2:46 02:00-02:46

    The instructor calculates the values starting from the base case x(2) = 1. He writes x(3) = 3 on the board, derived from 1 + 1 + 1. He then calculates x(4) = 7 using the formula 3 + 3 + 1. Following this pattern, he determines x(5) = 15 (since 7 + 7 + 1). Finally, he computes x(6) = 31 by adding 15 + 15 + 1. He circles the final result 31 in red ink. He briefly mentions the mathematical pattern 2^(n-1) - 1 to confirm the sequence 3, 7, 15, 31.

The lesson effectively demonstrates a standard technique for solving recursive problems: visualization via recursion trees and iterative evaluation. By breaking down the complex call x(6) into smaller sub-problems x(5), x(4), etc., the instructor shows how to manage the state of the recursion. The key takeaway is recognizing the base case n < 3 and applying the recurrence relation T(n) = 2*T(n-1) + 1 to find the closed-form solution or specific value. This approach helps students avoid common pitfalls like infinite loops or incorrect base case handling.

Loading lesson…