All categories

3 years ago

How can you ensure you don't go over your budget?

Computers and Technology

1 answer:

Alenkinab [10]3 years ago

3 0

Round up your experience estimates to add a buffer.

You might be interested in

Given an int variable k that has already been declared, use a while loop to print a single line consisting of 88 asterisks. Use

Grace [21]

Answer:

True

Explanation:

The while loop is going to be executed until the condition is false.

Since k is initially equal to 1, the loop will execute 88 times. One asterisk will be printed and k will be incremented by one during each iteration.

When k becomes 89, the condition will be false (89 is not smaller or equal to 88) and the loop will stop.

6 0

2 years ago

Which type of cause and effect organizer would be best for alisha to understand how crude oil becomes gasoline?

sukhopar [10]

The answer is 100% B. Flow chart.

5 0

3 years ago

Read 2 more answers

Need help coding this it uses input and I need to use the words good and morning

Masja [62]

Answer:

x = input ("Enter a word: ")

y = input ("Enter a word: ")

print ( x, " ", y)

Explanation:

This is the simplest way to write it using Python.

6 0

2 years ago

Given the following program: public class MysteryNumbers { public static void main(String[] args) { String one = "two"; String t

enyata [817]

Answer:

Check the explanation

Explanation:

/*Given the following program:

public class MysteryNumbers {

public static void main(String[] args) {

String one = "two";

String two = "three";

String three = "1";

int number = 20;

sentence(one, two, 3);

sentence(two, three, 14);

sentence(three, three, number + 1);

sentence(three, two, 1);

sentence("eight", three, number / 2);

}

public static void sentence(String three, String one, int number) {

System.out.println(one + " times " + three + " = " + (number * 2));

}

}*/

Write the output of each of the following calls.

sentence(one, two, 3); three times two = 6

sentence(two, three, 14); 1 times three = 28

sentence(three, three, number + 1); 1 times 1 = 42

sentence(three, two, 1); three times 1 = 2

sentence("eight", three, number / 2); 1 times eight = 20

7 0

3 years ago

let m be a positive integer with n bit binary representation an-1 an-2 ... a1a0 with an-1=1 what are the smallest and largest va

Ahat [919]

Answer:

Explanation:

From the given information:

$a_{n-1} , a_{n-2}...a_o$ in binary is:

$a_{n-1}\times 2^{n-1} + a_{n-2}}\times 2^{n-2}+ ...+a_o$

So, the largest number posses all $a_{n-1} , a_{n-2}...a_o$ nonzero, however, the smallest number has $a_{n-2} , a_{n-3}...a_o$ all zero.

∴

The largest = 11111. . .1 in n times and the smallest = 1000. . .0 in n -1 times

i.e.

$(11111111...1)_2 = ( 1 \times 2^{n-1} + 1\times 2^{n-2} + ... + 1 )_{10}$

$= \dfrac{1(2^n-1)}{2-1}$

$\mathbf{=2^n -1}$

$(1000...0)_2 = (1 \times 2^{n-1} + 0 \times 2^{n-2} + 0 \times 2^{n-3} + ... + 0)_{10}$

$\mathbf {= 2 ^{n-1}}$

Hence, the smallest value is $\mathbf{2^{n-1}}$ and the largest value is $\mathbf{2^{n}-1}$

3 0

2 years ago