Untitled Deck Flashcards

1
Q

What is RISC?

A

RISC stands for Reduced Instruction Set Computer, characterized by a simple, small instruction set and fast execution.

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

What is CISC?

A

CISC stands for Complex Instruction Set Computer, which has a complex, large instruction set and fewer lines of code.

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

What is the role of an Operating System (OS)?

A

An Operating System manages hardware and software resources, handles multitasking, and improves efficiency.

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

What is the difference between Supervisor mode and User mode?

A

Supervisor mode is for critical tasks with greater control, while User mode is for regular tasks.

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

What are Hypervisors?

A

Hypervisors are software that create and manage virtual machines. They can be bare metal, running directly on hardware, or hosted, running on top of an existing OS.

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

Define Program, Process, and Thread.

A

A Program is a set of instructions on disk, a Process is a running instance of a program, and a Thread is the smallest unit of execution within a process.

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

What is the difference between PCB and TCB?

A

PCB stands for Process Control Block, which contains process information, while TCB stands for Thread Control Block, which contains thread-specific information.

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

What are the states of a Process?

A

The states of a Process include New, Ready, Running, Waiting, Terminated, and Suspended.

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

What are the types of Schedulers?

A

Schedulers include Long-term (admits jobs, manages system load), Medium-term (suspends/resumes processes), and Short-term (allocates CPU to ready processes).

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

What is Inter-Process Communication (IPC)?

A

Inter-Process Communication (IPC) is a mechanism for processes to communicate, such as using Pipes.

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

What is the Banker’s Algorithm?

A

The Banker’s Algorithm is used for resource allocation and deadlock avoidance, ensuring safe states where all processes can complete.

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

What are the requirements of Memory Management?

A

Memory Management requires relocation, protection, sharing, and logical/physical organization.

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

What is Virtual Memory?

A

Virtual Memory provides flexibility, multitasking, and isolation.

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

What is a Page Fault?

A

A Page Fault occurs when a page is not in memory, causing the process to pause while the page is loaded from disk.

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

What is a Page Map Table (PMT)?

A

A Page Map Table (PMT) maps virtual addresses to physical addresses.

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

What is Round Robin Scheduling?

A

Round Robin Scheduling allocates a fixed time slice for each process, ensuring fair CPU allocation.

17
Q

What are the conditions for Deadlock?

A

Deadlock conditions include Mutual exclusion, Hold and wait, No preemption, and Circular wait.

18
Q

What is the Critical Section Problem?

A

The Critical Section Problem ensures that only one process accesses a shared resource at a time.

19
Q

What are Semaphores?

A

Semaphores are synchronization tools with operations like Wait() (decreases semaphore) and Signal() (increases semaphore).

20
Q

What is the Producer/Consumer Problem?

A

The Producer/Consumer Problem involves a producer adding items and a consumer removing items, often solved using semaphores.

21
Q

What is Starvation in process management?

A

Starvation occurs when a process waits indefinitely for resources or CPU.

22
Q

What is the Dining Philosophers Problem?

A

The Dining Philosophers Problem involves philosophers needing forks to eat, solved using semaphores to avoid deadlock.

23
Q

How is Cache Access Time calculated?

A

Cache Access Time is calculated using cache hit ratios and access times.

Example: Cache1 (90% hit, 0.2 units), Cache2 (70% hit, 0.1 units), RAM (1 unit). Average access time = 0.19 units.

24
Q

What is Amdahl’s Law?

A

Amdahl’s Law describes the potential speedup of a task using multiple processors based on the sequential and parallel portions.

Example: Sequential portion (s) = 60%, Time with 5 processors = 0.68 units, Maximum speedup = 1.67x.

25
Q

What are the types of Cache Memory based on levels?

A

Cache Memory types based on levels include L1 (fastest, smallest), L2, L3, and L4 (largest, slowest).

26
Q

What are the types of Cache Memory based on function?

A

Types of Cache Memory based on function include Instruction Cache, Data Cache, and TLB (Translation Lookaside Buffer).

27
Q

What are the types of Cache Memory based on mapping?

A

Cache Memory can be Direct Mapped, Fully Associative, or Set Associative.

28
Q

What are the types of Cache Memory based on write policy?

A

Cache Memory types based on write policy include Write-Through, Write-Back, and Write-Around.

29
Q

What are the key differences between Addressable Caches and Content Addressable Caches?

A

Addressable Caches are slower with larger capacity and energy-efficient, while Content Addressable Caches are faster with smaller capacity and higher power consumption.