Understanding SubNet Mask

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/computer-networks/net-layer-ip-addressing/subnetting-flsm-design/asset-understanding-subnet-mask after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Recovery, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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
  10. 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. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
  15. Paper 2 - Full-length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces subnet masks as 32-bit numbers used to identify the network and host portions of an IP address during subnetting. The instructor defines a subnet mask as a sequence of 1s followed by 0s, where the 1s represent the network ID and subnet ID, while the 0s represent the host ID. Default subnet masks for Class A (255.0.0.0), Class B (255.255.0.0), and Class C (255.255.255.0) are presented on the slide. The lesson then transitions to a practical example involving the network 200.1.2.0, which is divided into four subnets. Using a whiteboard quadrant diagram, the instructor demonstrates borrowing two bits from the host ID to create four subnets, resulting in a new subnet mask of 255.255.255.192. The calculation shows that with 6 remaining host bits, each subnet supports 64 - 2 = 62 usable hosts. The broadcast address for the first subnet is identified as 200.1.2.63, though the board also shows 200.1.2.177 in later frames, likely representing a different subnet's broadcast or a calculation step. The video concludes by reinforcing the structure of subnet masks and their role in packet delivery.

Chapters

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

    The instructor presents a slide titled 'Subnet Masks,' defining the mask as a 32-bit number consisting of consecutive 1s followed by 0s. The slide explicitly states that the 1s represent the 'Network ID part along with the subnet ID' and the 0s represent the 'host ID part.' Default masks are listed on-screen: Class A = 255.0.0.0, Class B = 255.255.0.0, and Class C = 255.255.255.0. The instructor points to the title and explains that subnetting solves the problem of identifying which subnet an incoming packet must be delivered to.

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

    The lesson shifts to a whiteboard demonstration using the network 200.1.2.0, which is to be divided into four subnets. The instructor draws a large circle divided into four quadrants to visualize the network partition. On the board, binary representations are written under the IP octets, and two bits are borrowed from the host ID to form the subnet ID. The instructor writes the new subnet mask as 255.255.255.192 and calculates the number of hosts per subnet using the formula 64 - 2 = 62, based on the remaining 6 host bits. The broadcast address 200.1.2.177 is also written on the board during this segment.

  3. 5:00 – 6:23 05:00-06:23

    The instructor continues the whiteboard analysis, highlighting the borrowed bits to show how they create four distinct subnets. The binary values are written directly under the IP address octets, with circles and arrows indicating the subnet ID portion. The video transitions back to a summary slide titled 'Subnet Masks,' reiterating that the mask is a 32-bit sequence of 1s followed by 0s. The slide reinforces that the 1s identify the network and subnet portions, while the 0s identify the host portion, concluding the explanation of how subnet masks facilitate packet delivery in subdivided networks.

The lecture progresses from theoretical definition to practical application. It begins by establishing the structural rules of subnet masks (1s for network/subnet, 0s for host) and provides the standard default values for Class A, B, and C networks. The core teaching moment involves a worked example where the network 200.1.2.0 is subnetted into four parts. By borrowing two bits from the host field, the instructor demonstrates how to derive a new subnet mask (255.255.255.192) and calculate the resulting host capacity (62 hosts per subnet). The use of a quadrant diagram serves as a key visual aid to map the binary bit-borrowing process to the logical division of the network space. This approach helps students connect abstract binary manipulation with concrete IP address ranges and broadcast addresses.

Loading lesson…