Comp Sci - Topic 2 and 6

studied byStudied by 10 people
0.0(0)
Get a hint
Hint

What is true color

1 / 76

flashcard set

Earn XP

Description and Tags

Merge of content from both Resource Management and Computer Architecture

77 Terms

1

What is true color

Maximizing the 24 slots of hex bits available

New cards
2

(11010110) base 2 → hexadecimal

D6

New cards
3

1001101 (base 2) → base 16

4D

New cards
4

11001 (base 2) → decimal

25

New cards
5

ALU

Arithmetic Logic Unit, used for handling arithmetic operations and basic input/output logic operations

New cards
6

ASCII

A character set which involves all Latin letters

New cards
7

Batch processing

Programs are grouped together based on dependencies then executed sequentially

New cards
8

Pros and Cons of interrupt

Less resource intensive but less optimal because of Latency

New cards
9

Pros and Cons of polling

Optimal behavior but resource intensive

New cards
10

Pros of Multi-Threading

Faster, efficient in relation to using a single cpu/single core system

New cards
11

Broad Types of Secondary Storage

Direct access [HDD/SSID] and Sequential access

New cards
12

Burst Time

CPU time occupied by process without waiting for input/output

New cards
13

Cache

Holds the information from the RAM that is most actively used and accessed most frequently. Most relevant types of cache rn are L1 and L2. 

L1 is placed on the CPU and L2 is placed between the 10 and 20

New cards
14

CIR

Current Instruction Register: Stores the instruction currently being decoded

New cards
15

Client

the person/institution funding the product

New cards
16

Compaction

a process where the memory manager rearranges the memory space to create larger blocks of contiguous memory. Excessive compaction can lead to checkerboaring

New cards
17

Converting 89 (base 10) to its equivalent Base 2 representation

01011001

New cards
18

Convert 101101 (base 2) to its equivalent BASE 16 representation

2D

New cards
19

Convert 75 (base 10) into hexadecimal

4F

New cards
20

CU

Control Unit, it’s what retrieves the instructions from the 10 and handles its execution

New cards
21

D-RAM

Dynamic Ram:

  • Cheaper

  • Requires constant refreshing to keep data useable

  • Data leaks

  • Memory capacity»

  • HL [DDR, double data rate, data is transferred at the rise and fall of the clock]

New cards
22

Deadlock

When two or more processes are blocked, needing to access shared resources in a specific order

New cards
23

decode

The instruction goes from the MDR to the CIR
CU decodes the instruction, sees whether or not it can pass
If it’s passable CU sends a decoded version to the ALU

New cards
24

Define CPU

The part of the computer that performs instructions based on input and output

New cards
25

Define Virtual Memory

It hides the complexities of functions. It’s the process of moving out idle applications from 10 to the 20 (temporarily) to make space for incoming applications. It’s returned to primary memory as needed and stored in units called pages.

New cards
26

Difference between ROM and RAM

ROM cannot be written to, RAM can
ROM holds the Basic [Input/Output] System, RAM holds the programs running and data used
ROM is much smaller than RAM
ROM is non-volatile, RAM is volatile

New cards
27

DRAM constantly leaks, so it requires constant?

refreshing

New cards
28

Excessive paging leads to

thrashing

New cards
29

Excessive swapping leads to

Fragmentation

New cards
30

Execute

ALU performs arithmetic or logical operation as instructed. The latest result is stored in the accumulator

New cards
31

Fetch

  • Program Counter (PC) sends address of the next instruction to Memory Address Register

  • Memory Address Bus (MAB) sends this address to the RAM

  • The memory unit uses the address to locate the instruction in RAM.

  • The instruction is fetched from RAM and placed on the Memory Data Bus (MDB).

  • The MDR captures the fetched instruction.

New cards
32

Hex

A numerical notation using base 16

New cards
33

How to convert Binary to Hex?

Make it the capacity of a byte (8 bits long), split it into 2, then use the table for conversion. 

New cards
34

How to convert Decimal into Binary

Divide by two, note 1 for each odd number and note 0 for each even number. from bottom to top put together the string of binary.  

New cards
35

How to convert Decimal into Hex

Convert to binary, then turn the binary into byte form and break it in half

New cards
36

How to convert Hex into Binary?

Each Hex number seperately, find each letter/number equivalent on the table, put them together

New cards
37

Interrupt

When the periphreal device issues an error/interrupt signal to the processor to signify change in status

New cards
38

Lossy Compression

Files will lose quality when it is compressed

New cards
39

MAC address

Standing for Media Access Control Address, it's a unqiue 12-character alphanumeric attribute that is used to identify individual electronic devices on a network. It's built in and cannot be removed (anymore)

New cards
40

MAR

Memory Address Register:

Stores the memory address from which data will be fetched

New cards
41

MDR

Memory Data Register: Holds the data fetched from during the cycle

New cards
42

Memory Leak

When an application is quit but the allocated memory is still being used

New cards
43

Memory Segmentation

Occurs in place of paging, when there isn’t a present block. Storage is dynamic but execessive swapping can lead to fragmentation. Also has cons such as:

  • Physical wear and tear

  • Less predictability

  • Non-contiguous

New cards
44

Multi-access

Allows for multiple users to use the same client [disk partition → uses authentication methods to identify users]

New cards
45

Multi-Level Queue [Without Feedback]

- Assigned priority and dependencies
- Children rely on parents to execute their tasks 
- Because this version has no feedback, it will run without giving errors and can give indecipherable outputs

New cards
46

Multi-processing

Computer system has more than one core, so run across multiple cores

New cards
47

Multi-threading

A program is written in threads that can be executed in parallel

New cards
48

Multi-programming

every program is split into multiple tasks and these tasks are split into multiple cores

New cards
49

Cons of multi-threading

Threads can’t be dependent on the same resource - leads to deadlock

New cards
50

Paging [in virtual memory]

The transfer of data between primary and secondary memory, done in specific amounts at a time (pages, ex:- 20mB)

New cards
51

Parts of the CPU

ACC
ALU
CU
CIR
MDR
MDB
MAR
MAB
RAM

New cards
52

Peak theoretical bandwidth

achieved only under ideal conditions:
- no heat
- no obstruction
- no virtual memories
- no interrupts

New cards
53

Polling

Processor continuously (ie present frequency) checks the peripheral devices on their status

New cards
54

Processor Speed

Million instructions per second (MIPS)

New cards
55

Purpose of MAC address and NIC

NIC is responsible for the client connection to the WAN

New cards
56

Represent 78 (base 10) in its equivalent (base 16) format

4E

New cards
57

ROM

Non-volatile primary memory

New cards
58

Round Robin

CPU allocates / runs every job in a predetermined time slice, so basically splits the work of all the available into the same portions of tasks and does it at the same time. Ex. 4ms for all tasks, so it started with task 1, even if it's too much or not enough time. 

New cards
59

Run Length Encoding

A method of compression that looks for repeating patterns and encodes them into one item of data of a specific length

New cards
60

Run Time

The time taken, alongside fetching/waiting and executing

New cards
61

S-RAM

Static RAM:

  • Does not leak

  • Super fast

  • Very expensive (Needs more transistors per byte)

  • Used usually for cache [which stores more frequently used applications]

    • L1 <- inside CPU

    • L2 <- between CPU and primary memory

New cards
62

Spool

Sequence of print jobs

New cards
63

Sustained memory bandwidth

Average bandwidth achieved across extraneous / all confounding variables when the CPU runs

New cards
64

Task Scheduling Algorithms

- First come first serve
- Shortest job first
- Round robin
- Multi-Level Feedback Queue
- Multi-Level Queue

New cards
65

The secondary memory and CPU are connected. True or False

False

New cards
66

Three states of a job in the CPU

Wait → Ready → Execute

New cards
67

Two types of compression algorithms

Lossy compression and lossless compression

New cards
68

Types of bandwidth

Peak theoretical bandwidth and sustained memory bandwidth

New cards
69

Unicode

An extension of ASCII that adds other languages support

New cards
70

What does core mean?

CPU or system

New cards
71

What does Unicode use to extend it’s predecessor?

It combines different letters to create new, longer ones. Goes to UTF-8, UTF-16, UTF-32

New cards
72

What is direct access (secondary memory)?

Data can be retrieved with indexed values

New cards
73

What is sequential access [secondary memory]

Data can only be retrieved by reading all data that was sequentially stored up until that point

New cards
74

What is the O/S responsible for, with regards to the IP and MAC

it's responsible for the IP and MAC addressing related to the client, whenever a connection/session is established

New cards
75

Where is the MAC address found?

The 12-digit hexadecimal code is found on a network interface card.

New cards
76

Real-time processing

Data processing performed on-the-fly in which the generated data influences the actual process taking place. For example” aircraft control

New cards
77

Online processing

Data processing performed by a single processor through the use of equipment that it controls. For example: airline reservation

New cards

Explore top notes

note Note
studied byStudied by 219 people
... ago
5.0(4)
note Note
studied byStudied by 6 people
... ago
5.0(1)
note Note
studied byStudied by 1197 people
... ago
5.0(6)
note Note
studied byStudied by 45 people
... ago
4.8(4)
note Note
studied byStudied by 5 people
... ago
5.0(1)
note Note
studied byStudied by 8 people
... ago
5.0(1)
note Note
studied byStudied by 13 people
... ago
5.0(1)
note Note
studied byStudied by 5 people
... ago
5.0(2)

Explore top flashcards

flashcards Flashcard (107)
studied byStudied by 14 people
... ago
5.0(1)
flashcards Flashcard (30)
studied byStudied by 2 people
... ago
5.0(1)
flashcards Flashcard (230)
studied byStudied by 17 people
... ago
5.0(1)
flashcards Flashcard (41)
studied byStudied by 48 people
... ago
5.0(1)
flashcards Flashcard (232)
studied byStudied by 60 people
... ago
5.0(1)
flashcards Flashcard (58)
studied byStudied by 4 people
... ago
5.0(1)
flashcards Flashcard (22)
studied byStudied by 37 people
... ago
5.0(1)
flashcards Flashcard (49)
studied byStudied by 79 people
... ago
5.0(2)
robot