Notations Of IP Address

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/computer-networks/net-layer-ip-addressing/classful-addr-casting/asset-notations-of-ip-address 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 lecture introduces the two standard notations for representing an IPv4 address: binary notation and dotted-decimal notation. The instructor presents a slide titled “Notations,” explaining that an IPv4 address consists of 32 bits, grouped into four octets (bytes). In binary notation, the address is shown as a continuous 32-bit string, such as “01110101 10010101 00011101 00000010.” To make addresses more compact and readable, dotted-decimal notation expresses each 8-bit octet as a decimal number separated by dots, yielding “117.149.29.2” for the example. The instructor demonstrates the conversion by writing out the decimal equivalents of each binary octet on a whiteboard, reinforcing how the 32-bit binary form maps to the four decimal octets. The lesson emphasizes that both notations represent the same address, with dotted-decimal being the preferred human-readable format.

Chapters

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

    The slide titled “Notations” introduces two ways to display an IPv4 address: binary notation and dotted-decimal notation. The instructor explains that an IPv4 address is 32 bits long, with each octet called a byte. The binary example “01110101 10010101 00011101 00000010” is shown, followed by its dotted-decimal equivalent “117.149.29.2.” The instructor points to the slide and begins writing the conversion of the first octets on a whiteboard, illustrating how binary groups translate to decimal values.

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

    The instructor continues the conversion demonstration, writing out the remaining octets (29 and 2) on the whiteboard to complete “117.149.29.2.” The slide remains visible, showing the binary string and dotted-decimal form side by side. Handwritten annotations on the slide highlight the mapping between each 8-bit binary octet and its decimal counterpart. The instructor uses a pointer to emphasize key terms like “binary notation” and “dotted-decimal notation,” reinforcing that dotted-decimal is used for compactness and readability. A minor discrepancy appears in one screenshot where the binary string shows “01111010” instead of “01110101,” but the decimal result remains consistent.

The core concept is that IPv4 addresses can be represented in two equivalent notations: binary (32 bits) and dotted-decimal (four decimal octets). The lecture uses a single worked example to show the conversion process, making it clear that each 8-bit binary group corresponds to one decimal number. The teaching flow moves from definition (32 bits, four bytes) to example (binary string) to conversion (decimal octets), ending with the standard dotted-decimal format. This approach helps students understand why dotted-decimal is preferred in practice while still recognizing the underlying binary structure. The whiteboard annotations and slide text provide concrete evidence for each step, ensuring the conversion is transparent and reproducible.

Loading lesson…