Understanding SubNet Mask
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
- CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
- CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
- CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
- CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
- CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
- CS | 08 | Computer Networks: 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
- CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
- CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
- CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
- CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
- GS Paper | 01 | Indian and World Geography: Geography
- GS Paper | 02 | History: History
- GS Paper | 03 | Indian Economy & Social Development: Indian Economy
- GS Paper | 04 | General Science: Biology, Chemistry, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
- GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, अनुक्रम, श्रेणी और संयोजन / Sequences, Series and Combinatorics, मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
- GS Paper | 06 | Indian Polity and Governance: Polity
- GS Paper | 07 | Current Events: समसामयिकी / Current Affairs
- UPLT Live Classes Notes: UPLT Live Classes
- UPLT Full Mock Tests Tier 1:
- UPLT Full Mock Tests Tier 2:
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
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: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.
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.