Answer:
Here is c program:
#include<stdio.h>
#include<conio.h>
void main()
{
//Variable declaration
//array to hold 6 values you can change this as needed
float nums[6];
//integer i is for loop variable
int i;
//to hold maximum value
float max=0.0;
//clear screen
clrscr();
//iterate 6 times you can change as per your need
for(i=0;i<6;i++)
{
printf("Enter a number:");
scanf("%f",&nums[i]);
//check if entered value is greater than previous value
//if it is greater then assign it
if(nums[i]>max)
max = nums[i];
}
//print the value
printf("The largest number entered was %f",max);
getch();
}
Explanation:
Answer:
010100000001101000101
Explanation:
When an error occurs in data bits, the SEC code is used to determine where the error took place. 5 check-bits are needed to generate SEC code for 16-bits data word. The check bits are:
C16=0, C8=0, C4=0,C2=0,C1=1
Therefore the SEC code is 010100000001101000101
Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
