Stack recursion Practice question

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/stack/recursion-stack/asset-stack-recursion-practice-question after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, 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), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: 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
  15. Operating Systems: 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
  16. Computer Networks: 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a C programming problem involving a recursive function named fun. The code snippet includes standard headers and a function definition where fun(int n) checks if n equals 4. If true, it returns n; otherwise, it returns 2 * fun(n+1). The main function calls fun(2) and prints the result. The instructor systematically traces the execution flow on a whiteboard to determine the final output value, demonstrating the mechanics of recursion and stack unwinding.

Chapters

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

    The instructor begins the analysis by writing fun(2) on the whiteboard, representing the initial function call from main. He points to the if (n == 4) condition in the code, explaining that since n is 2, the condition is false. This directs execution to the else block, which returns 2 * fun(n+1). He writes return 2 * fun(3) on the board. Next, he traces the call fun(3). Again, n is not 4, so he writes return 2 * fun(4). For the call fun(4), the condition n == 4 is true, so the function returns the value 4. He writes fun(4) = 4 on the side. He then substitutes this value back up the stack: fun(3) becomes 2 * 4 = 8. Finally, fun(2) becomes 2 * 8 = 16. He writes (16) and marks option (C) as correct, crossing out the other choices.

  2. 2:00 – 2:18 02:00-02:18

    The video concludes with the final state of the whiteboard visible. The recursive expansion is complete, showing the hierarchy of calls: fun(2) depends on fun(3), which depends on fun(4). The calculated intermediate values 4, 8, and the final result 16 are clearly written in red ink. The instructor has placed a checkmark next to option (C) 16, confirming the solution. The screen displays the multiple-choice options with the correct answer highlighted, ending the lecture segment.

This lecture effectively teaches the method of tracing recursive code by expanding the call stack and substituting return values. It emphasizes identifying the base case to stop recursion and correctly computing the final result through sequential multiplication.

Loading lesson…