ARP-Address Resolution Protocol
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | 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
- Paper-2 | Databases / DBMS & SQL: 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
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, 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, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- 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
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- 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
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces the Address Resolution Protocol (ARP) as a network-layer auxiliary protocol that maps an IP address to a logical-link address. The instructor uses a slide with the title circled in marker, three bullets, and a diagram showing ICMP, IGMP, and IP inside a Network layer box, with an arrow from IP to ARP and then to Link-layer address. The core idea is that an IP address alone cannot move a frame through a link; ARP supplies the required link-layer address to the data-link layer. The second half walks through the ARP exchange: when a host or router needs another node’s link-layer address on its local network, it sends an ARP request packet containing the sender’s and receiver’s IP addresses plus the sender’s link-layer address. Because the sender does not know the receiver’s link-layer address, the query is broadcast over the link. The intended recipient replies with a unicast packet containing its IP and link-layer addresses, sent directly to the node that issued the request. Diagrams show System A and System B on a LAN with labels such as N1 L1, N2 L2, N3 L3, and N4 L4, illustrating that the request asks for the link-layer address of a node with IP address N2 and the reply states that the node’s link-layer address is L2.
Chapters
0:00 – 2:00 00:00-02:00
The opening slide is titled “Address Resolution Protocol (ARP),” with the title hand-circled in marker. Three bullets state that ARP maps an IP address to a logical-link address and that ARP is one of the auxiliary protocols defined in the network layer. A diagram inside a box labeled “Network layer” shows ICMP, IGMP, and IP blocks; an arrow from IP marked “IP address” feeds a blue ARP box and then down to “Link-layer address.” Red hand-drawn circles highlight the title, the underlined words “network layer,” and a looped arrow at the right of the diagram. The instructor emphasizes that an IP address alone cannot move a frame through a link, so ARP passes the resolved link-layer address to the data-link layer.
2:00 – 4:34 02:00-04:34
The instructor explains the ARP request/reply process using a slide with five numbered points and two LAN diagrams. Point 1 reads: “Anytime a host or a router needs to find the link-layer address of another host or router in its network, it sends an ARP request packet.” Point 3 reads: “Because the sender does not know the link-layer address of the receiver, the query is broadcast over the link.” Point 5 reads: “The response packet contains the recipient's IP and link-layer addresses. The packet is unicast directly to the node that sent the request packet.” Diagrams show System A and System B on a LAN with node labels N1 L1, N2 L2, N3 L3, and N4 L4. The request is labeled “Looking for link-layer address of a node with IP address N2,” and the reply is labeled “I am the node and my link-layer address is L2.” The instructor points to the diagrams with a pen, highlighting that “a. ARP request is broadcast” and “b. ARP reply is unicast.”
The lesson centers on one key definition: ARP maps an IP address to a logical-link address. It is positioned as a network-layer auxiliary protocol, shown alongside ICMP and IGMP within the Network layer box. The teaching flow moves from definition to mechanism: first, why ARP is needed (IP alone cannot move a frame through a link), then how it works (broadcast request, unicast reply). The broadcast/unicast distinction is the main conceptual contrast: the request is broadcast because the sender does not know the receiver’s link-layer address, while the reply is unicast directly to the requester. The worked example uses System A and System B on a LAN, with node labels N1 L1 through N4 L4; the request asks for the link-layer address of IP N2, and the reply identifies itself as that node with link-layer address L2. For exam revision, students should remember the ARP packet contents (sender and receiver IP addresses, sender link-layer address), the broadcast nature of the request, and the unicast nature of the reply.

