Functions
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
- Artificial Intelligence: Artificial Intelligence
- Image Processing: Digital Image Fundamentals
- Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
- Descriptive Paper: English Writing Ability
- Mains - Unit Tests:
- Mains - Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture explains how to determine the output of a recursive function named `Print_array(a, i, j)`. The instructor sets up a specific example using an array `a` with values `{10, 30, 18, 7, 15, 22}` and initial parameters `i=1` and `j=4`. He traces the execution step-by-step, demonstrating how the function prints elements sequentially until the base case `i == j` is reached, resulting in the output sequence 30, 18, 7, 15.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with the instructor presenting a pseudo-code problem titled 'Find the output of the following pseudo code?'. The code defines a function `void Print_array(a, i, j)` with a base case `if (i == j)` that prints `a[i]` and returns. The else block prints `a[i]` and calls `print_array(a, i+1, j)`. To demonstrate, he draws an array `a` with indices 0 to 5 and fills it with values: 10, 30, 18, 7, 15, 22. He sets the initial call parameters as `i=1` and `j=4`, writing `print_array(a, 1, 4)` on the board to start the trace.
2:00 – 5:00 02:00-05:00
The instructor performs a detailed trace of the recursion using a tree diagram. First, `print_array(a, 1, 4)` executes. Since `1 != 4`, it prints `a[1]` (value 30) and calls `print_array(a, 2, 4)`. Next, `print_array(a, 2, 4)` executes. Since `2 != 4`, it prints `a[2]` (value 18) and calls `print_array(a, 3, 4)`. Then, `print_array(a, 3, 4)` executes. Since `3 != 4`, it prints `a[3]` (value 7) and calls `print_array(a, 4, 4)`. Finally, `print_array(a, 4, 4)` executes. Here `4 == 4`, so it hits the base case, prints `a[4]` (value 15), and returns. He writes the sequence 30, 18, 7, 15 on the board.
5:00 – 5:08 05:00-05:08
The instructor concludes the explanation by confirming the final output sequence. He writes the final answer '30 18 7 15' inside a box to signify the solution. He briefly reviews the trace to ensure the logic holds, emphasizing that the recursion stops exactly when the start index meets the end index, preventing infinite loops or out-of-bounds errors.
The lesson effectively demonstrates the mechanics of recursion by tracing a function that prints array elements within a specific range. By breaking down the base case and the recursive step, the instructor shows how the index `i` increments until it equals `j`, ensuring the correct subset of the array is printed. This method of drawing a recursion tree is a standard technique for visualizing and debugging recursive algorithms.

