The following operations are performed on an empty stack:

PUSH(A) PUSH(B) POP() PUSH(C) PUSH(D) POP()

What value is on top of the stack?

Group of answer choices

C

A

B

No value. The stack is empty.

Flag this Question

Question 21 pts

The following operations are performed on an empty queue:

ENQUEUE(A) ENQUEUE(B) DEQUEUE() ENQUEUE(C)

What value is in front of the queue?

Group of answer choices

A

B

C

No value. The queue is empty.

Flag this Question

Question 31 pts

The following operations are performed on an empty stack:

PUSH(A) PUSH(B) POP() PUSH(C) POP() POP()

What value is on top of the stack?

Group of answer choices

No value. The stack is empty.

A

B

C

Flag this Question

Question 41 pts

The following operations are performed on an empty stack:

PUSH(A) PUSH(B) POP() PUSH(C) POP()

What value is on top of the stack?

Group of answer choices

A

B

C

No value. The stack is empty.

Flag this Question

Question 51 pts

The following operations are performed on an empty queue:

ENQUEUE(A) DEQUEUE() ENQUEUE(B) DEQUEUE() ENQUEUE(C)

What value is in front of the queue?

Group of answer choices

B

A

C

No value. The queue is empty.

Flag this Question

Question 61 pts

A(n) _______________ is a program that translates and executes the statements of a high-level language in sequence (i.e. one at a time.)

Flag this Question

Question 71 pts

A(n) _______________ is a program that translates all of the statements of a high-level language into an assembly program. The input is a program in a high-level language. The output is a program in a low-level language.

Flag this Question

Question 81 pts

Given a list of 35 numbers, what is the most look-ups a linear search would require to search the list for a given number? In other words, in the worst case, how many numbers would linear search need to look at?

Your answer should be in decimal.

Flag this Question

Question 91 pts

Given a list of 35 numbers, what is the least look-ups a linear search would require to search the list for a given number? In other words, in the best case, how many numbers would linear search need to look at?

Your answer should be in decimal.

Flag this Question

Question 101 pts

How would we express the decimal number 43.8125 in binary?

Your answer should not have any extra characters in it. Just the 0's and 1's and the decimal point.

Flag this Question

Question 111 pts

How would we express the binary number 1010.0101 in decimal?

Your answer should not have any extra characters in it. Just the digits and the decimal point.

Flag this Question

Question 121 pts

What is the largest number we can represent in 2's complement if we have 9 bits?

Write your answer in decimal.

Flag this Question

Question 131 pts

What is the smallest number we can represent in 2's complement if we have 9 bits?

Write your answer in decimal.

Flag this Question

Question 141 pts

How would we express the binary number 1110.00001 in decimal?

Your answer should not have any extra characters in it. Just the digits and the decimal point.

Flag this Question

Question 151 pts

If we wanted to represent the decimal number 0.0009765625 as a binary floating point number with an 8-bit mantissa, what would the mantissa be?

Your answer should be some combination of exactly 8 0's or 1's. No spaces or other extra characters (if Canvas adds commas, you can ignore that and submit your answer.)

Flag this Question

Question 161 pts

If we wanted to represent the decimal number 1,000,000 as a binary floating point number with an 8-bit mantissa, what would the mantissa be?

Your answer should be some combination of exactly 8 0's or 1's. No spaces or other extra characters (if Canvas adds commas, you can ignore that and submit your answer.)

Flag this Question

Question 171 pts

If we wanted to represent the decimal number 0.0009765625 as a binary floating point number with an 8-bit mantissa, what would the exponent be?

Your answer should be in 8-bit 2's complement with no extra spaces or characters.

Flag this Question

Question 181 pts

Consider the following short Python program:

a=5 b=4 c=2*(a+b)

We call b a(n) __________ .

Flag this Question

Question 191 pts

Consider the following short Python program:

a=5 b=4 c=2*(a+b)

We call 2 a(n) __________ .

Flag this Question

Question 201 pts

Consider the following short Python program:

a=5 b=4 c=2*(a+b)

We call + a(n) __________ .

Flag this Question

Question 211 pts

Consider the following short Python program:

a=5 b=4 c=2*(a+b)

We call (a+b) a(n) __________ .

Flag this Question

Question 221 pts

Given a list of 35 numbers, what is the most lookups a binary search would require to search the list for a given number? In other words, in the worst case, how many numbers would binary search need to look at?

Your answer should be in decimal.