RARP - Reverse Address Resolution Protocol
Duration: 3 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 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation 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 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 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and 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 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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 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 | DataBase Management System/DBMS: 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
- Paper 2 | 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces the Reverse Address Resolution Protocol (RARP), explaining how a diskless machine that knows only its physical hardware address can discover its logical IP address. The instructor presents a slide defining RARP as the protocol that finds the logical address for a machine knowing only its physical address. The teaching flow moves from conceptual motivation—hosts and routers are assigned unique logical IP addresses independent of physical hardware, and normally the IP is read from a disk configuration file—to the special case where a diskless machine boots from ROM and must obtain its IP via RARP. The second half of the video focuses on a two-part diagram illustrating the request/reply exchange: part (a) shows the RARP request being broadcast on the local network, with a yellow callout stating “My physical address is A4:6E:A5:57:82:36. I am looking for my IP address,” and part (b) shows the RARP reply being sent as a unicast from the server back to the host, with the callout “Your IP address is 141.14.56.21.” The instructor emphasizes that the requesting machine runs a RARP client while the responding machine runs a RARP server, and uses gestures to highlight the host icon and the broadcast/unicast distinction. The lesson is concise, centered on one slide set with a supporting diagram.
Chapters
0:00 – 2:00 00:00-02:00
The instructor presents a slide titled “RARP” defining the Reverse Address Resolution Protocol as finding the logical address for a machine that knows only its physical address. On-screen bullets explain that each host or router is assigned one or more logical (IP) addresses unique and independent of the physical hardware address, that an IP is usually read from a disk configuration file, but that a diskless machine boots from ROM and can only get its physical address by reading its NIC. The instructor gestures toward the slide to emphasize the relationship between physical and logical addresses, setting up why RARP is needed for diskless booting.
2:00 – 3:28 02:00-03:28
The slide shifts to the RARP exchange with two bullets stating that a RARP request is broadcast on the local network and that the requesting machine runs a RARP client while the responder runs a RARP server. Diagram “a. RARP request is broadcast” shows a Host sending a Request toward a RARP server, with a yellow note reading “My physical address is A4:6E:A5:57:82:36. I am looking for my IP address.” Diagram “b. RARP reply is unicast” shows a Reply arrow from the server back to the Host, with the note “Your IP address is 141.14.56.21.” The instructor enters, draws an oval around the Host icon, and points to it with a pen, reinforcing the client/server roles and the broadcast request versus unicast reply.
The core concept is that RARP reverses the usual ARP direction: given a known physical (MAC) address, it discovers the corresponding logical IP address. The lecture first motivates this by contrasting normal disk-based IP configuration with a diskless machine that boots from ROM and can only read its NIC’s physical address. It then demonstrates the protocol operation through a two-part diagram: the client broadcasts a request containing its physical address, and a RARP server on the local network replies with the mapped IP address using unicast. Key takeaways for revision are: (1) RARP maps physical to logical address; (2) the request is broadcast, while the reply is unicast; (3) the requester runs a RARP client and the responder runs a RARP server. The concrete example uses physical address A4:6E:A5:57:82:36 and IP 141.14.56.21, which students should recall as the canonical illustration of the exchange.

