1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
icang [17]
3 years ago
9

Give a big-O estimate for the number of comparisons used by the algorithm that determines the number of 1s in a bit string of le

ngth n by examining each bit of the string to determine whether it is a 1 bit.
Computers and Technology
2 answers:
larisa [96]3 years ago
7 0
The answer is "n". 
Algorithms are considered to be process or a bunch or rules that is to be followed in computing or calculating. This is used to solve operational problems especially by a computer. Algorithms perform data processing, calculation<span>, </span><span>or/and </span>automated reasoning<span> activities. </span><span>

</span>
Illusion [34]3 years ago
3 0
The notation would be O (n-1) because there would be no need to compare with the first bit however this notation is most commonly noted as O (n) but the first is also technically correct
You might be interested in
The top-down approach is an appropriate strategy for most
puteri [66]

Answer:

true

Explanation:

The Top-down approach is an approach to a problem that focuses on the big picture first before moving down into the specifics of the topic/problem. Therefore based on the information provided within the question it can be said that the statement being made is completely true. Since the interviewer using this approach starts with a broad topic and later goes into the details, it does allow them to be accustomed to the topic first.

8 0
3 years ago
What does hdtv stand for
Gnesinka [82]
High Definition Television
8 0
3 years ago
Read 2 more answers
1. Build and test D-type Flip-Flop using a built-in SR flip-flop.
GaryK [48]

Answer:

The attached files contain the realization of a D flip-flop from an RS flip-flop. It also contains the truth tables for both kinds of flip-flops

Explanation:

An SR flip flop is like a light switch. Set turns it 'on' and reset turns it 'off'

A D type flip-flop is a clocked flip-flop which has two stable states. A D type flip-flop operates with a delay in input by one clock cycle.

D type flip-flops are easily constructed from an SR flip-flop by simply connecting an inverter between the S and the R inputs so that the input to the inverter is connected to the S input and the output of the inverter is connected to the R input.

8 0
3 years ago
Which element is located on the top left of the Word screen?
victus00 [196]
The <span>element located on the top left of the Word screen is the Quick Access Toolbar.  </span>On the quick access toolbar, you can find some of the common functions that you will need to use on a regular basis, it contains commands that are used most often, for example Redo, Undo and Save etc.
7 0
3 years ago
Using the scenario below, answer the following questions:
4vir4ik [10]

Answer:

Here is code in java.

import java.util.*;

class Main

{

public static void main (String[] args) throws java.lang.Exception

{

   try{

         boolean flag=false;

         int total_mile=0;

         double avg_mile;

       // part 1, create and initialize array

       int inp[]={2,5,9,11,13,17,20,22,24,26};

       

       System.out.print("miles ran per week: ");

       // print the miles per week of train

       for(int x=0;x<10;x++)

       {

       System.out.print(inp[x]+" ");

       }

        System.out.println();

       //part 2, print the value of index 2 in the list

       System.out.println("value at index 2: "+inp[2]+" miles");

       //part 3, find length of array

       System.out.println("list length: "+inp.length);

     

       // part 4, calculate total mile and average

       for(int y=0;y<10;y++)

       {

       total_mile=total_mile+inp[y];

       }

       System.out.println("total miles ran: "+total_mile+" miles");

       

       avg_mile=total_mile/10.0;

       System.out.println("average no of miles ran= "+avg_mile+" miles");

       

     // part 5, check 4 exist in the list or not

       for(int k=0;k<10;k++)

       {

       if(inp[k]==4)

       {

       flag=true;

       break;

           }

       }

           if(flag)

           System.out.println("4 exist in the list.");

           else

            System.out.println("4 doesn't exists in the list.");  

       

   }catch(Exception ex){

       return;}

}

}

Explanation:

Create and initialize array with list value equals to 2 and maximum value 26. Print the miles of each week.Then find the value of miles at index 2 in the list.Next find the length of the array and print it.Calculate total miles ran of 10 weeks.Then calculate the average miles by dividing the total with 10. In the array, check 4 exist or not.

Output:

miles ran per week: 2 5 9 11 13 17 20 22 24 26                                                                            

value at index 2: 9 miles                                                                                                  

list length: 10                                                                                                            

total miles ran: 149 miles                                                                                                

average no of miles ran= 14.9 miles                                                                                        

4 doesn't exists

3 0
3 years ago
Other questions:
  • How can i become an expert in computer and technology?
    15·2 answers
  • Which type of NAC agent will be used during the posture assessment before allowing access to the VPN users?
    9·1 answer
  • Which information purpose uses video from a security camera?
    15·1 answer
  • Given that n refers to a positive int use a while loop to compute the sum of the cubes of the first n counting numbers, and asso
    12·1 answer
  • What is the best way to use copyrighted material?
    14·2 answers
  • Choose the best collection for each situation.
    8·1 answer
  • 1k bits equals to how many bits
    12·1 answer
  • I ate five M&amp;Ms: red, green, green, red and yellow. Only these three colors are possible. I assume that p(yellow)=3p(green)
    9·1 answer
  • The disk you inserted was not readable by this computer
    11·1 answer
  • What type of databases is not limited by the data’s physical location?
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!