recursive functions

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/UP-POLICE-COMPUTER-OPERATOR/data-structures/stack/recursion-stack/asset-recursive-functions-4930 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. General Knowledge: Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, GK- Current Affairs, Indian Economy, Static General Knowledge, Environment, Evolution of Indian Banking (Banking & Financial Awareness)
  3. Mental Aptitude and Reasoning: Ratio and Proportion (Ratios), Data Interpretation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Vocabulary, Profit and Loss, Arithmetic, Mental Ability, Percentage, Algebra, Mensuration and Geometry, Age Problems, Clock, Calendar, Verbal Analogy (Word Based Analogy), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analogy, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Selection Decision Table (Decision Making), Cubes & Dices, Blood Relations, Venn Diagram, Logical Sequence Of Words, Inequality, Directions (Direction Test), Data Arrangement, Syllogisms, Seating Arrangements, Ranking, Order and Sequence, Time and Work, Ratio and Proportion, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Number System, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Alphabet and Word Tests, Sequences and Series, Simplification and Approximation, Mathematical Operations, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Cubes and Dice, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Profit, Loss and Discount, Mensuration, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Trigonometry, Probability, Measurement and Quantity Take-Off, Clocks and Calendars, Articles and Determiners, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Modals, Conditionals and Subjunctive, Algebra, Vocabulary, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, HCF LCM, Combinatorics
  4. CS | Computer Fundamentals: Basics of COA, Number System, Number Representation, C Fundamentals, Algorithm Analysis, Input Output Organisation, Semiconductor Memories and Programmable Logic, Timing, Hazards and Testing, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Number Systems and Codes, Combinational Logic Design, Combinational Logic Circuits, Number Systems and Codes
  5. CS | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, SQL
  6. CS | Workplace productivity Tools: MS Office Applications, Keyboard Shortcuts
  7. CS | Computer Networks: Introduction to CN, Data Communication, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, Application Layer, Hardware Basics, Network Security
  8. CS | The Internet: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Web Publishing & Hosting, Server Side & Security, Emerging Technologies
  9. CS | Emerging Technologies: Artificial Intelligence, Emerging Tech Trends, Introduction to OS, Windows OS, Linux OS, Unix OS, JavaScript-Basics, Internet of Things
  10. CS | Boolean algebra: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Semiconductor Memories and Programmable Logic Devices, Logic Families, Arithmetic Circuits, Waveform Generators and Timer Circuits, Minimization of Boolean Functions
  11. CS | Data Structures: Introduction to DS, Array, Stack, Queue
  12. CS | Cryptography: Society, Law & Ethics, 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, Intrusion Detection Systems (IDS), Cyber Safety and Security
  13. UP Police Previous Year Papers:
  14. UP Police Full Mock Tests:
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…