recursive functions

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/programming-data-structures/stack/recursion-stack/asset-recursive-functions-4930 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. 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
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
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…