Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CS 250 > FINAL REVIEW Slides "Weeks 01 through 04" > Flashcards

FINAL REVIEW Slides "Weeks 01 through 04" Flashcards

1
Q

What is professor Adams’ Email

A

gba@purdue.edu

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is software?

A

Description of a computation expressed in a programming language, any necessary data, and documentation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What executes software?

A

An interpreter: A system that directly executes instructions expressed in a programming language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

what are compiled programming languages?

A

high-level programming languages without an interpreter are compiled

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

memorize and look at the diagram of compiling for C (Figure 4.6, slide 21)

A

ok daddy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

which step in the figure passes C language statements from input to output unchanged?

A

preprocessor

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

_____ code is interpreted by a machine

A

object

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Where was the germanium crystal made?

A

Purdue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Today electronic computers are built from _____ elements

A

Silicon (Si)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Basic Capabilities an interpreter should have:

A

-Accept input
-Store values (include the memory function)
-Update / change existing values (variables)
-Compute (perform functions on value(s))
-Create output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Harvard Architecutre:

A

Had two separate memories, one for instruction memory and one for data memory. Also had processor (circuit to carry out computation) and input/output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Von Neumann Architecture:

A

One memory for both program and data, also had processor and I/O. Design was more flexible, and hence, economical, however less secure than Harvard since there was only 1 memory.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How many distinct bands in volatge?

A

2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

4 parts of digital logic signal voltage waveform

A

1) low level 2) rising edge 3) high level 4) falling edge

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

how many wires does a k-bit bit string have?

A

k wires

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

a collection of k wires carrying the k bits of a k bit string

A

bus

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

how many distinct k-bit strings are there?

A

2^k (Product Rule of combinatorics)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Kibi

A

2^10

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Mebi

A

2^20

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Gibi

A

2^30

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Tebi

A

2^40

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

unsigned integer, base 2, weighted positional

A

Add together powers of 2 if they’re “on” (1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

sign magnitude integer representation

A

leftmost bit represents sign: 0 = +, 1 = -, remaining bits are magnitude as usual (However, has + and - 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

two’s complement integers

A

Weighted, but MSB weight is negative:
-2^(n-1), + 2^(n-2), + …, + 2^1, + 2^0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

Given a bit string A, how do you obtain -A using 2’s comp?

A

flip bits and add 1

26
Q

sign extension:

A

drag the bits out to go from 4 bit to 8 bit representation (in 2’s comp)

27
Q

big endian:

A

most significant bye, “Big” byte, comes first (placed in lowest-numbered memory location), in MSB to LSB order

28
Q

Little endian:

A

the reverse of big endian; least significant byte, “little” byte, placed in lowest address followed from remaining bytes in LSB to MSB order

29
Q

True or false: Order of bits within a byte is NEVER changed for big / little endian

A

True

30
Q

what do you need to know to define floating point?

A

Number of bits, sizes of fields within the bit string, encoding used for each field

31
Q

precision:

A

resolution of a representation system
-defined as the minimum difference between any two representations
-precision of 32-bit integers is +/-1

32
Q

range:

A

the bounding number pair (smallest, largest) of a given representation
- for 32-bit unsigned integers range is (0, 2^32 - 1)

33
Q

32 bit IEEE Floating Point Standard 754 has:

A

32 bits:
1 sign bit (31),
8 exponent bits (23-30)
23 bit mantissa (0-22)

34
Q

64 bit IEEE Floating Point Standard 754 has:

A

64 bits:
1 sign bit (63)
11 exponent bits (52 - 62)
52 bit mantissa (0-51)

35
Q

The IEEE 754 representation fields are sign, ____ exponent, and mantissa

A

biased

36
Q

Normalized mantissa has ___ significant digit(s) to the left of the radix point

A

One

37
Q

a k-bit pointer has how many locations in memory?

A

2^k locations

38
Q

how many bits would a register be that’s formed from four 1-bit latches

A

4-bits

39
Q

a decoder is a circuit with:

A

n input wires with voltages to encode a memory address, A, from a set of 2^n memory addresses
2^n output wires, one for each available memory address

40
Q

selects 1 of 2_n k-bit input buses to connect to the k-bit output bus

A

multiplexer, used to read (copy) bits from a memory location

41
Q

connects the k-bit input bus to 1 of the 2^n k-bit output buses

A

demultiplexer, used to write bits into a memory locations

42
Q

transporting a bit string from one of many storage locations to a processor circuit is called a ____

A

fetch

43
Q

clock rate upper bound set by _____

A

worst case circuit propagation delay

44
Q

CPU Time =

A

(Instructions / Program) * (Clock cycles / Instructions) * (seconds / clock cycle) = (seconds / program)

45
Q

True or false: When last instruction is executed, computer keeps running

A

True; need an idle loop or else computer will crash without any instructions

46
Q

what is the process called that starts the fetch / execute cycle?

A

bootstrapping

47
Q

What are the machine instruction fields?

A

Opcode | operands 1, 2, … | Results

48
Q

opcode is…

A

selects ALU result to use, aka what to do

49
Q

operands are…

A

input to ALU, see opcode to determine how many (if any) are needed for that opcode

50
Q

results are…

A

a pointer to a storage location, also optional depending on the opcode used

51
Q

2 choices for machine instruction bit string length:

A

fixed length and variable length

52
Q

variable length machine instruction:

A

concatenate fields with no limitations on number of or sized of the fields

53
Q

fixed length machine instruction:

A

encode all instructions in a fixed number of bytes

54
Q

advantages / disadvantages of variable length machine instruction

A

Adv:
-unlimited capability of ISA, just add bytes
-can select short encodings for commonly occurring instructions to reduce program size
Disadv:
-hard to prevent Marketing from adding to ISA
-instruction decryption is complex: how many bytes to examine, what do they say?
-makes hardware slower

55
Q

advantaged / disadvantages of fixed length machine instruction

A

adv:
-easy to quickly fetch a fixed size object from memory
-instruction decryption is fairly simple
-ISA criteria are largely technical because cannot add byres
Disadv:
-hard to expand ISA

56
Q

True / False: Operands and Result fields drive up instruction length

A

True, 3 memory pointer fields, memory locations are 1 byte in size

57
Q

What do compilers do?

A

Translate HLL to target language

58
Q

Hiding underlying details

A

Abstraction

59
Q

Operation result is greater than max representable value

A

Overflow

60
Q

Result is less than smallest representable value

A

Underflow

61
Q

Set of operations chosen

A

ISA

CS 250 (12 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions