Test 1 Study Guide Flashcards

Pass the bloody test.

1
Q

Boolean Operation: AND

A

Both inputs need to be true to be true (1+1=1, 1+0=0, 0+1=0, 0+0=0)

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

Boolean Operation: OR

A

Any input is be true to be true (1+1=1, 1+0=1, 0+1=1, 0+0=0)

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

Boolean Operation: XOR

A

ONLY 1 input is true to be true (1+1=0, 1+0=1, 0+1=1, 0+0=0)

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

Boolean Operation: NOT

A

Opposite of the input (1=0, 0=1)

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

Boolean Operation: NAND

A

Perform AND, NOT the output (1+1 = 1 = 0, 1+0 = 0 = 1, 0+1 = 0 = 1, 0+0 = 0 = 1)

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

Boolean Operation: NOR

A

Perform OR, NOT the output (1+1 = 1 = 0, 1+0 = 1 = 0, 0+1 = 1 = 0, 0+0 = 0 = 1)

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

Two’s Complement

A

Store negative numbers in binary.

NOT all bits, add 1

10000001 = 01111110 + 1 = 01111111

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

Hex Numbers

A

Base 16 number system.

Always starts with “0x”

0 => F
0 => 15

Example: 0xEE = 14 + 14*16 = 238

To Binary: 238 in binary = 11101110

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

Bit

A

Single binary piece of data 1 or 0

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

Boolean Operation

A

A logic operation to taking two inputs and giving a single signal output

AND, OR, XOR, NOR, NAND

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

Address

A

A location in memory.

Typically represented in hex.

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

Track

A

On a hard drive, a continuous line of data stored on the disk

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

Sector

A

The piewedge!

A single section of data on a track

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

Cylinder

A

On a hard drive.

The set of all tracks that have the same size in a set of platters

Imagine using a smaller cookie cutter on a stack o pancakes, the line that it makes through all pancakes is the cylinder.

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

Seek Time

A

The average amount of time it takes for a hard drive to move to a place on the disk

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

Latency Time

A

The total amount of time it takes for a disk read to occur

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

Transfer Rate

A

The speed at which data is transmitted from a hard drive

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

ASCII

A

The old way of encoding characters in binary or hex. Just English is available.

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

Pixel

A

A single dot of visual data on a screen

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

JPEG

A

Picture encoding format

21
Q

Unicode

A

The new way of encoding characters in binary or hex. Many languages supported.

22
Q

Flash memory

A

Type of mass storage. Non volatile (it doesn’t need an electrical charge to keep the data preserved).

USB-sticks are a common form of flash memory.

23
Q

op-code

A

Operation Code

Determines the type of instruction to be performed

ADD, SUBTRACT, MOVE, COPY, RIGHT SHIFT, LEFT SHIFT, ROTATE, etc.

24
Q

Machine Language

A

A set of OP-Codes and their formats that determine the possible instructions a machine (or computer) can execute (VOLE the example in the book is a machine language)

25
Q

Register

A

A CPU Memory Location used by machine languages for (not to be confused with RAM) calculations.

26
Q

Masking

A

The process of using binary operations to extract\isolate a specific part of a set of binary data (typically XOR or AND)

Example:

Get the middle two bytes of the following data:

11111111

Apply AND Mask of 00011000 to get only the two middle bits:

11110111 AND 00011000 = 00010000

27
Q

Bus

A

The pipe or pathway over which data is transferred between two computer components. Typically has a “bit width” (like 64bit, 128bit, etc.)

28
Q

Pipelining

A

The practice of running the next instruction through a computer component while the current one is still processing.

Imagine a process that takes 4 steps or cycles to complete, and you have 2 instructions to do.

The first instruction is fed in and the process starts.
At the end of the 1st cycle, the 1st instruction is on the 2nd step.
The second instruction is fed in and the process continues.
At the end of the 2nd cycle, the 1st instruction is on the 3rd step and the 2nd instruction is one the 2nd step.

This continues until both instructions are done, which would take just 5 cycles to complete instead of 8 because the instructions were “pipelined”

29
Q

Clock

A

The controller of the CPU, sets the pace and rhythm of the CPU.

Like a metronome.

Measured in hertz or “Hz”

30
Q

RISC

A

Reduced Instruction Set Computer

Has smaller set of instructions that lets it process in less cycles than ones with more instructions.

31
Q

Cache

A

Type of On-CPU memory that is very fast.

Typically has “levels” 1-3.

Allows for programs to be stored (cached) locally on the CPU instead of retrieving all instructions from RAM.

32
Q

bps

A

Bits per second

A measure of data rate.

33
Q

multi-core

A

A type of CPU with multiple processors or cores.

Allows multiple instructions to be processed in parallel.

34
Q

bandwidth

A

The maximum data rate of a given component

35
Q

ROM

A

Read Only Memory

A type of non-volatile memory that cannot be re-written once initially written.

Commercial CDs\DVDs\Blu-Rays are considered ROMs.

36
Q

firmware

A

Embedded ROM of a device.

Typically stores the base level functionality of a device.

Most consumer electronics have firmware. TVs\Gaming Consoles, etc.

37
Q

User Interface

A

The input\output of a program that conveys information to a user or takes instructions from them.

Examples include: command line, visual (windows, web), audio (voice control like alexa\google assistant)

38
Q

Virtual Memory

A

Using mass storage as a extension of RAM for when RAM cannot hold any more data.

39
Q

Deadlock

A

When two or processes are waiting on one another to complete a process or relinquish access to data in order to proceed.

Due to the interdependency, none of the processes can proceed and they come a halt.

40
Q

Privilege Levels

A

Gates access to direct control of data\machine\device control\access.

Typically 4 levels

Application is the least at Level 3
Kernel is the most at Level 0
Drivers are in between at Levels 1 and 2

41
Q

boot loader

A

Loads OS into main memory, executes after BIOS performs hardware checks.

42
Q

interrupt

A

input signal to processor that informs of an urgent event thats need immediate processing.

Saves state
Executes interrupt handler
Resumes execution of previous process

43
Q

multitasking

A

The ability for an OS to run multiple programs\processes simultaneously.

44
Q

multiprogramming

A

A rudimentary way for a single core CPU to run two or more programs simultaneously.

Typically uses interrupts to constantly process parts the programs one after another.

45
Q

time sharing

A

virtual multiprogramming approach

Multiple users share a single CPUs time as if they are programs themselves.

46
Q

interactive processing

A

Type of user session where one runs commands or programs directly which are executed immediately.

Essentially all end user OS’ are interactive (Windows, MacOS, etc.)

47
Q

program counter

A

A register in a CPU that contains the address (location) of the instruction being executed at the current time.

48
Q

status word

A

A register that contains the current status of a CPU at any given moment.