
Already know some of this? A 2-minute test skips the lessons you know.
Take the placement testA free 19-lesson course built from College Wallah's 3h 15m of YouTube video. 2 days at 90 minutes a day, with study notes and a quiz in every lesson. A 2-minute placement test skips what you already know.
Taught by College Wallah on YouTube. Videos play in YouTube's own player, so the creator keeps every view.
Understand what functions are, why they are used to avoid repetition and improve code readability, and how they differ from loops.
Define functions with parameters and return types, pass arguments by value, and use the returned value in the calling code.
Implement a reusable min function to find the minimum of two numbers, demonstrating code reduction and the DRY principle.
Explain the special role of main, how return types (int, void, char) dictate what a function returns, and use math library functions like sqrt and pow.
Declare function prototypes to allow calling functions before their definition, resolving implicit declaration warnings.
Build a combination (nCr) function using a helper factorial function to compute and print binomial coefficients.
Print Pascal's Triangle by calling the nCr function inside nested loops, mapping row and column indices to n and r.
Print Pascal's Triangle efficiently using the recurrence relation C(n, k) = C(n, k-1) * (n-k+1) / k, avoiding repeated factorial calculations.
Swap two variables using a temporary variable and using arithmetic operations (addition/subtraction) without a third variable.
Explain why pass-by-value fails to swap actual variables, introduce pointers to hold addresses, and demonstrate pass-by-reference to modify original variables.
Declare pointer variables, use the address-of (&) and dereference (*) operators to access and modify values at specific memory addresses.
Implement a correct swap function by passing addresses of variables and dereferencing pointers inside the function to exchange values.
Introduce double pointers (pointer to pointer), demonstrate multi-level indirection, and show how pointer arithmetic works.
Write a function to compute the Highest Common Factor (HCF/GCD) by iterating from the minimum of two numbers downwards for early termination ators downwards and returning the first common divisor.
Review key concepts via true/false questions on function calls, return statements, and scope; assign homework on nPr, prime factors, factorial and Fibonacci series using functions.