Answer:
I think the answer would be 60x something but I'm not for sure
Answer:
Fiber-optic cable
Explanation:
Before the cable industry transitioned to fiber-optic cables, for many years, the standard cables used for telephone, cable, and internet communications were coaxial cables. The transition was made possible because the architecture of the fiber-optic cable came with a higher capacity, more extensive bandwidth link. Unlike the coaxial or the twisted pair cable, the fiber-optic is made from glass strands that transmit light signals much quicker and to greater distances. This makes fiber-optic cables the fastest high capacity data transfer link than any other cables to ever exist.
Answer:
1111000
Explanation:
perform the following. write from right to left:
- is the number even? then write down a 0
- is the number odd? then write down a 1 and subtract 1
- divide by 2
- repeat until you reach 0.
So for 120:
120 is even, so write down a 0 and continue with 120/2=60
60 is even, so write down a 0 and continue with 60/2=30
30 is even, so write down a 0 and continue with 30/2=15
15 is odd, so write down a 1 and continue with 14/2=7
7 is odd, so write down a 1 and continue with 6/2=3
3 is odd, so write down a 1 and continue with 2/2=1
1 is odd, so write down a 1 and finish with 0
Answer:
I think a is correct answer.
Answer:
#include <iostream>
using namespace std;
void swap(int *a,int *b){ //function to interchange values of 2 variables
int temp=*a;
*a=*b;
*b=temp;
}
void sort(int queue[],int n)
{
int i,j;
for(i=0;i<n;i++) //to implement bubble sort
{
for(j=0;j<n-i-1;j++)
{
if(queue[j]>queue[j+1])
swap(queue[j],queue[j+1]); //to swap values of these 2 variables
}
}
}
int main()
{
int queue[]={6,4,2,9,5,1};
int n=sizeof(queue)/4; //to find length of array
sort(queue,n);
for(int i=0;i<n;i++)
cout<<queue[i]<<" ";
return 0;
}
OUTPUT :
1 2 4 5 6 9
Explanation:
In the above code, Queue is implemented using an array and then passed to a function sort, so that the queue can be sorted in ascending order. In the sort function, in each pass 2 adjacent values are compared and if lower index value is greater than the higher one they are swapped using a swap function that is created to interchange the values of 2 variables.
