Unary Operator

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/programming-data-structures/c-fundamentals/understanding-operators/asset-unary-operator after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | 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, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces unary operators in C programming, defined as operations acting on a single operand. The instructor presents a comprehensive table listing operators including pre-increment (++x), post-increment (x++), pre-decrement (--x), and post-decrement (x--). Key distinctions are made between pre-operations, which modify the value before use, and post-operations, where the original value is used first. The lesson covers unary plus (+a) and minus (-a), logical NOT (!0 resulting in 1), and bitwise NOT (~n => -(n+1)). A specific example demonstrates that ~5 equals -6 through binary inversion and two's complement logic.

Chapters

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

    The segment begins with a definition of unary operators as single-operand operations. A table is displayed listing C unary operators such as ++x, x++, --x, and x--. The instructor uses red checkmarks to highlight pre-increment and post-increment rows, emphasizing the difference in execution order. Handwritten annotations clarify that pre-operations modify immediately while post-operations use the value then increment, as seen in the text 'Use then a = a+1'. The table also lists unary plus (+a) and minus (-a), logical NOT (!01), establishing the foundational syntax for these operators.

  2. 2:00 – 3:38 02:00-03:38

    The lecture progresses to bitwise NOT (~) and logical NOT operators. The instructor explains that!0 results in 1, demonstrating boolean logic inversion. A detailed derivation shows ~5 equals -6 using the formula ~n => -(n+1). Binary representation is used to visualize this: 5 is shown as 0101, which inverts to 1010. The instructor connects this binary result to the decimal value -6, illustrating two's complement logic. Handwritten notes reinforce the formula and binary conversion steps, ensuring students understand how bitwise negation produces negative results in signed integers.

The video systematically builds understanding of unary operators by first defining them and listing standard examples like increment/decrement. It then distinguishes between pre- and post-execution timing, a critical concept for C programming logic. The lesson culminates in bitwise operations, specifically showing how ~5 results in -6 via binary inversion and the formula -(n+1). This progression from simple arithmetic operators to bitwise logic ensures students grasp both syntax and underlying computational behavior.

Loading lesson…