Stack recursion Practice questions

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/data-structures/stack/recursion-stack/asset-stack-recursion-practice-questions-4942 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): 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
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): 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
  11. Computer Networks (Technical): 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
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a computer science problem asking to identify the functionality of a given recursive C function. The function fun(int x, int y) takes two integer arguments. The instructor analyzes the code structure, identifying a base case where y equals 0 returns 0, and a recursive step that adds x to the result of fun(x, y-1). To understand the behavior, the instructor sets up a concrete example with x = 2 and y = 4. He manually traces the recursion, expanding the function calls step-by-step until the base case is reached. After calculating the final result, he evaluates four multiple-choice options to find the mathematical equivalent of the function's operation.

Chapters

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

    The segment begins with the problem statement and code display. The instructor underlines the condition if (y == 0) and the return statement return 0. He then introduces test values x = 2 and y = 4 to trace the execution. He writes fun(2, 4) on the board and begins expanding the recursive calls. The expansion shows Return (2 + fun(2, 3)), followed by Return (2 + fun(2, 2)), and Return (2 + fun(2, 1)). The tracing continues until the base case Return (2 + fun(2, 0)) is reached. The instructor underlines y == 0 to emphasize the stopping condition. He then starts the backtracking process, calculating 2 + 0 = 2 for the base case return value. This section establishes the recursive structure and begins the manual execution trace.

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

    The instructor continues the backtracking calculation from the previous window. He computes the return values for each recursive level: fun(2, 1) returns 2, fun(2, 2) returns 4, fun(2, 3) returns 6, and finally fun(2, 4) returns 8. With the result 8 established, he systematically checks the provided options. He calculates x + y as 6, x + x*y as 10, x*y as 8, and x^y as 16. He marks option (A) and (B) as incorrect. He identifies that option (C) x*y matches the calculated result of 8. He places a checkmark next to option (C) and crosses out the others, confirming that the function performs multiplication. The video concludes with the correct answer identified.

The lecture effectively demonstrates a standard technique for analyzing recursive algorithms: manual tracing with concrete inputs. By substituting specific values, the abstract recursion becomes a concrete arithmetic sequence. The instructor shows that adding x repeatedly y times is mathematically equivalent to multiplying x by y. This method of tracing execution flow and comparing results against options is a crucial skill for solving recursion problems in computer science exams. It highlights the importance of understanding base cases and recursive steps in algorithm design.

Loading lesson…