1.
Simulate a network having two communication nodes using Cisco Packet
   Tracer.
Realtime:
Simulation of the Message:
Ping between network:
   2. Simulate a network having 4 communication nodes with one hub.
       Realtime:
   Simulation of Message:
Ping to the receiver:
3. Simulate a network with 2 subnets using 2 switches, one router and 8
   nodes.
   Realtime:
   Simulation of Message:
   Ping to Receiver:
4. Simulate a network using Star/BusTopology using Cisco Packet Tracer.
1. Simulate a network to connect 10 nodes using bus topology.
Topology:
Simulation:
Ping:
6. Simulate a network using Ring Topology using Cisco Packet Tracer.
 1.Simulate a network to connect 8 nodes using ring topology.
Topology:
Simulation:
Ping:
7. Simulate a network using 6 communication nodes using Mesh Topology.
  Realtime:
  Simulation of Message:
  Ping to Receiver:
   8.Create a DHCP server using Cisco Packet Tracer.
      1.Create a DHCP server to connect 5 nodes in a network.
Topology:
Server Config:
Sender ip assigned by DHCP:
Receiver ip assigned by DHCP:
Ip Address of remaining PC:
Packet Simulation:
Ping:
   9. Implement Intra domain and Inter domain routing protocol using Cisco
   Packet Tracer.
      1.Configure RIP Routing using 2 routers in Cisco Packet Tracer.
Topology:
RIP Configuration:
Simulation:
Ping:
10.Implement Bit Stuffing using Turbo C++ Editor.
   Code:
   // C++ program for the above approach
   #include <bits/stdc++.h>
   #include <iostream>
   using namespace std;
   // Function for bit stuffing
   void bitStuffing(int N, int arr[])
   {
   // Stores the stuffed array
   int brr[30];
  // Variables to traverse arrays
   int i, j, k;
   i = 0;
   j = 0;
  // Loop to traverse in the range [0, N)
   while (i < N) {
  // If the current bit is a set bit
   if (arr[i] == 1) {
   // Stores the count of consecutive ones
   int count = 1;
  // Insert into array brr[]
  brr[j] = arr[i];
    // Loop to check for
    // next 5 bits
    for (k = i + 1;
    arr[k] == 1 && k < N && count < 5; k++) {
    j++;
    brr[j] = arr[k];
    count++;
    // If 5 consecutive set bits
    // are found insert a 0 bit
    if (count == 5) {
    j++;
    brr[j] = 0;
    }
    i = k;
    }
    }
// Otherwise insert arr[i] into
// the array brr[]
else {
brr[j] = arr[i];
}
i++;
j++;
}
// Print Answer
for (i = 0; i < j; i++)
count << brr[i];
}
// Driver code
int main()
{
int N = 6;
int arr[] = { 1, 1, 1, 1, 1, 1 };
bitStuffing(N, arr);
return 0;
}
// This code is contributed by target_2
Output: