CIDR Practice Question_

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/computer-networks/net-layer-ip-addressing/cidr-vlsm/asset-cidr-practice-question-4750 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.

The video is a tutorial on subnetting using Classless Inter-Domain Routing (CIDR). The instructor starts with a specific problem: dividing the network 40.30.20.10/25 into two subnets. He demonstrates the process by converting the IP address to binary, identifying the network and host portions, and borrowing bits to create the subnets. The lecture concludes with a detailed breakdown of the resulting subnets, including their network addresses, ranges, and CIDR notation. The visual aids, including binary conversions and range calculations, help clarify the abstract concepts of subnetting.

Chapters

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

    The instructor introduces the problem statement: 'Consider the network having IP Address 40.30.20.10/25 Divide this network into two subnets.' He draws a circle to visualize the network and writes the IP address 40.30.20.10 /25 on the board. He begins converting the IP address octets into binary, writing 00101000 for 40, 00011110 for 30, and 00010100 for 20. He explains that the /25 indicates the first 25 bits are the network ID. He underlines the network portion and the host portion to clarify the boundary.

  2. 2:00 – 5:00 02:00-05:00

    The instructor focuses on the fourth octet, converting 10 to binary 00001010. He explains that to divide the network into two subnets, one bit must be borrowed from the host portion, changing the prefix from /25 to /26. He writes 00 and 10 (representing the subnet bits) to illustrate the split. He calculates the new network addresses: 40.30.20.0/26 and 40.30.20.128/26. He details the total number of IP addresses (2^6 = 64) and the usable hosts (64 - 2 = 62). He lists the range of IP addresses for each subnet, specifically mentioning the first and last addresses. He writes down the CIDR representation for both resulting subnets.

  3. 5:00 – 5:11 05:00-05:11

    The final slide displays the complete solution. It shows two columns labeled '1st Subnet' and '2nd Subnet'. The 1st Subnet is 40.30.20.0/26 with a range of 40.30.20.0 to 40.30.20.63. The 2nd Subnet is 40.30.20.128/26 with a range of 40.30.20.128 to 40.30.20.191. The slide also lists the total number of IP addresses, first/last addresses, and CIDR representation for both subnets. It visually connects the binary values to the decimal ranges.

The lesson effectively demonstrates the practical application of CIDR subnetting. By starting with a specific IP and prefix, the instructor guides the viewer through the binary conversion and bit-borrowing process required to create subnets. The final summary slide reinforces the key calculations, such as determining the number of hosts and the specific IP ranges, providing a clear reference for solving similar subnetting problems. The step-by-step approach ensures that students can follow the logic from the initial problem statement to the final calculated subnets.

Loading lesson…