Answer:
// This program is written in C++
// Comments are used for explanatory purpose
// Program starts here
#include<iostream.h>
#include<stdlib.h>
int main()
{
// Declare variables
int num, selectno;
string status;
randomize();
//Generate random number;
num=rand()%10000;
// Prompt to guess a number
cout<<"You have only 10 tries\nTake a guess: ";
int tries = 0;
while (tries != 10)
{
cin>>selectno;
if(selectno == num){
cout<<"You passed at the "<<count+1<<" attempt";
tries = 10;
}
else
{
cout<<"You failed. Take another guess\n You have "<<10 - count + 1 <<" attempts";
}
tries++;
if(tries >= 10)
{
break;
}
}
return 0;
}
Answer:
a.
Explanation:
Two bytes have 2 times 8 bits is 16 bits.
Max value that can be expressed is 2¹⁶-1 = 65535
Available options are:
A. Technical champions
B. Engaged filmmakers
C. Business partners
D. Compliance champions
Answer:
Technical champions
Explanation:
Given that a "Technical Champion" is someone whose responsibility is to introduce and perform the role of enabling the use of technology, development of skills across the organization, and strengthen communication between Information Technology and the staff or employees.
Hence, in this case, considering the job descriptions described in the question above, these individuals would best be described as TECHNICAL CHAMPIONS
I'm pretty sure the answer is b
Answer:
O(n²)
Explanation:
The worse case time complexity of insertion sort using binary search for positioning of data would be O(n²).
This is due to the fact that there are quite a number of series of swapping operations that are needed to handle each insertion.
