Conditional Statements(Decision Control) in C

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/c-language/control-flow/if-else-statements-basic-advanced-nested-ifelse-structures/asset-conditional-statementsdecision-control-in-c after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture introduces decision control instructions in C programming, contrasting sequential execution with conditional execution. The instructor uses real-life analogies like weather conditions and lockdowns to explain why programs need to make decisions. The core of the lesson focuses on the `if` statement, detailing its syntax, flowchart representation, and the relational operators required to form conditions. Several code examples are worked through, including a simple number check and a discount calculation problem. A critical section addresses common syntax errors, specifically the confusion between assignment (`=`) and equality (`==`) operators, ensuring students understand the logical implications of such mistakes. The lecture emphasizes that while the compiler may not flag these errors, the logic is flawed. The relational operators table is explicitly shown, defining how expressions like `x == y` and `x != y` are evaluated.

Chapters

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

    The instructor begins by explaining that while instructions in a program are executed sequentially by default, serious programming situations often require different sets of instructions based on specific situations. He illustrates this with real-life examples such as "If the weather is fine, then I will go out" and "If there is lock-down, we will not go out." He draws a diagram of sequential instructions and explains that C programs deal with these situations using decision control instructions. He emphasizes that altering actions in the face of changing circumstances is a fundamental need in programming logic. The slide text explicitly states, "Many a times, we want a set of instructions to be executed in one situation, and an entirely different set of instructions to be executed in another situation." He also mentions examples like cricket pitch conditions affecting player selection.

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

    The lecture identifies three major decision-making instructions in C: the `if` statement, the `if-else` statement, and the `switch` statement. The focus shifts to the `if` statement, showing its general form: `if (this condition is true) execute this statement;`. A flowchart is drawn to visualize the logic, featuring a decision diamond with 'T' (True) and 'F' (False) paths. The instructor then introduces relational operators (`==`, `!=`, `<`, `>`, `<=`, `>=`) used to express conditions, displaying a table that defines how each operator is evaluated. He explains that these operators allow us to compare two values to see whether they are equal, unequal, or if one is greater than the other. The table lists expressions like `x == y` and `x != y` with their corresponding truth conditions. The slide text reads "C has three major decision-making instructions".

  3. 5:00 – 10:00 05:00-10:00

    Practical application is demonstrated through code examples. First, a program checks if a number entered is less than 10 using `if (num <= 10)`. Next, a more complex problem is solved: calculating total expenses with a 10% discount if the quantity purchased is more than 1000. The code initializes `int qty, dis = 0;` and `float rate, tot;`. The calculation `tot = (qty * rate) - (qty * rate * dis / 100)` is shown. The instructor also warns about a common pitfall: using assignment `=` instead of equality `==` in conditions, noting that `if (a = 10)` technically works but is logically incorrect. He shows that `if (i == 5)` is the correct syntax for comparison. The slide text highlights the error: "the logic has certainly gone away." The instructor explains that the compiler interprets `if (i == 5)` as a condition check, whereas `if (i = 5)` assigns a value.

  4. 10:00 – 10:27 10:00-10:27

    The session concludes the topic of the `if` statement. A slide appears with the text "Break" and "5 - if-else Statement," signaling the transition to the next major topic in decision control structures. The instructor briefly mentions that the `if` statement is the most basic form of decision making before moving on. The visual cue is the large text "Break" on the screen. This marks the end of the current segment and prepares the viewer for the subsequent lesson on `if-else` logic.

The video provides a comprehensive introduction to decision control in C, moving from the theoretical necessity of branching logic to the practical syntax of the `if` statement. By combining flowcharts, relational operator tables, and multiple code examples ranging from simple checks to discount calculations, the instructor ensures students understand both the structure and common pitfalls of conditional execution. The lesson effectively bridges the gap between abstract logic and concrete C code implementation, preparing students for more complex structures like `if-else`. The detailed explanation of syntax errors ensures that students avoid logical fallacies that might not be caught by the compiler.

Loading lesson…