Matching Question
On Operating System
Group: 1B Dr. Rabab Emad
By:
Nada Ahmed Gamal
Youssef Mohamed Mohamed
David Emad Fayek
Ahmed Reda Ahmed
Moaz Ahmed Saleh
Youssef Mohamed Anwer
Q. Match the statements:
Column (A) Column (B)
a) Word processing programs, games,
1. System software
inventory control systems.
b) The technique of keeping multiple
2. Operating system programs in main memory at the
same time.
c) Was a large machine managed by a
3. Application software
human operator.
d) Can be defined as a program in
4. Application software examples
execution.
e) Provides the tools and an
5. Multiprogramming environment in which application
software can be created and run.
f) Would organize various jobs from
6. Memory management
multiple users into batches.
g) In a timesharing system, each user
has his own of it, in which all system
7. A process
resources are (in effect) available for
use.
h) Keeps track of what and where
8. The operating system
programs are in memory.
i) Manages computer resources and
9. CPU scheduling
provides an interface.
j) Allows multiple users to interact with
10. A typical computer in the ‘70s
a computer at the same time.
11. The human operator k) Performs process management.
l) It is written to address our specific
12. Timesharing system needs to solve problems in the real
world.
m) Determines which process in
13. Virtual machine memory is executed by the CPU at
any given point.
n) Is an actual address in the main
14. A logical address
memory device.
o) A value that specifies a generic
15. A physical address location, relative to the program but
not to the reality of main memory.
p) the partitions are created to fit the
16. A logical address
need of the programs
q) a register that holds the length of the
17. fixed partitions
current partition.
r) Program is allocated to the first
18. dynamic partitions
partition big enough to hold it
s) Program is allocated to the largest
19. Base register
partition big enough to hold it
t) is simply an integer value relative to
20. Bounds register
the starting point of the program.
21. First fit u) Too much page swapping
v) main memory is divided into a
22. Best fit
particular number of partitions.
w) a register that holds the beginning
23. Worst fit
address of the current partition.
x) Keeps track of the mapping between
24. Paged memory technique
process pages and memory frames
y) Program is allocated to the smallest
25. page-map table (PMT)
partition big enough to hold it
z) main memory is divided into small
26. thrashing fixed-size blocks of storage called
frames.
aa) Usually that data is stored in a
27. virtual memory
data structure
bb) occurs when the operating system
decides to favor another process,
28. process control block (PCB)
preempting the currently executing
process
cc) the illusion that there are no
29. Non preemptive scheduling
restrictions on the size of a program
dd) amount of time between the time
30. Preemptive scheduling:
a process arrives in the ready state to
the time it exits the running state for
the last time
ee) occurs when the currently
31. Turnaround time executing process gives up the CPU
voluntarily
ff) Technological advancements have
32. Round-robin algorithm raised issues relating to our right to
privacy
gg) The algorithm establishes a
particular time slice (or time
33. Ethical Issues: Privacy Invasion quantum), which is the amount of
time each process receives before
being preempted
Answers:
1. e 2. I 3. l 4. a 5. b
6. h 7. d 8. k 9. m 10. c
11. f 12. j 13. g 14. o 15. n
16. t 17. v 18. p 19. w 20. q
21. r 22. y 23. s 24. z 25. x
26. u 27. cc 28. aa 29. ee 30. bb
31. dd 32. gg 33. ff
