Introduction to Computer Networks
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- 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)
- 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
- Programming Fundamentals (Technical): C Fundamentals
- Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- OOPs (Technical): Object Oriented Programming (OOPS)
- 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
- SQL (Technical): SQL
- 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
- 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
- Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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
- Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
- Writing Assessment: English Writing Ability
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This video provides a comprehensive overview of a Computer Networks course syllabus. The instructor displays a slide detailing the course structure, which follows the layered approach of the OSI and TCP/IP models. He systematically annotates the slide with red ink to indicate the number of lectures dedicated to each section, ranging from 0-1 to 1-2-3 lectures. The content covers fundamental concepts like packet switching, data link layer functions such as framing and error detection, network layer routing and IP addressing, transport layer flow control, and application layer protocols. The visual annotations serve as a guide for students to understand the scope and depth of each topic.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by introducing the course titled "Computer Networks". He writes "(1-9)" next to the title, suggesting a total of 9 lectures. He writes "(0-1)" next to the first bullet point regarding the concept of layering and switching basics. He underlines "Concept of layering" and "Data link layer", writing "(1-2-3)" next to the latter to indicate a significant portion of the course. He further annotates "Framing" with "(1-2-3)" and draws an arrow next to "Error detection". Next to "Medium Access Control", he writes "(CSMA/CD) /->", highlighting a key protocol. This segment establishes the foundation and covers the Data Link layer. The instructor's handwriting is visible in red ink, making the annotations stand out against the black text.
2:00 – 5:00 02:00-05:00
The lecture progresses to the Network and Transport layers. The instructor underlines "Network Layer" and writes "(1-2-3)" beside it, indicating a heavy focus. He underlines "Routing protocols: shortest path, flooding, distance vector and link state routing", "Fragmentation and IP addressing, IPv4, CIDR notation", and "Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT)". Moving down, he underlines "Transport layer" and writes "(1-1)". He underlines "Flow control and congestion control" and "UDP, TCP, sockets". This segment details the core networking and transport mechanisms essential for data delivery. The underlining emphasizes the importance of these topics for the students.
5:00 – 6:55 05:00-06:55
The final section covers the Application layer. The instructor underlines "Application layer protocols" and writes "(1-1)" next to it. He underlines the specific protocols listed: "DNS, SMTP, HTTP, FTP, Email". This concludes the syllabus overview, highlighting the top layer of the network stack and common application protocols used in daily internet activities. The instructor emphasizes the practical applications of the network layers discussed previously. The red underlines connect the theoretical layers to real-world protocols.
The lecture systematically breaks down the Computer Networks curriculum by layer, providing a clear roadmap for the course. The instructor uses visual annotations to emphasize the weight of each topic, suggesting a heavy focus on the Data Link and Network layers (1-2-3 lectures each) compared to Transport and Application (1 lecture each). The progression moves from the physical transmission concepts (Framing, MAC) to logical addressing and routing (IP, Routing), then to end-to-end communication (TCP/UDP), and finally to user-facing services (DNS, HTTP). This structure mirrors the OSI model, ensuring students understand the hierarchical nature of network communication. The annotations serve as a study guide, indicating which topics require more attention and time. The instructor's gestures and focus on specific lines reinforce the importance of these key areas.

