RARP - Reverse Address Resolution Protocol

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/networking/net-layer-ipv4-proto/net-layer-protocols/asset-rarp-reverse-address-resolution-protocol after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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

  1. 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. 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.

Loading lesson…