Stack recursion Practice questions

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COCUBES-PREPARATION/data-structures/stack/recursion-stack/asset-stack-recursion-practice-questions 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 presents a computer science problem involving a recursive function named `fun(int x, int y)`. The instructor systematically breaks down the execution of the function by tracing each recursive step on a digital whiteboard. The function logic is defined with a base case `if (x == 0) return y;` and a recursive step `return fun(x - 1, x + y);`. The instructor starts by initializing the parameters `x=4` and `y=3`. He then demonstrates how the function calls itself with modified arguments, decrementing `x` by 1 and adding the current value of `x` to `y` in each step. This process continues until the base case is met. The final result is identified as 13, corresponding to option (A).

Chapters

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

    In this initial segment, the instructor introduces the problem statement and the function definition. He writes `fun(4, 3)` on the board and assigns the initial values `x=4` and `y=3`. He checks the condition `if (x == 0)`, which evaluates to false. Consequently, he proceeds to the recursive call `fun(x - 1, x + y)`. He writes down the next call `fun(3, 7)`, showing the calculation `4-1=3` and `4+3=7`. He continues this process, writing `fun(2, 10)` where `x` becomes 2 and `y` becomes `3+7=10`. The instructor then writes `fun(1, 12)`, updating `x` to 1 and `y` to `2+10=12`. The board fills with the sequence of function calls, illustrating the recursive nature of the code.

  2. 2:00 – 3:15 02:00-03:15

    In the final segment, the instructor completes the trace of the recursive function. He writes the next call `fun(0, 13)`, where `x` becomes 0 and `y` becomes `1+12=13`. At this point, the condition `if (x == 0)` evaluates to true. The instructor indicates that the function returns the value of `y`, which is 13. He circles the number 13 on the board to highlight the final result. He then writes `(13) Ans` and places a checkmark next to option (A) 13, confirming it as the correct answer.

The lesson effectively demonstrates the evaluation of a recursive function by manually tracing its execution stack. By breaking down the problem into discrete steps, the instructor clarifies how parameters change with each recursive call. The visual aid of writing out each call on the board helps students follow the logic, from the initial call `fun(4, 3)` down to the base case `fun(0, 13)`. This methodical approach ensures a clear understanding of how the final value is derived through successive additions and decrements.

Loading lesson…