Left Shift & Right Shift Operators (Trick)

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/codingautomata-round/c-programming-by-yash-sir/c-language-mcqs/asset-left-shift-right-shift-operators-trick after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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 Security, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video is a lecture on C programming, specifically focusing on shift operators. The instructor begins by introducing the topic of shift operators, which are divided into left and right shift operations. The core concept explained is that a right shift by 'n' bits is equivalent to integer division by 2^n, and a left shift by 'n' bits is equivalent to multiplication by 2^n. The lecture uses a step-by-step approach, starting with the binary representation of the number 8 (1000), and demonstrating how a right shift by 1 bit (8 >> 1) results in 4 (100), and a right shift by 2 bits (8 >> 2) results in 2 (10). The same logic is applied to a left shift, showing that 3 << 1 equals 6 and 3 << 2 equals 12. The video concludes by summarizing the mathematical relationship: a >> b = a / 2^b and a << b = a * 2^b, and connects this to the concept of programming division.

Chapters

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

    The video starts with a title slide for a C Programming MCQs lecture by Yash Jain, featuring a glowing keyboard. It then transitions to a presentation slide with a large golden 'C' and a diagram of C operators. The instructor begins the lesson by writing 'Shift Operators' on a digital blackboard, introducing the two types: 'left shift' and 'right shift'. He explains that to understand the shift operators, one must first convert the number into binary, which is written as 'bits convert it into binary' on the board.

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

    The instructor demonstrates the right shift operator using the number 8. He writes '8 >> 1' and shows the binary representation of 8 (1000). He then visually shifts the bits one place to the right, resulting in 0100, which is 4 in decimal. He explains this is equivalent to dividing 8 by 2^1. He repeats the process for '8 >> 2', showing the result is 2, which is 8 divided by 2^2. The instructor writes 'divide by 2^n' to reinforce the concept. He then begins to discuss the left shift operator, writing 'left shift' on the board.

  3. 5:00 – 9:53 05:00-09:53

    The lecture continues with the left shift operator. The instructor uses the number 3 as an example, writing '3 << 1' and showing the binary of 3 (0011) being shifted left by one bit to become 0110, which is 6. He then shows '3 << 2' resulting in 12. He explains that a left shift by 'n' bits is equivalent to multiplying by 2^n. The instructor then summarizes the general formulas: 'a >> b = a / 2^b' and 'a << b = a * 2^b'. He also writes 'programming division' to link the concept to a common programming task. The video ends with the instructor standing in front of a screen with the 'KG' logo.

The video provides a clear and structured explanation of C programming's shift operators. It effectively uses a step-by-step, visual approach on a digital blackboard to teach the fundamental concepts. The instructor first establishes the need to work with binary numbers, then demonstrates the right shift operator by showing how it performs integer division by powers of two. This is followed by a parallel demonstration of the left shift operator, which is shown to be equivalent to multiplication by powers of two. The synthesis of these two operations into the general formulas 'a >> b = a / 2^b' and 'a << b = a * 2^b' provides a powerful and efficient method for performing these arithmetic operations in C, which is a key takeaway for students.

Loading lesson…