Skip to main content

OSI Reference Model


1.Physical Layer

Physical layer coordinates the require electronic components or functions to Transmit data between computer systems.
             1.Physical character sticks
              2.Bit Rate

2.Data Link Layer

Data Link Layer Convert the Physical Binary Data Form Into Frames. A Combination of Bit Rate is Called Frame.

3.Network Layer

It is Responsible For Source To Designation Delivery Of Pockets. Which Contains Logical Address To Identify The sender and Receiver.

4.Transport Layer

Its Transport The Data Into Network.

5.Session Layer
Its establish,maintain and synchronous between communicate systems.
Its Manage The Transmission Data Time Between Two or More Systems.

6.Presentation Layer

It is Convert Transport Data Into Application Data. Interface Between Transport Layer And Application Layer.

VigLink badge
7.Application Layer

7 Th Layer Of OSI(Open System InterFace) model. Which Provide The Data To User Interface.

Comments

Popular posts from this blog

Run Length Encoding | Programming In Java

  Given a string, Your task is to complete the function   encode   that returns the   run-length encoded  string for the given string. eg  if the input string is “wwwwaaadexxxxxx”, then the function should return “w4a3d1e1x6″. You are required to complete the function  encode  that takes only one argument the string which is to be encoded and returns the encoded string. Example 1: Input: str = aaaabbbccc Output: a4b3c3 Explanation: a repeated 4 times consecutively b 3 times, c also 3 times. Example 2: Input: str = abbbcdddd Output: a1b3c1d4 Your Task: Complete the function  encode()  which takes a character array as an input parameter and returns the encoded string. Expected Time Complexity:  O(N), N = length of a given string. Expected Auxiliary Space:  O(1) Constraints: 1<=length of str<=100 Solution: import java.util.*;   class RLEncoding {    public static void main(String[] args)  ...

Linked List - Data Structure Basic With Example Java

//linked list /*     Linked List is a Linear Data Structure.      Drawback of Array Is continues Block Of Memory. Linked Is Used To Allocate the Different Memory Location. Each node Contains Data And Pointer. Header Is Used To Denote The First Node Of Linked List. Tail Is Used To Denote the Last Node of The Linked List. 1.Singly Linked List Each Node as Data And pointer To The Next Node. [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]; 2.doubly Linked List Each Node as Data And pointer To The Next Node and prev Node. [ data(header) | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | pointer of next]<->[pointer to prev|data | null]; 3.Circle Linked List [ data(header) | pointer of next]->[ data | pointer of next]->[ data | pointer of next]->[ data | null]-->header */ class...