Bitwise Operator

Duration: 7 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/programming-fundamentals/c-fundamentals/understanding-operators/asset-bitwise-operator after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces bitwise operators in C, emphasizing their operation on individual bits rather than whole numbers. The instructor systematically covers the Bitwise AND (&), OR (|), XOR (^), NOT (~), Left Shift (<<), and Right Shift (>>) operators. Key concepts include binary representation as the foundation for understanding these operations, where decimal numbers are converted to binary to visualize bit-level manipulation. The teaching flow progresses from logical operators (AND, OR) to exclusive operations (XOR), unary inversion (NOT), and finally arithmetic-like shifts. The instructor uses handwritten notes on slides to demonstrate step-by-step calculations, such as converting decimal 5 (101) and 3 (011) to binary, then performing AND operations to yield 1. Shift operators are explained as efficient methods for multiplication and division by powers of two, with examples like 27 >> 3 resulting in 3. The session reinforces that bitwise operations require understanding binary logic, where AND requires both bits to be 1 ('totally true'), OR requires at least one bit to be 1, and XOR outputs 1 only if bits differ.

Chapters

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

    The instructor introduces bitwise operators in C, starting with the Bitwise AND (&) and OR (|) operations. On-screen text displays a table listing operators: & Bitwise AND, | Bitwise OR, ^ Bitwise XOR, ~ Bitwise NOT, << Left shift, and >> Right shift. The instructor writes binary representations for decimal 5 (101) and 3 (011) to demonstrate the AND operation, showing that 5 & 3 results in 001 (decimal 1). The teaching cue emphasizes that AND requires 'totally true' bits, meaning both must be 1. The instructor then calculates the OR operation (5 | 3), showing that since at least one bit is 1 in each position, the result is 111 (decimal 7). Handwritten notes visually break down the bit-by-bit logic, reinforcing that OR outputs 1 if any input is 1.

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

    The lecture transitions to shift operators, specifically the Right Shift (>>) and Left Shift (<<). The instructor explains that shifting right divides a number by powers of two, while shifting left multiplies it. A key example involves calculating 5 >> 1, where the binary 101 shifts right to become 10 (decimal 2). The instructor further demonstrates this with a more complex example: 27 >> 3. Binary conversion of 27 is written out, and shifting right by three positions yields the result 3. The on-screen text highlights '5 >> 1' and later '27 >> 3 = 3'. The instructor circles the shift operator section to draw attention, reinforcing that these operations are equivalent to division and multiplication by powers of two. The visual breakdown shows how bits move, with the rightmost bits being discarded during a right shift.

  3. 5:00 – 7:19 05:00-07:19

    The final segment consolidates the understanding of shift operators with additional examples. The instructor calculates 4 << 1, showing that shifting the binary 0100 left by one position results in 1000 (decimal 8), though the slide text initially shows '4 << 1 = 16' which may indicate a correction or different example context. The instructor verifies the result of 27 >> 3 = 3 by writing out the binary conversion and shifting process. The teaching cue focuses on using binary notation to visualize bit movement, ensuring students grasp that left shift multiplies by 2 and right shift divides by 2. The summary table on screen remains visible, listing all operators with their symbols and brief descriptions like 'exclusive OR' for XOR. The instructor concludes by reinforcing that bitwise operations are fundamental for low-level programming tasks like masking, setting, clearing, and toggling bits.

The lecture provides a structured introduction to bitwise operators in C, prioritizing binary visualization as the core learning tool. The progression from logical AND/OR to shift operators builds a foundation for understanding how computers manipulate data at the bit level. Key takeaways include the equivalence of left shift to multiplication by powers of two and right shift to division, as well as the logical conditions for AND ('totally true') and OR ('at least one true'). The instructor's use of handwritten calculations alongside printed slides ensures clarity in complex operations like 27 >> 3. Students should note that while the slide text may show multiple examples, the instructor's verbal explanation and handwritten notes provide the definitive step-by-step logic. This session is essential for mastering low-level data manipulation, which is critical in systems programming and embedded development.

Loading lesson…