Functions

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/LTI-MINDTREE-PREPARATION/data-structures/stack/recursion-stack/asset-functions after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. English Comprehension/Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Vocabulary, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Conjunction, Pronoun, Noun, Adjectives, Adverb, Modals, Cloze Test (Cloze Passage), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  2. Logical Ability: Coding Decoding, Directions (Direction Test), Analogy, Inequality, Data Sufficiency, Series (Number and Letter Series) (Numerical Relations and Reasoning), Syllogisms, Seating Arrangements, Puzzle Solving (Puzzles), Blood Relations, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Data Arrangement, Venn Diagram, Calendar, Clock
  3. Quantitative Ability: Logarithm, Permutation and Combination, Probability, Profit and Loss, Speed Time and Distance, Mixture and Alligation, Partnership, Simple Interest and Compound Interest, Percentage, Ratio and Proportion (Ratios), Average, Time and Work, Pipe and Cistern, Number System, Divisibility Rules, HCF LCM, Algebra, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Age Problems, Data Interpretation, Sequence and Series (Series)
  4. Basic Analytical Ability: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Selection Decision Table (Decision Making)
  5. Computer Programming: Pseudo Codes, Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  6. DBMS (Computer Science): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Transaction Management, Concurrency Control, Database Security & Authorization
  7. SQL (Computer Science): SQL
  8. OS (Computer Science): Introduction to OS, Process Management, CPU Scheduling, Deadlock, Process Synchronization, Threads & Process Creation, Memory Management, Virtual Memory, File Management
  9. Computer Networks (Computer Science): 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
  10. Data Structures (Computer Science): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. OOPs (Computer Science): Object Oriented Programming (OOPS)
  12. Software Engineering (Computer Science): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. SVAR Conversational - Spoken English: Communication Assessment
  14. HR Interview: MR & HR Interview Preparation
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

  1. 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. 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.

  3. 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.

Loading lesson…