IP ADDRESS AND SUBNET

IP ADDRESS

Ip address is known to be the name or identity by which internet remembers systems, or devices.

IP address is of 2 types one is public IPV4  and private IPV6.

IPV4 is of 32 bit address with total 4 parts each of each 8bits. 

The first the parts of the IP address represents the NETWORK PART and the last part represents the HOST PART. 

An IP address is unique for each device.. and its limited. 

The network part represents the networks address to which it is connected and the host part that is of the device we are using.

 EG: 10.1.34.81.. this is the IP address of my device when i connect in "cloud" internet. so 10.1.34 is the network part where 81 is my host part unique for me. 

10.1.34.116

10.1.34.225

Here, 10.1.34 refers to the network to which it is connected .

81,116,225 refers to the individual systems connected to it.

Each 8 bits have 1+2+4+8+16+32+64+128=255 spaces from 0.

SUBNETS

The IP address also have a part called a subnet part where it is the measure of how many devices can add up in it . 

Subnet : 225.225.225.0

It tells which is the network part and host part.

Eg: 11111111.11111111.11111111.00000000

Here, the first 3 octets are network part and the last octet is host part.

Each subnet has the hosts added to an network is limited 

10.1.34.116/24

The traffic is controlled.

The DNS sees the IP address and searches for its own server where it will be present and sends it..

Comments

Post a Comment

Popular posts from this blog

THE DELIVERY MAN

  The Delivery Man – Python List Operations  Introduction Lists in Python are used to store multiple items in a single variable. They are flexible, allowing us to add, remove, update, and manipulate elements easily. In this task, different list operations are performed to simulate a delivery man's workflow. 1. Creating a list and accessing an item items = ["Notebook", "Pencil", "Eraser", "Ruler", "Marker"] print(items[2]) Approach: Indexing Why: Lists use zero-based indexing, so the third item is accessed using index 2. 2. Adding a new item items.append("Glue Stick") print(items) Approach: append() method Why: It adds an item at the end of the list, which is ideal for adding new deliveries. 3. Inserting an item items.insert(2, "Highlighter") print(items) Approach: insert() method Why: Used when we need to add an item at a specific position instead of the end. 4. Removing an item items.remove("Ruler...
Read more

EC2 LAUNCHING

  EC2 Step 1: Launch EC2 Instance Go to: AWS Console --> EC2 --> Launch Instance Configure: Name : my-web-server AMI : Amazon Linux 2 (easy for beginners) Instance Type : t2.micro (free tier) Step 2: Key Pair Create or select a key pair. Step 3: Network Settings  Allow these: SSH (port 22) --> for login  HTTP (port 80) --> for web access Step 4: Launch Instance Click Launch Instance Step 5: Connect to Instance Use: EC2 --> Connect --> EC2 Instance Connect (easiest) OR via terminal: with this command. for this you have to download the pem files while selecting the key pair.  ssh -i your-key.pem ec2-user@<public-ip> Step 6: Install Web Server For Amazon Linux: sudo yum update -y sudo yum install httpd -y Step 7: Start Web Server sudo systemctl start httpd sudo systemctl enable httpd Step 8: Add a Web Page echo "Hello from EC2" | sudo tee /var/www/html/index.html Step 9: Get Public IP Go to EC2 d...
Read more

SORT A LINKED LIST USING MERGE SORT

  Sort a Linked List using Merge Sort Introduction Sorting a linked list efficiently is a common problem in data structures. Unlike arrays, linked lists do not allow direct access to elements, so algorithms like quicksort are not ideal. Merge Sort is the best choice for linked lists because: It does not require random access It works efficiently with node-based structures Problem Statement Given the head of a linked list: Sort the list in ascending order Return the sorted linked list Example Input: 10 -> 30 -> 20 -> 40 -> 60 -> 50 Output: 10 -> 20 -> 30 -> 40 -> 50 -> 60 Solution Code class Solution: def mergeSort(self, head): if not head or not head.next: return head mid = self.getMiddle(head) next_to_mid = mid.next mid.next = None left = self.mergeSort(head) right = self.mergeSort(next_to_mid) return self.merge(left, right) def getMiddle(self,...
Read more