Stack Practice questions

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-BASIC-COMPUTER-INSTRUCTOR/paper-2-data-structures/stack/recursion-stack/asset-stack-practice-questions-4949 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 analyzes two C functions, `fun` and `fun2`, to determine the mathematical operation performed by `fun2`. The instructor first identifies that `fun(x, y)` implements multiplication (`x * y`). He then traces the execution of `fun2(a, b)` using specific inputs (a=2, b=3) to find the output. By expanding the recursive calls, he calculates the result as 8. Finally, he generalizes the recursive structure of `fun2` to show that it computes `a` raised to the power of `b` (exponentiation), confirming option (C) as the correct answer.

Chapters

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

    The instructor introduces the problem by displaying two C functions on the screen: `fun(int x, int y)` and `fun2(int a, int b)`. He begins by analyzing `fun`, noting that it recursively adds `x` to itself `y` times, effectively implementing multiplication (`x * y`). He then sets up a trace for `fun2` using the specific input values `a=2` and `b=3`. He writes down the initial recursive expansion on the whiteboard: `fun2(2, 3)` calls `fun(2, fun2(2, 2))`. He continues to expand the inner call, writing `fun(2, fun(2, fun2(2, 1)))` and then `fun(2, fun(2, fun(2, fun2(2, 0))))`. This establishes the recursive structure needed to evaluate the function.

  2. 2:00 – 5:00 02:00-05:00

    The instructor proceeds to evaluate the nested function calls starting from the base case. He identifies that `fun2(2, 0)` returns `1` based on the base condition `if (b == 0) return 1;`. Substituting this back, the expression becomes `fun(2, fun(2, fun(2, 1)))`. He evaluates the innermost `fun(2, 1)` as `2 * 1 = 2`. The expression simplifies to `fun(2, fun(2, 2))`. Next, he evaluates `fun(2, 2)` as `2 * 2 = 4`. The expression further simplifies to `fun(2, 4)`. Finally, he calculates `fun(2, 4)` as `2 * 4 = 8`. He writes `2^3 = 8` on the board, noting that the result matches the power operation.

  3. 5:00 – 9:52 05:00-09:52

    To confirm the general behavior, the instructor analyzes the recursive step of `fun2` algebraically. He observes that `fun2(a, b)` returns `fun(a, fun2(a, b-1))`. Since `fun(x, y)` is multiplication, this translates to `a * fun2(a, b-1)`. This recurrence relation, `f(a, b) = a * f(a, b-1)` with base case `f(a, 0) = 1`, is the standard definition of exponentiation `a^b`. He compares this with the given options: (A) `a*b`, (B) `a+a*b`, (C) `a^b`, and (D) `b^a`. Although option (B) also yields 8 for inputs (2,3), the recursive structure `a * fun2(...)` clearly matches exponentiation, not addition. He circles option (C) `a^b` as the correct answer, concluding that `fun2` computes `a` raised to the power of `b`.

The lecture demonstrates a method for analyzing recursive C functions by first simplifying helper functions and then tracing specific examples to find a pattern. By identifying `fun` as multiplication and tracing `fun2(2, 3)` to get 8, the instructor establishes a numerical pattern. He then generalizes the recursive step `fun(a, fun2(a, b-1))` into the algebraic form `a * fun2(a, b-1)`, which definitively proves that `fun2` implements exponentiation `a^b`.

Loading lesson…