Recursive Functions

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/data-structure-it-specialist/stack/recursion-stack/asset-recursive-functions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  14. Compiler Design (IT Specialist): 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
  15. Computer Architecture (IT Specialist): Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  16. Data Communication & Networking (IT Specialist): Introduction to CN, Data Communication, 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, Application Layer, Hardware basics, Network Security
  17. Descriptive Test (Main Exam): English Writing Ability
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…