Comp Sci - Topic 2 and 6

0.0(0)
studied byStudied by 10 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/76

flashcard set

Earn XP

Description and Tags

Merge of content from both Resource Management and Computer Architecture

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

77 Terms

1
New cards

What is true color

Maximizing the 24 slots of hex bits available

2
New cards

(11010110) base 2 → hexadecimal

D6

3
New cards

1001101 (base 2) → base 16

4D

4
New cards

11001 (base 2) → decimal

25

5
New cards

ALU

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

6
New cards

ASCII

A character set which involves all Latin letters

7
New cards

Batch processing

Programs are grouped together based on dependencies then executed sequentially

8
New cards

Pros and Cons of interrupt

Less resource intensive but less optimal because of Latency

9
New cards

Pros and Cons of polling

Optimal behavior but resource intensive

10
New cards

Pros of Multi-Threading

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

11
New cards

Broad Types of Secondary Storage

Direct access [HDD/SSID] and Sequential access

12
New cards

Burst Time

CPU time occupied by process without waiting for input/output

13
New cards

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

14
New cards

CIR

Current Instruction Register: Stores the instruction currently being decoded

15
New cards

Client

the person/institution funding the product

16
New cards

Compaction

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

17
New cards

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

01011001

18
New cards

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

2D

19
New cards

Convert 75 (base 10) into hexadecimal

4F

20
New cards

CU

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

21
New cards

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]

22
New cards

Deadlock

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

23
New cards

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

24
New cards

Define CPU

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

25
New cards

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.

26
New cards

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

27
New cards

DRAM constantly leaks, so it requires constant?

refreshing

28
New cards

Excessive paging leads to

thrashing

29
New cards

Excessive swapping leads to

Fragmentation

30
New cards

Execute

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

31
New cards

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.

32
New cards

Hex

A numerical notation using base 16

33
New cards

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. 

34
New cards

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.  

35
New cards

How to convert Decimal into Hex

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

36
New cards

How to convert Hex into Binary?

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

37
New cards

Interrupt

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

38
New cards

Lossy Compression

Files will lose quality when it is compressed

39
New cards

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)

40
New cards

MAR

Memory Address Register:

Stores the memory address from which data will be fetched

41
New cards

MDR

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

42
New cards

Memory Leak

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

43
New cards

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

44
New cards

Multi-access

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

45
New cards

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

46
New cards

Multi-processing

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

47
New cards

Multi-threading

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

48
New cards

Multi-programming

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

49
New cards

Cons of multi-threading

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

50
New cards

Paging [in virtual memory]

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

51
New cards

Parts of the CPU

ACC
ALU
CU
CIR
MDR
MDB
MAR
MAB
RAM

52
New cards

Peak theoretical bandwidth

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

53
New cards

Polling

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

54
New cards

Processor Speed

Million instructions per second (MIPS)

55
New cards

Purpose of MAC address and NIC

NIC is responsible for the client connection to the WAN

56
New cards

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

4E

57
New cards

ROM

Non-volatile primary memory

58
New cards

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. 

59
New cards

Run Length Encoding

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

60
New cards

Run Time

The time taken, alongside fetching/waiting and executing

61
New cards

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

62
New cards

Spool

Sequence of print jobs

63
New cards

Sustained memory bandwidth

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

64
New cards

Task Scheduling Algorithms

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

65
New cards

The secondary memory and CPU are connected. True or False

False

66
New cards

Three states of a job in the CPU

Wait → Ready → Execute

67
New cards

Two types of compression algorithms

Lossy compression and lossless compression

68
New cards

Types of bandwidth

Peak theoretical bandwidth and sustained memory bandwidth

69
New cards

Unicode

An extension of ASCII that adds other languages support

70
New cards

What does core mean?

CPU or system

71
New cards

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

72
New cards

What is direct access (secondary memory)?

Data can be retrieved with indexed values

73
New cards

What is sequential access [secondary memory]

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

74
New cards

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

75
New cards

Where is the MAC address found?

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

76
New cards

Real-time processing

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

77
New cards

Online processing

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