Addition & Logical Operator Tricky Questions
Duration: 10 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends
- Artificial Intelligence: Artificial Intelligence
- Unit Test - Professional Knowledge:
- Full Length Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This video is a C programming lecture focusing on multiple-choice questions (MCQs) related to function calls and operator precedence. The instructor begins by introducing the topic of C programming MCQs. The first problem presented is a code snippet with two functions, f1 and f2, which print "Jetha" and "Babita" respectively, and are called within the main function. The question asks for the output, and the instructor explains that the order of evaluation of function arguments is not defined by the C standard, making the output compiler-dependent. The second problem involves a complex conditional expression `if (c > b > a)` with variables a=10, b=20, c=30. The instructor demonstrates that this expression is evaluated as `(c > b) > a`, which simplifies to `1 > 10`, resulting in a false value. The video uses a digital blackboard for explanations and includes a live coding session in an online IDE to verify the results. The lecture concludes with a brief outro from the instructor.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title slide for a C Programming MCQs lecture by Yash Jain. The instructor, visible in a small window, introduces the topic. The first problem is presented on a digital blackboard, showing a C code snippet with two functions, `int f1()` and `int f2()`, which print "Jetha" and "Babita" respectively. The main function calls both functions and adds their return values. The question asks for the output, with options including "Jetha Babita", "Babita Jetha", "Compiler Dependent", and "Compiler Error". The instructor begins to explain the concept of function call evaluation order.
2:00 – 5:00 02:00-05:00
The instructor analyzes the first MCQ. He explains that the C standard does not specify the order in which function arguments are evaluated, so the compiler can choose to evaluate `f1()` before `f2()` or vice versa. This means the output could be "Jetha Babita" or "Babita Jetha" depending on the compiler. Therefore, the correct answer is "Compiler Dependent". He uses a digital pen to draw a flowchart on the blackboard, illustrating the two possible execution paths. He then transitions to the next problem, which involves a conditional statement `if (c > b > a)`.
5:00 – 9:52 05:00-09:52
The second MCQ is presented, with the code `int a = 10, b = 20, c = 30; if (c > b > a)`. The instructor explains that the expression `c > b > a` is not a chained comparison but is evaluated as `(c > b) > a`. He calculates `c > b` as `30 > 20`, which is true (1), and then `1 > a` as `1 > 10`, which is false (0). Therefore, the condition is false, and the program prints "FALSE". He demonstrates this by running the code in an online IDE, which confirms the output is "FALSE". The video ends with the instructor concluding the lesson.
The lecture systematically covers two fundamental C programming concepts: the undefined order of argument evaluation in function calls and the left-to-right associativity of the relational operators. The first example highlights a common source of non-portable code, where the output depends on the compiler's implementation. The second example demonstrates a critical pitfall in C, where a seemingly logical chained comparison like `c > b > a` is incorrectly evaluated as a sequence of binary operations, leading to a logical error. The instructor effectively uses a digital blackboard for theory and a live coding environment for practical verification, reinforcing the concepts for the student.

