Operating Systems (process, storage, memory & device management) Flashcards

1
Q

system call (concept)

A

system calls offer an interface to access OS services

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

Windows’ & Linuxs’ API

A

UNIX: POSIX; Win = Win32

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

CPU burst (concept)

A

the time a process actually spends computing (using the CPU)

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

process scheduling algorithms

A

FCFS (First Come First Served); Shortest-Job-First; Priority-Scheduling

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

process (definition)

A

1) program & dynamically-allocated memory

2) stack, instruction pointer & registers

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

multi-threading (concept)

A

in a multithreaded process on a single processor, the processor can switch execution resources between threads, resulting in concurrent execution.

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

thread (definition)

A

‘context of execution’ –> stack/memory/registers a process needs to resume at (e.g. reading a book, put it down, specify a page, paragraph & letter)

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

what are the main functions of an operating system?

A

 Resource sharing
 Task co-operation
 Scheduling
A layer of abstraction between hardware and software

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

list sub-systems that form part of the operating system?

A

memory, process, device and storage management

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

pre-emptive multi-tasking

A

time slots allocated to processes

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

co-operative multi-tasking

A

process hands control over once finished

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q
a system has the following parameters:
    virtual address space = 1Tb
    page size = 4Mb
    physical memory = 4Gb
determine the number of page entries required.
A

1Tb = 40 bits required to address
4Mb = 22 bits required to address
Therefore, 40-22 = 18, therefore 2^18 page table entries required

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