Functions

Duration: 5 min

This video lesson is available to enrolled students.

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

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Divisibility Rules, HCF LCM, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Mixture and Alligation, Partnership, Age Problems, Time and Work, Pipe and Cistern, Speed Time and Distance, Algebra, Arithmetic, Data Interpretation, Sequence and Series (Series), Logarithm, Powers and Exponents (Surds and Indices), Permutation and Combination, Probability, Speed Mathematics and Basic Mathematics, Trigonometry
  2. Logical Reasoning: Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Syllogisms, Inequality, Data Sufficiency, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Venn Diagram, Logical Sequence Of Words, Calendar, Clock, Cubes & Dices, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Noun, Pronoun, Adjectives, Verb, Adverb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Articles, Preposition, Conjunction, Modals, Determiner, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Construction
  4. Data Structures (Domain Test): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  5. Algorithms (Domain Test): Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms
  6. OOPs (Domain Test): Object Oriented Programming (OOPS)
  7. DBMS (Domain Test): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  8. SQL (Domain Test): SQL
  9. Operating Systems (Domain Test): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  10. Computer Networks (Domain Test): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  11. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  12. Written English Test: English Writing Ability
  13. Psychometric Test: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
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…