Technical Questions

Along any transmission path from a given source to a given destination, a group of virtual circuits can be grouped together into what is called path.

IPv6 - Internet Protocol Version 6.

IPv6 addresses have a size of 128 bits.

Internet Protocol Version 6 [IPv6] is the successor to the Internet's first addressing infrastructure, Internet Protocol version 4 (IPv4).

In contrast to IPv4, which defined an IP address as a 32-bit value, IPv6 address have a size of 128 bits. 

It is using a router to answer ARP requests. This will be done when the originating host believes that a destination is local, when in fact is lies beyond router.

DRAVID

When a structure is assigned, passed, or returned, the copying is done monolithically. This means that the copies of any pointer fields will point to the same place as the original. In other words, anything pointed to is not copied. Hence, on changing the name through e2.n it automatically changed e1.n

Virtual channel is normally a connection from one source to one destination, although multicast connections are also permitted. The other name for virtual channel is virtual circuit.

- Process management

- Main memory management

- File management

- I/O system management

- Secondary storage management

- Networking

- Protection system

- Command interpreter system

In Computers ::

A network is a collection of computers, servers, mainframes, network devices, peripherals, or other devices connected to one another to allow the sharing of data.

An excellent example of a network is the Internet, which connects millions of people all over the world. Below is an example image of a home network with multiple computers and other network devices all connected to each other and the Internet.

Ex:: LAN, WAN, MAN, WLAN,...

In Business view::

Networking is defined as the act of making contact and exchanging information with other people, groups and institutions to develop mutually beneficial relationships.

#include<stdio.h>
int main(){

    int a[10],i,n,m,c=0,l,u,mid;

    printf("Enter the size of an array: ");
    scanf("%d",&n);

    printf("Enter the elements in ascending order: ");
    for(i=0;i<n;i++){
         scanf("%d",&a[i]);
    }

    printf("Enter the number to be search: ");
    scanf("%d",&m);

    l=0,u=n-1;
    while(l<=u){
         mid=(l+u)/2;
         if(m==a[mid]){
             c=1;
             break;
         }
         else if(m<a[mid]){
             u=mid-1;
         }
         else
             l=mid+1;
    }
    if(c==0)
         printf("The number is not found.");
    else
         printf("The number is found.");

    return 0;
}

Sample output:
Enter the size of an array: 5
Enter the elements in ascending order: 4 7 8 11 21
Enter the number to be search: 11
The number is found.