Answer:
Iteration
Explanation:
The insertion sort is based on repetition of comparing one data array (or element in a list) with the others at its left to reorganize it, normally following a size criteria (from small to big or the other way around).
At each iteration, the algorithm takes one element and compares it one by one to the others until it fit the specified criteria. Later on, it creates a space, moving the other elements, to insert it. Later, it goes to the next element and the iteration repeats all the way through. It has some advantages over other sorting algorithms because it is easy to deploy and program it in many different languages, but at the same time it can be terribly slow when sorting large amount of data.
Answer: HTTP GET
Explanation: There are many HTTP(Hypertext Transfer protocol) requests sent to the server from the client .The page that gets request while the hyperlink page is clicked by the client, opens a HTTP GET page that belongs to the Internet protocol's(IP)suite by server. It is a process for the revival of the data from a particular server. The data does not get effected during the process of the retrieval.
Answer:
a. This is an instance of overfitting.
Explanation:
In data modeling and machine learning practice, data modeling begins with model training whereby the training data is used to train and fit a prediction model. When a trained model performs well on training data and has low accuracy on the test data, then we say say the model is overfitting. This means that the model is memorizing rather Than learning and hence, model fits the data too well, hence, making the model unable to perform well on the test or validation set. A model which underfits will fail to perform well on both the training and validation set.
A computer that passes the Turing test might show that has the ability to exhibit intelligence similar to, or indistinguishable from that of a human.
Answer: Program for bit stuffing in C
#include<stdio.h>
int main()
{
int i=0,count=0;
char data[50];
printf("Enter the Bits: ");
scanf("%s",data); //entering the bits ie. 0,1
printf("Data Bits Before Bit Stuffing:%s",databits);
printf("\nData Bits After Bit stuffing :");
for(i=0; i<strlen(data); i++)
{
if(data[i]=='1')
count++;
else
count=0;
printf("%c",data[i]);
if(count==4)
{
printf("0");
count=0;
}
}
return 0;
}
Explanation:
bit stuffing is the insertion of non-information bits during transmission of frames between sender and receiver. In the above program we are stuffing 0 bit after 4 consecutive 1's. So to count the number of 1's we have used a count variable. We have used a char array to store the data bits . We use a for loop to iterate through the data bits to stuff a 0 after 4 consecutive 1's.
