1.

B
2. A
3. a and c
4. a
5. a
6. d
7. c
8. d
9. a
10. d
11. c
12. a
13. b and c
14. a
15. c
16. a and c
17. b
18. d
19. b
20. c
21. d
22. d
23. b
24. d
25. c
26. a
27. a
28. a
29. d
30. b
 1.
Open systems are computer systems that provide some combination of interoperability,
portability, and open software standards. Examples include WordPress and Unix. Closed
systems are systems that allow users to use content as it is with minimal modification to the
actual software or program. Example Microsoft office.

2. Process is a program in execution. The execution of the

process must progress in a sequential manner. Process concept
deals with the creation of process to the completion of the
process. Computer programs are written in a text file and
when we execute this program, it becomes a process which
performs all the tasks mentioned in the program. When a
process is loaded into memory, it becomes a process.
Process state defines the current state of a process. A process
may be in the running, ready, waiting, new and terminate state.
This explains the process life cycle.

b.

New State: The process being created.

Running State: A process is said to be running if it has the CPU, that is, process actually
using the CPU at that particular instant.
Blocked (or waiting) State: A process is said to be blocked if it is waiting for some event to
happen such that as an I/O completion before it can proceed. Note that a process is unable to
run until some external event happens.
Ready State: A process is said to be ready if it is waiting to be assigned to a processor.
Terminated state: The process has finished execution.
main memory.

c. Round-robin scheduling works by giving each process a timeslice to run in, implemented by a
ready queue and a regular timer interrupt. When a timeslice expires, the next process pre-empts the
current process and runs for its timeslice, putting the pre-empted process at the end of the queue.

d. gantt chat

ready queue

p2

p3

p1

p4

p2

p5

p6

p3

p5

p3

P1 P2 P3 P1 P4 P2 P5 P6 P3 P5 P3
0 3 6 9 11 12 15 18 21 24 25 26

Waiting time

P1= 0 + 6 = 6

P2= 3+ 6 = 9

P3= 6+12+1=19

P4= 11

P5=15+ 6=21

P6=18

Waiting time arrival time

P1=6 -1 =5

P2=9 2=7

P3=19 3=16

P4= 11 5=6

P5=21 7=14

P6=18 8=10

Or

Turnaround time = completion time arrival time

P1= 11 -1 = 10

P2= 15 -2 = 13

P3= 26 3 =23

P4= 12 -5 =7

P5 = 25 7 = 18

P6 = 21 8 = 13

Waiting time = turnaround time- CPU time

P1= 10- 5 = 5

P2= 13- 6 = 7

P3 =23- 7 =16

P4 =7 -1=6

P5= 18- 4=14

P6= 13-3 =10

E. Average waiting time

(5 + 7 + 16 + 6 + 14 + 10)/6 =58/6 = 9.67

The significance---it shows how long each process has to wait before it gets its time slice to
execute.