Recursive Functions

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/data-structure-and-algorithms/stack/recursion-stack/asset-recursive-functions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture analyzes a recursive pseudo-code function named `Print_array(a, i, j)` to determine its output. The instructor begins by defining the function's logic: a base case where `i == j` prints the current element and returns, and a recursive step that calls the function with `i+1` before printing the current element `a[i]`. He sets up a concrete example using an array `a` with indices 0 through 4, populating it with values 10, 12, 18, 22, and 11. The specific function call analyzed is `print_array(a, 0, 3)`. Through a detailed trace on the whiteboard, the instructor demonstrates how the recursion unwinds, resulting in the array elements being printed in reverse order of their indices within the specified range.

Chapters

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

    The instructor introduces the problem by displaying the pseudo-code for `void Print_array(a, i, j)`. He draws a diagram of an array `a` with indices 0 to 4. Initially, he writes memory addresses like 1000, 1004, 1008, 1012, 1016 above the array cells, but then corrects this to actual integer values: 10, 12, 18, 22, 11. He writes the initial function call `print_array(a, 0, 3)` on the board, setting the stage for the trace where `i` starts at 0 and `j` is 3.

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

    The instructor traces the recursive execution step-by-step. He writes down the sequence of calls: `print_array(a, 0, 3)` calls `print_array(a, 1, 3)`, which calls `print_array(a, 2, 3)`, which finally calls `print_array(a, 3, 3)`. At this point, the condition `i == j` (3 == 3) is true. He circles the base case logic, noting that `a[3]` (value 22) is printed first. He then explains the return process, showing that after the recursive call returns, the code proceeds to the `printf` statement below it. This causes `a[2]` (18) to be printed, followed by `a[1]` (12), and finally `a[0]` (10) as the stack unwinds back to the initial call.

  3. 5:00 – 6:40 05:00-06:40

    In the final segment, the instructor consolidates the results of the trace. He writes the final output sequence `22 18 12 10` at the bottom of the whiteboard. He emphasizes that the placement of the `printf` statement *after* the recursive call is the key factor causing the reverse order output. He circles the relevant lines of code to reinforce that the printing happens on the way back up the recursion stack, effectively reversing the order of indices from 0 to 3.

The lecture effectively demonstrates the concept of post-order traversal in recursion. By placing the print statement after the recursive call, the function delays printing until the base case is reached and the stack begins to unwind. This results in the output sequence being the reverse of the index progression from `i` to `j`. The instructor uses a concrete array example to visualize the stack depth and the specific values printed at each return step.

Loading lesson…