Q2 - Precedence and Associativity

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/codingautomata-round/programming-in-c/c-by-yash-sir/asset-q2-precedence-and-associativity 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, 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 is a tutorial on solving a C++ programming problem from Puma's Rebl TAC, presented by a coding expert. The instructor first displays a C++ code snippet that defines five integer variables (a=17, b=5, c=6, d=3, e=5) and a complex arithmetic expression within a cout statement. The core of the lesson involves manually evaluating this expression step-by-step, following the standard order of operations (PEMDAS/BODMAS). The instructor breaks down the expression into parts, calculating the modulo operation (a % 6), the division (b / 2), and the multiplication and subtraction within the parentheses (c * d - 5), then combines the results. The final calculation is shown as (17 % 6) - (5 / 2) + ((6 * 3) - 5) / 5, which simplifies to 5 - 2 + 13 / 5, and finally to 3 + 2, resulting in 5. The video concludes with a screen recording of an online C++ compiler where the program is executed, confirming the output is 5.

Chapters

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

    The video begins with a C++ code snippet displayed on a dark background, which includes the standard library and namespace. The main function initializes five integer variables: a=17, b=5, c=6, d=3, and e=5. The core of the code is a cout statement with a complex arithmetic expression: a % 6 - b / 2 + (c * d - 5) / e. The instructor, visible in a circular frame, starts to solve this expression by hand. He first calculates the modulo operation, writing '17 % 6' and then '5' as the result. He then moves to the division, writing '5 / 2' and calculating it as 2. Next, he evaluates the expression within the parentheses, writing '6 * 3 - 5' and calculating it as 18 - 5, which is 13. The expression is now simplified to 5 - 2 + 13 / 5. He then calculates 13 / 5 as 2, and the final expression becomes 5 - 2 + 2, which he simplifies to 3 + 2, resulting in 5. The instructor's handwritten notes on the right side of the screen clearly show each step of the calculation.

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

    The video transitions to a screen recording of an online C++ compiler, showing the same code in a text editor. The instructor runs the program, and the console output appears at the bottom of the screen. The output is '5', which matches the result of the manual calculation. The text 'Program finished with exit code 0' is also visible, confirming the program executed successfully. The instructor's face remains visible in the circular frame on the right, and the video ends with the compiler window showing the correct output.

The video provides a comprehensive walkthrough of a C++ arithmetic expression evaluation problem. It effectively combines a theoretical explanation with a practical verification. The instructor first demonstrates the correct application of operator precedence by breaking down the complex expression into its constituent parts, showing the step-by-step calculation on a whiteboard. This pedagogical approach ensures the viewer understands the logic. The lesson is then validated by running the actual code in a compiler, which produces the same result, reinforcing the correctness of the manual calculation and demonstrating the practical application of the concepts.

Loading lesson…