CSU CS250 Final Exam (ALL QUIZZES AND MIDTERM MATERIAL ONLY) questions with verified answers

CSU CS250 Final Exam (ALL QUIZZES AND MIDTERM MATERIAL
ONLY) questions with verified answers
a bitwise AND operation of two equal length binary representations can be used
to set a particular bit. T/F Ans✓✓✓-True


a direct mapped cache can also be thought of as a zero-way associative cache. T/F
Ans✓✓✓-False


A high-level program can be executed on a target computer without being first
being translated into the machine language of the target computer. T/F
Ans✓✓✓-False


A high-level program can be executed on a target computer without first being
translated into the machine language of the target computer. T/F Ans✓✓✓-False


A stack is only accessible from the top. T/F Ans✓✓✓-True


A system has been configured to have 3GB of main memory. In a byte-
addressable system, how many bits are needed for memory addressing?
Ans✓✓✓-32 bits


A two-tier translation process generally results in generating results in generating
machine code that is more verbose and cumbersome than the code produced by
direct compilation. T/F Ans✓✓✓-True


A typical CPU has thousands of onboard registers on the chip. T/F Ans✓✓✓-False

,All communications in networked systems are based on sending and receiving
messages i.e., there is no shared memory. T/F Ans✓✓✓-True


Although it works well for several classes of problems, dividing up a single
program so that it can be parallelized to make use of multiple CPU's is an
unsolved problem in the general case. T/F Ans✓✓✓-True


An implementation describes what the module does, while abstraction describes
how it does it. T/F Ans✓✓✓-False


An index doesn't affect the contents of the database. T/F Ans✓✓✓-True


An m-bit CPU means that the computer architecture has m-bit registers, a m-bit
address bus, or a m-bit data bus or perhaps ALL three are m-bit. T/F Ans✓✓✓-
True


Any bit can be toggled by XOR-ing it with 0. T/F Ans✓✓✓-False


Any bit in a binary representation can be toggled by XOR-ing it with a 1. T/F
Ans✓✓✓-True


Any boolean function can be represented by a Boolean expression containing only
And, Or, and Not Operation T/F Ans✓✓✓-True


Any Boolean function can be represented by a Boolean expression containing only
And, Or, and Not operators. T/F Ans✓✓✓-True

, Any Boolean function can be represented by a boolean expression containing only
Nand operators T/F Ans✓✓✓-True


Any Boolean function can be represented by a Boolean expression containing only
Nand operators. T/F Ans✓✓✓-True


As a side effect of the instructions execution, the CPU also figures out which
instruction to fetch and execute next. T/F Ans✓✓✓-True


As packets flow through a NAT router, the router modifies the IP address
information in those packets. T/F Ans✓✓✓-True


Assume that a new desktop has been delivered to you. It is not possible to expand
the L1 and L2 caches on this desktop. T/F Ans✓✓✓-True


B-Trees are restricted to fanouts between 2-10. T/F Ans✓✓✓-False


Binary representations (as opposed to decimal) are used in computing systems
because the arithmetic operations need fewer components and distinguishing
between two voltages is much more reliable Ans✓✓✓-True


Binary search assumes that the underlying list (or array) is sorted. T/F Ans✓✓✓-
True


BSTs continue to be efficient even if they end up being extremely unbalanced (for
example, as a sorted linked list). T/F Ans✓✓✓-False