recursive functions

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-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. Paper-1 & 2 | Basic Numeracy: अनुपात और समानुपात / Ratio and Proportion, Divisibility Rules, मिश्रण और एलिगेशन / Mixture and Alligation, Permutation and Combination, Logarithm, संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Sequence and Series (Series), समय, चाल और दूरी / Time, Speed and Distance, प्रतिशत / Percentage, औसत / Average, घन क्षेत्रमिति / Solid Mensuration, Age Problems, Arithmetic, Statistics, Probability, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समय और कार्य / Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Paper-1 & 2 | Data Interpretation: आँकड़ा निर्वचन / Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, Data Sufficiency, अशाब्दिक तर्क / Non-Verbal Reasoning, Syllogisms, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, Analytical Reasoning (Counting Figures Reasoning), गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, कैलेंडर एवं घड़ी / Calendar and Clock, Clock, घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, सादृश्यता एवं वर्गीकरण / Analogy and Classification, क्रम एवं रैंकिंग / Order and Ranking, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Data Arrangement, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: आँकड़ों की पर्याप्तता एवं निर्णय क्षमता / Data Sufficiency and Decision Making
  7. Paper-1 | General Science: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge, समसामयिकी / Current Affairs
  9. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
  10. Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
  11. Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
  12. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
  13. Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
  14. Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
  15. Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
  16. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  18. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  19. Emerging Trends and AI: Emerging Tech Trends, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  20. Paper-2 | Data Processing (Ms-Office): MS Office Applications, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  21. Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर नेटवर्क / Computer Networks
  22. Paper 2 | Pedagogy: वृद्धि और विकास / Growth and Development, विकास के सिद्धांत / Theories of Development, Concept of Pedagogy, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, आकलन और मूल्यांकन / Assessment and Evaluation, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020
  23. Live Classes: RSSB Live Sessions
  24. Paper 1 - Full Mock Tests:
  25. Paper 2 - Full Mock Tests:
  26. BCI Previous Year Papers:
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…