recursive functions

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/LTI-MINDTREE-PREPARATION/data-structures/stack/recursion-stack/asset-recursive-functions-4930 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 focuses on analyzing a recursive pseudo-code function named Print_somthing(a, i, j) to determine its output. The instructor sets up a specific scenario using an integer array a containing the values [10, 18, 7, 16, 22, 15] at indices 0 through 5. The function operates by comparing the element at the start index i with the element at the end index j. If the element at i is strictly less than the element at j, the function recursively calls itself with i+1, effectively discarding the smaller element on the left. If the element at i is greater than or equal to the element at j, it calls itself with j-1, discarding the smaller element on the right. This process repeats until the indices converge (i == j), at which point the remaining element is printed. The instructor demonstrates that this logic is a method for finding the maximum element in an array.

Chapters

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

    The instructor introduces the problem statement 'Find the output of the following pseudo code?' and displays the function definition void Print_somthing(a, i, j). He draws a horizontal array diagram labeled a with indices 0 to 5. He writes memory addresses like 1000, 1004 above the boxes to indicate contiguous memory, then fills the boxes with the values 10, 18, 7, 16, 22, 15. He writes the initial call Print_somthing(a, 0, 5) at the bottom. He explains the base case if (i == j) which triggers a printf of a[i] and returns. He then explains the Else block containing the comparison if (a[i] < a[j]).

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

    The instructor performs the first few recursive steps. He compares a[0] (10) and a[5] (15). Since 10 < 15 is true, he writes Print_somthing(a, 1, 5). Next, he compares a[1] (18) and a[5] (15). Since 18 < 15 is false, he executes the Else branch and writes Print_somthing(a, 1, 4). He continues tracing: comparing a[1] (18) and a[4] (22), where 18 < 22 is true, leading to Print_somthing(a, 2, 4). Then he compares a[2] (7) and a[4] (22), where 7 < 22 is true, leading to Print_somthing(a, 3, 4). Finally, he compares a[3] (16) and a[4] (22), where 16 < 22 is true, leading to Print_somthing(a, 4, 4).

  3. 5:00 – 7:12 05:00-07:12

    The instructor finalizes the execution trace. With the call Print_somthing(a, 4, 4), the condition i == j (4 == 4) becomes true. He circles the base case block and writes 22 -> output on the board, indicating that a[4] is the result. He verbally explains that the algorithm works by eliminating the smaller of the two boundary elements in each step, ensuring the maximum value remains until the indices meet. He confirms the final output is 22.

The video provides a step-by-step walkthrough of a recursive algorithm designed to find the maximum value in an array. By comparing boundary elements and discarding the smaller one, the search space narrows until a single element remains. The instructor uses a concrete example with the array [10, 18, 7, 16, 22, 15] to demonstrate that the function correctly identifies 22 as the maximum element.

Loading lesson…