Addition & Logical Operator Tricky Questions

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/codingautomata-round/c-programming-by-yash-sir/c-language-mcqs/asset-addition-logical-operator-tricky-questions 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.

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

  1. 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. 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)`.

  3. 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.

Loading lesson…