1.27 Bitwise Operators Left and Right Shift

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/python/operators-expressions/bitwise-operators/asset-127-bitwise-operators-left-and-right-shift after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a lecture on bitwise operators in Python, focusing on left and right shift operations. The instructor begins by introducing the topic and then demonstrates the left shift operator using the variable 'a = 10'. He explains that a left shift by 'n' positions is equivalent to multiplying the number by 2 to the power of 'n' (a * 2^n). He provides several examples, showing that a << 1 equals 20, a << 2 equals 40, and so on. The lecture then transitions to the right shift operator, using the variable 'b = 10'. The instructor explains that a right shift by 'n' positions is equivalent to dividing the number by 2 to the power of 'n' (a / 2^n), with integer division. He demonstrates this with examples like b >> 1 equals 5, b >> 2 equals 2, and b >> 3 equals 1. The video concludes with a summary of the concepts.

Chapters

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

    The video starts with a title slide for a lecture on 'Bitwise Operators' with a focus on 'Left and Right Shift'. The instructor, standing in front of a digital whiteboard, begins the lesson by writing 'a = 10' and then proceeds to write a series of Python print statements: 'print(a << 1)', 'print(a << 2)', 'print(a << 3)', and 'print(a << 4)'. He then writes 'Left shift' and explains the concept, writing the formula 'a << n = a * 2^n' on the board. He demonstrates the first example, writing 'print(a << 1) => 10 * 2^1 = 20'. He continues to write out the calculations for the next two examples, showing 'print(a << 2) => 10 * 2^2 = 40' and 'print(a << 3) => 10 * 2^3 = 80'. He then writes the final example, 'print(a << 4) => 10 * 2^4 = 160'. The instructor is actively writing and explaining the concepts throughout this segment.

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

    The instructor transitions to the right shift operator. He erases the previous content and writes 'b = 10' and 'Right shift'. He then writes a series of print statements: 'print(b >> 1)', 'print(b >> 2)', 'print(b >> 3)', and 'print(b >> 4)'. He explains that a right shift is equivalent to division by 2^n, writing the formula 'a >> n = a / 2^n'. He demonstrates the first example, writing 'print(b >> 1) => 10 * 1/2 = 5'. He continues with the next example, writing 'print(b >> 2) => (10 * 1/2) => 5 * 1/2 => 2.5 => 2', noting the integer division. He then writes 'print(b >> 3) => 10 * 1/2^3 => 10/8 => 1'. For the final example, he writes 'print(b >> 4) => 10 * 1/2^4 => 10/16 => 0'. The instructor concludes the lesson by summarizing the concepts and saying 'Thank You'. The video ends with the instructor speaking to the camera.

The lecture provides a clear and structured explanation of bitwise shift operators in Python. It begins with the left shift operator, using a variable 'a = 10' to demonstrate that shifting left by 'n' bits is equivalent to multiplying by 2^n. The instructor uses a step-by-step approach, writing out the calculations for each example. The lesson then logically transitions to the right shift operator, using a similar variable 'b = 10' to show that shifting right by 'n' bits is equivalent to dividing by 2^n, with the result being truncated to an integer. The use of concrete examples and the explicit formula for each operation makes the concepts easy to understand and apply.

Loading lesson…