Technical Questions

#include "dos.h"

main()

{

    Char far *scr = ( char far *) 0xB8000000;

    Char *seg, *off;

    Seg = (char *) FP_SEG ( scr );

    Off = ( char *) FP_OFF ( scr );

}

In 8086 Carry flag, Parity flag, Ausiliary carry flag, Zero flag, Overflow flag, Trace flag, Interrupt flag, Direction flag, and Sing flag.

C: \SAMPLE.EXE

There are two IP address assigned to each device on a Wi-Fi network.

An Internal (Private) and an External (Public) IP address.

Internal IP address is used for communication between Your computer and a smartphone or whatever devices that are connected to that Wifi network. This is unique for each. If they are same the system cannot differentiate between each device.

While, the External IP address is that visible to the the internet - the websites, the internet connected Apps so on. By default, Routers with NAT (all routers today have it) assign same Public IP address to all devices under its network.

It does not have the features like

1. ability to support multiple processors


2. virtual storage


3. source level debugging

#include
#define MAX 50

void mergeSort(int arr[],int low,int mid,int high);
void partition(int arr[],int low,int high);

int main(){
  
    int merge[MAX],i,n;

    printf("Enter the total number of elements: ");
    scanf("%d",&n);

    printf("Enter the elements which to be sort: ");
    for(i=0;i<n;i++){
         scanf("%d",&merge[i]);
    }

    partition(merge,0,n-1);

    printf("After merge sorting elements are: ");
    for(i=0;i<n;i++){
         printf("%d ",merge[i]);
    }

   return 0;
}

void partition(int arr[],int low,int high){

    int mid;

    if(low<high){
         mid=(low+high)/2;
         partition(arr,low,mid);
         partition(arr,mid+1,high);
         mergeSort(arr,low,mid,high);
    }
}

void mergeSort(int arr[],int low,int mid,int high){

    int i,m,k,l,temp[MAX];

    l=low;
    i=low;
    m=mid+1;

    while((l<=mid)&&(m<=high)){

         if(arr[l]<=arr[m]){
             temp[i]=arr[l];
             l++;
         }
         else{
             temp[i]=arr[m];
             m++;
         }
         i++;
    }

    if(l>mid){
         for(k=m;k<=high;k++){
             temp[i]=arr[k];
             i++;
         }
    }
    else{
         for(k=l;k<=mid;k++){
             temp[i]=arr[k];
             i++;
         }
    }
  
    for(k=low;k<=high;k++){
         arr[k]=temp[k];
    }
}


Sample output:

Enter the total number of elements: 5
Enter the elements which to be sort: 2 5 0 9 1
After merge sorting elements are: 0 1 2 5 9

It is a fault tolerance disk driver for Windows NT.