-
Course Overview
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
No items in this section -
Description
What you’ll Learn:
Concepts and fundamentals of data communication and computer networks.
Explore the inter-working of various layers of OSI.
Issues and challenges of protocols design while delving into TCP/IP protocol suite.
Assess the strengths and weaknesses of various routing algorithms.
Learning the OSI layers and their Layer Protocols.
This course provides the concepts of data communication at physical layer and compares ISO - OSI model with TCP/IP model. It provides the knowledge of networking protocols at data link layer. Learn the designing of the network using IP addressing and subnetting / supernetting schemes. Also, we will walk through various routing algorithms, their applications and other properties. Exploring the layer protocols lastly would be cherishing!
Join in to learn Computer Networks, equally important from the academic as well as real-world knowledge.
Modules Covered:
Introduction to Networking
Physical Layer
Data Link Layer
Network Layer
Transport Layer
Application Layer -
Introduction to Computer Networks
- 1.1 Introduction to Computer Networks
- 1.2 Network Topologies
- 1.3 Network Connecting Devices
- 1.4 Connection-Oriented vs Connection-Less Communication
- 1.5 ISO-OSI Reference Model
- 1.6 TCP-IP Reference Model
- 1.7 OSI vs TCP-IP Model Comparision
- 1.8 Network Classification LAN, MAN, WAN
- 1.9 Virtual Lan’s (VLAN)
-
Physical Layer
-
Data Link layer
- 3.1 Framing and it’s Methods
- 3.2 Error Detection and its Methods
- 3.3 Hamming Code
- 3.4 Cyclic Redundancy Check Part [01]
- 3.4 Cyclic Redundancy Check Part [02]
- 3.6 Parity Checking and Checksum Error Detection
- 3.7 Flow Control: Stop and Wait and Sliding Window Protocol
- 3.8 Go Back- N ARQ System
- 3.9 SDLC protocol
- 3.10 HDLC protocol
- 3.11 Carrier Sense Multiple Access-Collision Detection Procedure (CSMA-CD)
-
Network Layer
-
[Notes] Introduction To Networking
-
[Notes] Physical Layer
-
[Notes] Data Link Layer
-
[Notes] Network Layer
-
[Notes] Transport Layer
-
[Notes] Application Layer
-
Computer Network Important Questions
-
[Video Notes] Computer Network Notes
-
Computer Network Viva Questions
4.4 Routing Algorithms Part 01 (Static) Shortest Path Algo Dijkstra’s
4.4 Routing Algorithms Part 01 (Static) Shortest Path Algo Dijkstra’s
A routing algorithm is a procedure that lays down the route or path to transfer data packets from the source to the destination. They help in directing Internet traffic efficiently. After a data packet leaves its source, it can choose among the many different paths to reach its destination. Well simply explained, an algorithm that is used for finding the shortest distance, or path, from starting node to target node in a weighted graph is known as Dijkstra’s Algorithm. This algorithm makes a tree of the shortest path from the starting node, the source, to all other nodes (points) in the graph.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placement-preparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!
