Conditional Statements(Decision Control) in C

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-3-c-programming-data-structures/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. About the course: About the Course
  2. Mathematical Aptitude: Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Time and Work, Mensuration and Geometry, Simple Interest and Compound Interest, Speed Time and Distance, Age Problems, Mixture and Alligation, Algebra, Powers and Exponents (Surds and Indices), Pipe and Cistern, Trigonometry, Statistics, Data Interpretation, Arithmetic
  3. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Analogy, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Seating Arrangements, Syllogisms, Venn Diagram, Puzzle Solving (Puzzles), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Calendar, Clock
  4. General Knowledge: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, GK- Current Affairs, Static General Knowledge
  5. Art of Teaching: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Classroom Management & Communication, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement, Professional Development & Ethics, Policies, Acts & Contemporary Issues, Curriculum & School Environment, Guidance, Counselling & Mental Health, Inclusive Education & Special Needs, Micro-Teaching & Teaching Skills, Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: 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
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…