WorksheetsCS250 Lectures (1-2)
Total questions: 73
Worksheet time: 1hrs 13mins
What is BANG?
(a)
Pursuit of many niche courses, each covering a single aspect of the field
(a)
Sequence of steps to accomplish desired objectives
(a)
(a) invented the logarithm, which became the principle of the slide rule (invented circa 1620)
____ _____ designed and built an arithmetic machine in 1642 to add and subtract
(a)
In 1819, (a) designed a machine of gears, shafts, and wheels that could calculate tables of arithmetic numbers such as logarithms
1890 US census, (a) ’s punched card machines tabulated large amounts of data ¤ Jacquard’s loom (1801) was the first place where punched cards were used
Modern computer systems design
Has it origins dating back to (a) as part of work on ENIAC
Modern computer systems design
Breaks up a computing machine into three main subsystems:
¤ The ___ for performing arithmetic operations
¤ The ____ for storage of instructions and data
¤ The ___-____
(a)
At its core, modern computers harnesses the ______ __ _____ in circuits to carry out computations
(a)
______ ______ deal only with voltages, currents, switches, and malleable materials
(a)
Internally the computer does not process _____ ___ _____
(a)
To be processable, data must be represented as
¤ _____ in the machine or
¤ As measurable _____ in the structure of storage media
(a)
Computation complexity
Measured in terms of (a)
Impacts responsiveness and how you can scale
(a)
Systems like Bitcoin, where the currency represents a solution to a problem and reflects the amount of computational work that needs to (and has been) performed
(a)
No _____ that will inspect another ______ and tell us whether it terminates or loops forever
(same word so just type once)
(a)
Even if we stick to logically possible jobs, there are many that cannot be done in a reasonable time — they are (a)
In most cases there are fast algorithms to find an approximate answer
(a)
T o F: If you are not precise in translating the algorithm into program steps, your computation will contain errors
(a)
T o F: The computer amplifies your intelligence because it has its own!
(a)
There is no information without (a)
Arithmetic operations such as add and subtract must be represented as rules for _____ ______
(a)
Proposals to represent decimal digits with 10 distinct voltages were dismissed because of the (a) of the circuits
Binary-coded arithmetic used (a) components than decimalcoded arithmetic
Also, circuits to distinguish two voltage values were much more (a) than circuits to distinguish more than two values
Storage and display could easily be built from available ___- ____ technology
(a)
The decision to abandon decimal arithmetic and use binary codes for everything in the computer
Led to very simple, much more reliable _____ and ____
(a)
The term " (a) " came into standard use as shorthand for “binary digit”
Today no one can think about contemporary computers without thinking about (a) representations
The patterns of zeroes and ones are (a) invented by the designers to describe what their circuits do
Designers invented (a) rules that distinguished valid codes from invalid ones
Although the machine cannot understand what patterns mean
¤ It can (a) allowable patterns from others by applying the syntax rules
The physical structure of computers consists of
¤ ____, which store bit patterns
¤ _____ ____, which compute functions of the data in the registers
(a)
It takes (a) for these logic circuits to propagate signals from their input registers to their output registers
If new inputs are provided before the circuits settle?
The outputs are likely to be misinterpreted by subsequent circuits
Engineers solved this problem by adding (a) to computers.
At each clock tick the output of a logic circuit is stored in its registers
The interval between ticks is long enough to guarantee that the circuit is completely _____ before its output is stored
¤ Computers of the von Neumann architecture cannot function without a _____
(a)
Existence of clocks gives a precise physical interpretation to the “ (a) steps” in the digital realm
For e.g., a “3.8 GHz processor”?
¤ Is one whose clock ticks 3.8 (a) times a second
Every algorithmic step must be (a) before the next step is attempted
Computers are rated by their clock speeds
The machine supports this by guaranteeing each instruction will be correctly finished (a) the next instruction is attempted
(a) are essential to support our notion of computational steps and guarantee that the computer performs them reliably
From the time of Babbage and Lovelace, programmers have realized that the machine must be able to decide which (a) are next
Instructions _____ _____ always follow a linear sequence
(a)
In the von Neumann architecture, the address of the next instruction is stored in a CPU register called the _____ _____
(a)
One common deviation from linearity is to (a) to another instruction at a different memory location, say X
The decision to branch is governed by a (a)
If all our programs were nothing more than decision trees of instruction sequences each selected by if-then-else? ¤ They could never generate computations longer than the number of (a) in the program
The loop allows us to design computations that are much (a) than the size of the program
A (a) is a sequence of instructions that are repeated over and over until a stopping condition is satisfied
A common programming error is a faulty stopping condition that does not exit the loop
That behavior is called an “____ _____”
(a)
____ _____proved that there is no algorithm for inspecting a program to determine if any of its loops is infinite
(a)
There is no algorithm for inspecting a program to determine if any of its loops is infinite
This makes debugging a challenging problem that cannot be (a)
Some programs are built on purpose to (a) forever
(a) is a convenient shortcut
(a) allows us to communicate complex concepts without having to demonstrate them
Every language — whether written, spoken, or expressed in a series of gestures or by banging two rocks together
Is meaning encoded as a set of (a)
Written language is a (a) of symbols
A bit is binary and can hold only one of (a) symbols
A (a) bit cannot convey much information
We need a (a) of bits to represent anything more complex
To make these sequences of bits easier to manage, computers group bits together in sets of eight, called:
(a)
A set of 4-bits is referred to as a
(a)
We typically write (a) using something called decimal placevalue notation
____ ____ means that each position in a written number represents a different order of magnitudemeans that each position in a written number represents a different order of magnitude
(a)
Decimal, or base 10, means that the orders of magnitude are factors of (a)
If the least significant bit (position 0) of a binary integer value contains 1, the number is an (a) number
If the least significant bit contains 0, then the number is (a)
If the least significant n bits of a binary number all contain 0, then the number is evenly (a) by 2^n
If a binary value contains all 1s from bit position 0 up to (but not including) bit position n, and all other bits are 0, then that value is equal to (a) - 1
Shifting all the bits in a number to the (a) by one position multiplies the binary value by 2
Shifting all the bits of an unsigned binary number to the (a) by one position effectively divides that number by 2
In general, for n bits
¤ The total number of unique combinations: ____
¤ The largest possible number is: _____
(a)
