1.

The content of the matrix Need is: Select one:

a. Max – Available
b. Allocation – Available
c. Allocation – Max
d. Max – Allocation
2. Suppose that a machine has 48 bits virtual addresses and 32 bits physical
addresses. If pages are 4KB. How many entries are in the page table if it has only a
single level? Select one: a. 2^10 b. 2^20 c. 2^36 d. 2^32
3.

4. For 4 page frames, the following is the reference string: 1 2 3 4 2 1 5 6 2 1 2 3

7 6 3 2 1 2 3 6 How many page faults does the Optimal page replacement
algorithm produce? Select one: a. 8 b. 12 c. 16 d. 20
5. For 4 page frames, the following is the reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6
3 2 1 2 3 6 How many page faults does the FIFO page replacement algorithm
produce? Select one: a. 16 b. 14 c. 20 d. 18
6. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C,
D, E. If the page replacement algorithm is FIFO, the number of page transfers with
an empty internal store of 3 frames is? Select one: a. 9 b. 10 c. 7 d. 8
7. Assume that four jobs A-D require the CPU cycles listed below. Using the Round-
Robin algorithm with time slide equaling 4, the waiting time of all process is __.
Arrival time: 4 1 0 2 Job: A B C D CPU cycle: 5 2 6 4 Select one: a. 6.25 b. 25 c. 42 d.
10.5
8. Which of the following process state transitions are illegal? Select one: a. ready ->
running b. running -> ready c. blocked -> ready d. blocked -> running
9. Which of the following process state transitions are illegal? Select one: a. ready ->
running b. running -> ready c. blocked -> ready d. blocked -> running
10. Which of the following process state transitions are illegal? Select one: a. ready -
> running b. running -> ready c. blocked -> ready d. blocked -> running

11. For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2

3 0 3 2 1 2 0 1 7 0 1 How many page faults does the LRU page replacement
algorithm produce? Select one: a. 11 b. 15 c. 10 d. 12

12. Consider that a disk partition using FAT-32 file system, 4-KB block size. How many
disk-partition sizes up to? Select one: a. 8 TB. b. 2 TB. c. 1 TB. d. 4 TB.
13. Consider a swapping system in which memory consists of the following hole
sizes in memory order: 12 MB, 7 MB, 16 MB, 30 MB, 10 MB, 9 MB, 13 MB, and 15 MB.
Which hole is taken for successive segment requests of 11 MB for Best fit algorithm?
Select one: a. 15 MB b. 10 MB c. 12 MB d. 13 MB
14. Assume that jobs A-D arrive in the ready queue in quick succession and have the
CPU cycle requirements listed below. Using the Shortest Remaining Time Next
algorithm, the Waiting time of job A is __. Arrival time: 0 1 2 3 Job: A B C D CPU
cycle: 6 3 1 4 Select one: a. 0 b. 1 c. 14 d. 8
15. A computer system has 6 tape drives, with 'n' processes competing for them.
Each process may need 3 tape drives. The maximum value of 'n' for which the
system is guaranteed to be deadlock free is? Select one: a. 4 b. 3 c. 1 d. 2
16. The content of the matrix Need is: Select one: a. Max – Available b. Allocation –
Available c. Allocation – Max d. Max – Allocation
17. Suppose that a machine has 48 bits virtual addresses and 32 bits physical
addresses. If pages are 4KB. How many entries are in the page table if it has only a
single level? Select one: a. 2^10 b. 2^20 c. 2^36 d. 2^32
18. A process is selected from the ______ queue by the ________ scheduler, to be
executed.
a. wait, long term
b. blocked, short term
c. ready, long term
d. ready, short term
19. For 4 page frames, the following is the reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7
6 3 2 1 2 3 6 How many page faults does the Optimal page replacement algorithm
produce?
a. 8
b. 12
c. 16
d. 20
20. For 4 page frames, the following is the reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7
6 3 2 1 2 3 6 How many page faults does the FIFO page replacement algorithm
produce?
Select one:
a. 16
b. 14
c. 20
d. 18
21.

22.
23.

24. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C,

D, E. If the page replacement algorithm is FIFO, the number of page transfers with
an empty internal store of 3 frames is? Select one: a. 9 b. 10 c. 7 d. 8
25. Assume that four jobs A-D require the CPU cycles listed below. Using the Round-
Robin algorithm with time slide equaling 4, the waiting time of all process is __.
Arrival time: 4 1 0 2 Job: A B C D CPU cycle: 5 2 6 4 Select one: a. 6.25 b. 25 c. 42 d.
10.5
26. Which of the following process state transitions are illegal? Select one: a. ready -
> running b. running -> ready c. blocked -> ready d. blocked -> running
27.

28. Consider a swapping system in which memory consists of the following hole
sizes in memory order: 10 MB, 4 MB, 18 MB, 20 MB, 7 MB, 9 MB, 12 MB, and 15 MB.
Which hole is taken for successive segment requests of 12 MB for Worst fit
algorithm? Select one: a. 12 MB b. 15 MB c. 20 MB d. 18 MB
29. A computer has 32 bits virtual addresses and 4 KB pages. How many entries are
needed for two level paging, with 10 bits in each part? Select one: a. 4095 b. 1024 c.
1023 d. 4096
30. The physical disk of the original IBM PC have 65535 cylinders, 16 heads, 63
sectors per track, and 512 bytes per sector, the largest posible disk is __. Select one:
a. 31.5 GB b. 63 GB c. 33.5 GB d. 64 GB
31.

32.
33. For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1
2 0 1 7 0 1 How many page faults does the LRU page replacement algorithm
produce? Select one: a. 11 b. 15 c. 10 d. 12
34.

35. Consider that a disk partition using FAT-32 file system, 4-KB block size. How many
disk-partition sizes up to? Select one: a. 8 TB. b. 2 TB. c. 1 TB. d. 4 TB.
36. Consider a swapping system in which memory consists of the following hole
sizes in memory order: 12 MB, 7 MB, 16 MB, 30 MB, 10 MB, 9 MB, 13 MB, and 15 MB.
Which hole is taken for successive segment requests of 11 MB for Best fit algorithm?
Select one: a. 15 MB b. 10 MB c. 12 MB d. 13 MB
37. Assume that four jobs A-D require the CPU cycles listed below. Using the
Shortest Job First algorithm, the __ job is run first. Job: A B C D CPU cycle: 5 2 6 4
Select one: a. D b. C c. B d. A
38. A computer with 32 bits virtual address uses a two-level page table. Virtual
addresses are split into a 9 bits top-level page table field, a 10 bits second-level page
table field, and an offset. How many are there in the address space? Select one: a.
10 bits b. 13 bits c. 11 bits d. 12 bits
39.
40.

41.
42. Assume that jobs A-D arrive in the ready queue in quick succession and have the
CPU cycle requirements listed below. Using the Shortest Remaining Time Next
algorithm, the Waiting time of job A is __. Arrival time: 0 1 2 3 Job: A B C D CPU
cycle: 6 3 1 4 Select one: a. 0 b. 1 c. 14 d. 8
43. A computer system has 6 tape drives, with 'n' processes competing for them. Each process may
need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is?
Select one: a. 4 b. 3 c. 1 d. 2

44. The content of the matrix Need is: Select one: a. Max – Available b. Allocation – Available c.
Allocation – Max d. Max – Allocation

45. Suppose that a machine has 48 bits virtual addresses and 32 bits physical addresses. If pages are
4KB. How many entries are in the page table if it has only a single level? Select one: a. 2^10 b. 2^20 c.
2^36 d. 2^32

46.

47. Assume that four jobs A-D require the CPU cycles listed below. Using the Shortest Job First
algorithm, the ____ job is run first. Job: A B C D CPU cycle: 5 2 6 4 Select one: a. D b. C c. B d. A

48. A computer with 32 bits virtual address uses a two-level page table. Virtual addresses are split into a
9 bits top-level page table field, a 10 bits second-level page table field, and an offset. How many are
there in the address space? Select one: a. 10 bits b. 13 bits c. 11 bits d. 12 bits
49.
50.

51. Consider a swapping system in which memory consists of the following hole sizes in memory order:
14 MB, 11 MB, 16 MB, 30 MB, 10 MB, 9 MB, 13 MB, and 15 MB. Which hole is taken for successive
segment requests of 10 MB for First fit algorithm? Select one: a. 10 MB b. 14 MB c. 12 MB d. 15 MB

52. For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 How
many page faults does the LRU page replacement algorithm produce? Select one: a. 11 b. 15 c. 10 d. 12

53. Consider that a disk partition using FAT-32 file system, 4-KB block size. How many disk-partition sizes
up to? Select one: a. 8 TB. b. 2 TB. c. 1 TB. d. 4 TB.

54. Consider a swapping system in which memory consists of the following hole sizes in memory order:
12 MB, 7 MB, 16 MB, 30 MB, 10 MB, 9 MB, 13 MB, and 15 MB. Which hole is taken for successive
segment requests of 11 MB for Best fit algorithm? Select one: a. 15 MB b. 10 MB c. 12 MB d. 13 MB

55.

56. Which of the following equations would accurately describe a 4-input OR gate when A = 1, B = 1, C =
0 and D = 0? Select one: a. 1 + 1 + 0 + 0 b. 0 c. 1 + 1 + 0 + 0 d. 00 e. 1 f. 1 + 1 + 0 + 0 g. 01 h. 1 + 1 + 0 + 0
57. How many possibilities of mapping does a direct mapped cache have? Select one: a. 1 b. 2 c. 4 d. 3

58. Whenever the data is found in the cache memory it is called as _____ Select one: a. MISS b. HIT c.
ERROR d. FOUND

59. Consider a machine with a byte addressable main memory of 216 bytes and block size of 8 bytes.
Assume that a direct mapped cache consisting of 32 lines is used with this machine. How is a 16-bit
memory address divided into tag, line number, and byte number? Select one: a. 6-7-3 b. 9-4-3 c. 7-6-3 d.
8-5-3

60. What is the maximum addressable memory of a 32-bit microprocessor with 24-bit address? Select
one: a. 16 MB b. 16 Mbits c. 16 Gbits d. 16 GB

61. An 24 bit address generates an address space of ______ locations. Select one: a. 16777216 b. 2^48 c.
4096 d. 1024

62. Adding the two’s complement of –20 + 16 will yield which two’s complement answer? Select one: a.
1110 1001 b. 1111 1100 c. 1110 1101 d. 1111 0011

63. Consider a machine with a byte addressable main memory of 2^32 bytes and block size of 64 bytes.
Assume that a set associative mapped cache consisting of 128KB and a set with 4 lines used with this
machine. How is a 32-bit memory address divided into tag, set number, and byte number? Select one: a.
17-9-6 b. 16-10-6 c. 15-11-6 d. 14-12-6

64. What is the maximum addressable memory of a 32-bit microprocessor with 32-bit address? Select
one: a. 4 MB b. 4 GB c. 4 Gbits d. 4 KB

65. Which of the following groups are only input devices? Select one: a. Mouse, keyboard, Trackball,
Touch Screen, Microphone, printer b. Mouse, keyboard, Scanner, Joystick, Light pen c. Mouse,
keyboard, printer, Light pen d. Mouse, keyboard, monitor, Joystick

66. The binary value of the ASCII letter “d” is 01100100. Its decimal value is _____ Select one: a. 100 b.
123 c. 100 d. 45

67. Cells of computer memory are organized into a group of Select one: a. 6 bits b. 8 bits c. 12 bits d. 10
bits

68. How many read/write heads are there per platter? Select one: a. 2 b. 3 c. 4 d. 1

69. What are the components of a computer? Select one: a. CPU, Main memory, Input Output system,
System bus b. CPU, ROM, Disk c. ROM, RAM, Monitor d. ROM, RAM, Cache

70. Assume that four jobs A-D require the CPU cycles listed below. Using the Shortest Job First
algorithm, the ____ job is run first. Job: A B C D CPU cycle: 5 2 6 4 Select one: a. D b. C c. B d. A

71. A computer with 32 bits virtual address uses a two-level page table. Virtual addresses are split into a
9 bits top-level page table field, a 10 bits second-level page table field, and an offset. How many are
there in the address space? Select one: a. 10 bits b. 13 bits c. 11 bits d. 12 bits

72. A process is selected from the ______ queue by the ________ scheduler, to be executed. Select one:
a. wait, long term b. blocked, short term c. ready, long term d. ready, short term
73. For 4 page frames, the following is the reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 How
many page faults does the Optimal page replacement algorithm produce? Select one: a. 8 b. 12 c. 16 d.
20

74. For 4 page frames, the following is the reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 How
many page faults does the FIFO page replacement algorithm produce? Select one: a. 16 b. 14 c. 20 d. 18

75. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page

replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames
is? Select one: a. 9 b. 10 c. 7 d. 8

76. Assume that four jobs A-D require the CPU cycles listed below. Using the Round-Robin algorithm
with time slide equaling 4, the waiting time of all process is ____. Arrival time: 4 1 0 2 Job: A B C D CPU
cycle: 5 2 6 4 Select one: a. 6.25 b. 25 c. 42 d. 10.5

77. Consider a swapping system in which memory consists of the following hole sizes in memory order:
10 MB, 4 MB, 18 MB, 20 MB, 7 MB, 9 MB, 12 MB, and 15 MB. Which hole is taken for successive
segment requests of 12 MB for Worst fit algorithm? Select one: a. 12 MB b. 15 MB c. 20 MB d. 18 MB

78. A computer has 32 bits virtual addresses and 4 KB pages. How many entries are needed for two level
paging, with 10 bits in each part? Select one: a. 4095 b. 1024 c. 1023 d. 4096

79. The physical disk of the original IBM PC have 65535 cylinders, 16 heads, 63 sectors per track, and 512
bytes per sector, the largest posible disk is ______. Select one: a. 31.5 GB b. 63 GB c. 33.5 GB d. 64 GB