Computer Systems/Arch

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/23

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 3:42 PM on 10/21/24
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

24 Terms

1
New cards

Synch Io

The computer can’t do anything with it until it the computer computes an input/output

2
New cards

Asynch IO

Programming technique that allows a program to preform other tasks while waiting for input/output operations

3
New cards

Are interrupts external or internal processes?

External

4
New cards

When a process creates multiple threads, all threads share one (1) program counter (PC) that keeps track of the current location within the program being executed. True or False

False

5
New cards

One of the services an Operating System provides is “Protection and Security”, which provides an access control to the processes & files as well as the defense against internal and external attacks. True or False?

True

6
New cards

A computer can run a program stored on the disk directly without loading it to the main memory. True or False?

False

7
New cards

An Operating System is considered as an “interrupt-driven” software. True or False?

True

8
New cards

Differences between parallelism and concurrency?

Concurrency is when multiple tasks make progress by sharing time, but not necessarily running at the same moment, while parallelism is when multiple tasks are executed simultaneously on different processors or cores. Concurrency focuses on task management, whereas parallelism focuses on task execution.

9
New cards

Explain why an Operating System is usually designed to have Stack and Heap memory spaces grow into the opposite directions (one from lower address to higher, the other from higher to lower).

An operating system designs the stack and heap to grow in opposite directions to maximize efficient use of memory, allowing them to expand dynamically without immediately overlapping, thus optimizing available space between them. This layout minimizes fragmentation and better handles varying memory needs.

10
New cards
term image

The first PID is the Java program's own process, while the second PID is for the new process created by running the ls -lrt command. Each represents a different process.

11
New cards

When using a Mutex lock to achieve synchronization, a thread failing to acquire a lock "busy waits" until successfully acquiring a lock. True or False?

True

12
New cards

When a thread starts waiting for a condition variable, a thread releases a lock previously acquired AND doesn't consume any CPU resources while waiting. True or False?

True

13
New cards

Semaphore initialized with the integer value 0 works in the same way as a Mutex lock. True or False?

False

14
New cards

Explain what a critical section of the code is when multiple processes and/or threads are running simultaneously.

A critical section is the part of a program where shared resources are able to be accessed, written, and modified from multiple people. While the processes are running only one user at a time can enter the critical section using synchronization (locks and semaphores).

15
New cards

What is a program?

A program is a set of instructions stored on disk.

16
New cards

What is a process?

A process is an instance of a program in execution, including its code, data, and resources like memory and CPU time.

17
New cards

What is parallelism?

the computer makes progress in multiple
jobs/processes simultaneously

18
New cards

What is concurrency?

the computer provides impression that
multiple jobs/processes are making progress
simultaneously.

19
New cards

Stack

Temporary data is only used minimally

20
New cards

Is creating a process slower then creating a thread? True or False

True

21
New cards

What is unsafe code?

Unsafe code allows multiple users to edit the code

22
New cards

Mutex lock

Only one thread can access the memory at the same time

23
New cards

Semaphore

Constantly checks if it can access. It allows multiple threads but has a limit.

24
New cards

Why are mutex and semaphore similar?

Because they use busy wait