Okay, I can help you with the questions in the document.

Here are the

answers based on the provided text:

DCIT 101: INTRODUCTION TO COMPUTER SCIENCE - Examination

Questions and Answers

1. d. Interrupt

2. b. Process

3. b. Linker

4. c. Alan Turing

5. a. Fetch-execute cycle (Note: While "Stored program concept" is

fundamental, the "Fetch-execute cycle" describes the operation.)

6. d. Open Source Software

7. b. Hardware

8. a. RAM

9. d. instructions

10. c. Hardware

11. b. Software

Diagram Based Questions (Q12-Q15):

(The options provided are for labeling parts Q12, Q13, Q14, and Q15 of a
basic computer system diagram. The diagram shows Q13 connected to Main
Memory, and receiving input from Q12 and sending output to Q14. Q15 is
also connected to Q13.)

Looking at a standard computer architecture:

 Q13, which interacts with Main Memory and other components, would
be the c. CPU.

 Q12, providing input to the CPU, would be an Input device (not

explicitly listed as an option, but inferred).

 Q14, receiving output from the CPU, would be an a. Output device.

 Q15, also interacting with the CPU, could be b. Auxiliary Storage or

related to the d. Control Unit (which is part of the CPU). Without
further context or a clearer diagram, Q15 is ambiguous.
16. h. 1024

17. a. Fb (Fb is not a standard unit of memory capacity; Gb, Mb, Tb

are)

18. c. 802 (Assuming 1 byte stores 1 character)

19. b. 478 (Calculation: 1.5Mb = 1.5 * 1024 * 1024 bytes =

1,572,864 bytes. Pages = 1,572,864 / 3290 ≈ 478.07)

20. d. All of the above

21. a. True

22. d. All of the above (Commercial packages like Microsoft Word

are application software, not typically classified as systems software in
this context. User programs are applications.)

23. d. Microsoft Excel (Microsoft Excel is application software)

24. a. Develop an algorithm for a problem (This is a task for a

programmer/analyst, not a function of system software itself)

25. b. Object code (The output of a compiler is typically object

code, which is then linked to become an executable)

26. a. ALU (Arithmetic Logic Unit)

27. c. CPU (Central Processing Unit)

28. c. 2^5 (This should be 25 which is 32. Option d is 25−1)

29. d. 6 (26 lowercase + 26 uppercase = 52 characters. 25 = 32

(not enough). 26 = 64 (enough))

30. a. Parity bit

31. c. Wires (More generally, lines or conductive paths)

32. a. Data bus

33. d. Address bus

34. d. Has large capacity relative to main memory (Cache

memory is smaller and faster than main memory)

35. a. Locality of reference

36. b. 103 102 101 10 (This should be 103 102 101 100)
37. b. -128 64 32 16 8 4 2 1

38. d. 11101001 (To represent -17 in 8-bit two's complement: 17 is

00010001. Invert bits: 11101110. Add 1: 11101111. There seems to be
a typo in the options or the question's intended bit length. If we
consider the smallest number of bits, -17 in 5 bits: 17 is 100012. Two's
complement: 01110+1=01111. This is not among the options. Let's re-
evaluate based on the given options that are 8-bit. 00010001 (17).
Invert: 11101110. Add 1: 11101111. Option d is 11101001 (-23).
Option c is 11101111. There might be a typo in option 'd' and it should
be 11101111.)

39. c. 9 (373 in binary is 101110101, which requires 9 bits)

40. b. 2 (Since 9 bits are needed, and data is stored in integer bytes
(8 bits), 2 bytes are required)

41. a. -90 (10100110 as 8-bit two's complement: MSB is 1, so

negative. Invert: 01011001. Add 1: 01011010. This is 64+16+8+2=90.
So, -90)

42. d. -38 (10100110 as 8-bit sign and magnitude: MSB is 1

(sign=negative). Magnitude is 0100110 = 32+4+2=38. So, -38)

43. a. A6 (1010 is A, 0110 is 6. So, A6)

44. d. None of the above (All listed are valid reasons)

45. c. Access control systems for example vehicles barrier or

approaching traffic lights (Pressure sensor for detecting vehicles)

46. d. To control the illumination of an enclosed space

47. a. Computer controlled oven that uses actuators to switch

it on and off

48. b. In computer-controlled greenhouse to open or close

windows (Wind speed could be a factor for window control)

49. b. Transmission medium

50. d. Bluetooth (Bluetooth is wireless, hence unguided)

51. a. Fibre optic (Fibre optic is a guided medium)

52. b. Low data rate (Guided media like fibre optics can have very
high data rates)
 53. c. Both single mode and multimode

54. a. HTTP is connection oriented (HTTP is considered stateless,

though it uses TCP which is connection-oriented. The question asks
about HTTP features.)

55. a. A continuous flow of bits over a communication path

56. d. None of the above (Real-time streaming is used for live

events, e.g., live radio, live video broadcasts)

57. c. Commercial IP addresses (Not a standard classification type

like private, public, or static)

58. b. the operand is the actual number to be used

59. a. the operand contains the address of the value to be

used (Note: Indirect usually means the operand is an address that
points to another address which holds the value, but given the options,
'a' is the closest for a single level of indirection.)

60. c. the actual address is calculated using two base points

(Relative addressing usually involves an offset from a base address or
program counter)

Logic Gate Diagram Questions (Q61-Q64):

(Assuming standard logic gate symbols)

 A appears to be an OR gate.

 B appears to be an AND gate.

 C appears to be a NOT gate (inverter).

 D appears to be a NAND gate (AND followed by a NOT bubble).

61. Which diagram represents a NOT gate? C

62. Which diagram represents a NAND gate? D

63. Which diagram represents an AND gate? B

64. Which diagram represents an OR gate? A

65. d. systems software

 66. d. server (While an OS manages resources on a server, "server"
itself isn't a resource managed by the OS in the same way as
processor, memory, or storage)

Travel Scenario Questions (Q67-Q73):

67. a. Travel at the weekend is by car

68. Car_travel = IF day = weekend: TRUE

69. Train_travel = IF day = weekday AND distance ≤200: TRUE

70. Air_travel = IF day = weekday AND distance >200: TRUE

71. (X = Car_travel. A = weekday. B = distance ≤200. Car travel is if day =

weekend, which is NOT A.)

b. X = Not A

72. (Y = Train_travel. A = weekday. B = distance ≤200. Train travel is if day

= weekday AND distance ≤200. So, Y = A AND B.)

The options are Y=/ A AND B, Y= Not A, Y=f A AND NOT B, Y= NOT A AND B.
Assuming / or f are typos for A.

**If the question means Y=A AND B, none of the options match exactly.
However, if "Not A" in option b and d means "Weekend", then they are
incorrect. Let's assume the question implies: A is true if it's a weekday. B is
true if distance <= 200.

Train travel is weekday AND distance <= 200. So, A AND B. No option
directly matches this.

Option a: Y = A AND B (if / is a typo for A)

Option d: Y = NOT A AND B (weekend AND distance <= 200) - Incorrect.

There seems to be an issue with the options for 72. Closest is Y = A AND B
assuming a typo in f or /.

73. (Z = Air_travel. A = weekday. B = distance ≤200. Air travel is if day =

weekday AND distance >200. Distance >200 is NOT B.)

So, Z = A AND NOT B.

c. Z = A AND NOT B (Assuming the missing part of the option is A)

Water Heating System Questions (Q74-Q76):

Signal definitions:

 A=0: Water flow low, A=1: Water flow OK

 B=0: Hot water temp high, B=1: Hot water temp OK

 C=0: Water level low, C=1: Water level OK

74. Fault: Water level low (C=0) AND temp high (B=0). System
output F1=1 (switch off).

We need a truth table where if C=0 and B=0, then F1=1.

o A: If A=0, B=0, C=0 => F1=1. Correct.

o A: If A=1, B=0, C=0 => F1=1. Correct. This means output F1=1
whenever B=0 AND C=0, regardless of A. Let's check option A's
table: Row 1 (000): F1=1 (B=0, C=0 -> F1=1) - Correct Row 5
(100): F1=1 (B=0, C=0 -> F1=1) - Correct All other rows where
B=0 and C=0 should also have F1=1. This condition (B=0 AND
C=0 gives F1=1) is met by table A.

75. Fault: Water flow low (A=0) AND temp high (B=0). System output
F1=1.

We need F1=1 when A=0 AND B=0, regardless of C.

Let's check table A:

Row 1 (A=0, B=0, C=0): F1=1. Correct.

Row 2 (A=0, B=0, C=1): F1=0. Incorrect (should be 1).

Let's check table C:

Row 1 (A=0, B=0, C=0): F1=1. Correct.

Row 2 (A=0, B=0, C=1): F1=1. Correct.

Table C seems to fit this condition.

76. Fault: Hot water temp OK (B=1) AND water flow low (A=0) AND
water level low (C=0).

Circuit representing A=0 AND B=1 AND C=0.

This is (NOT A) AND B AND (NOT C).

o A: (NOT A OR (NOT B AND C)) AND (B NOR C). This doesn't look
right.
 o B: Looks like (A AND B AND C) ORed with something. Not right.

o C: A AND B AND C fed into an OR gate. Not right.

o D: Looks like inputs A, B, C. A is inverted (NOT A). C is inverted

(NOT C). These are ANDed with B. So (NOT A) AND B AND (NOT
C). This matches. The circuit is D. (Visual interpretation of the
logic diagram)

77. TRUE

78. TRUE

79. TRUE

80. TRUE

81. TRUE

Assembly Language Program Trace (Q82-Q89):

Initial state: ACC=0, Mem[201]=10, Mem[202]=0, Mem[203]=204,

Mem[204]=5

82. 100 LDD 201 (Load ACC with content of Mem[201]) -> ACC =
Mem[201] = 10

o c. ACC=10, 201=10, 202=0, 203=204, 204=5

83. 101 INC ACC (Increment ACC) -> ACC = 10 + 1 = 11

o d. ACC=11, 201=10, 202=0, 203=204, 204=5

84. 102 STO 202 (Store ACC to Mem[202]) -> Mem[202] = 11

o a. ACC=11, 201=10, 202=11, 203=204, 204=5

85. 103 LDI 203 (Load ACC with content of Mem[address in

Mem[203]]). Mem[203]=204. So, ACC = Mem[204] = 5

o a. ACC=5, 201=10, 202=11, 203=204, 204=5

86. 104 DEC ACC (Decrement ACC) -> ACC = 5 - 1 = 4

o b. ACC=4, 201=10, 202=11, 203=204, 204=5

87. 105 STO 201 (Store ACC to Mem[201]) -> Mem[201] = 4

o d. ACC=4, 201=4, 202=11, 203=204, 204=5

 88. 106 ADD 204 (Add content of Mem[204] to ACC) -> ACC = 4 +
Mem[204] = 4 + 5 = 9

o d. ACC=9, 201=4, 202=11, 203=204, 204=5

89. 107 STO 201 (Store ACC to Mem[201]) -> Mem[201] = 9

o a. ACC=9, 201=9, 202=11, 203=204, 204=5

90. d. All of the above

91. (Disk formatting, partition creation, disk recovery are all utility
program functions.)

If "identify all the correct answers" is possible, then a, b, c are correct. If only
one can be chosen, "None of the above" would be incorrect. This question
format is ambiguous if only one letter choice is allowed per question in the
exam. Assuming multiple can be correct as stated.

a, b, c

Complete the Sentences (Q92-Q95):

92. Data protection laws are primarily about data d. Privacy.

93. The laws concern data which is about a a. Living individual.

94. The data is held by a f. Data controller in an organization.

95. Measures should be taken to ensure that the data has c. Integrity (and is
also e. Up to date, but integrity is a core principle).

Complete the Sentences (Q96-Q98):

96. e. Entity __ something about which data is recorded...

97. c. Tuple __ the data for one row in the table

98. a. Attribute __ One of the data items for an object...

Sorting Algorithm Questions (Q99-Q100):

Initial array: [25, 34, 98, 7, 41, 19, 5]

99. The algorithm described (comparing adjacent values and swapping) is d.

Bubble sort.

100. When we have completed the first pass through the entire array (using
Bubble Sort), the c. Largest value is in the correct position (at the end of the
sorted portion).
BONUS QUESTIONS

Initial array: [25, 34, 98, 7, 41, 19, 5]

Arrays given:

A: [25, 34, 7, 41, 19, 5, 98]

B: [7, 19, 5, 25, 34, 41, 98]

C: [25, 7, 19, 5, 34, 41, 98] (Typo in doc? Or different sort depiction)

D: [7, 25, 19, 5, 34, 41, 98]

Let's trace Bubble Sort:

Initial: [25, 34, 98, 7, 41, 19, 5]

Pass 1:

Compare 25, 34 -> no swap: [25, 34, 98, 7, 41, 19, 5]

Compare 34, 98 -> no swap: [25, 34, 98, 7, 41, 19, 5]

Compare 98, 7 -> swap: [25, 34, 7, 98, 41, 19, 5]

Compare 98, 41 -> swap: [25, 34, 7, 41, 98, 19, 5]

Compare 98, 19 -> swap: [25, 34, 7, 41, 19, 98, 5]

Compare 98, 5 -> swap: [25, 34, 7, 41, 19, 5, 98]

After Pass 1: [25, 34, 7, 41, 19, 5, 98] (This is option A)

B1. The first pass: A

Pass 2 (on [25, 34, 7, 41, 19, 5, 98]):

Compare 25, 34 -> no swap

Compare 34, 7 -> swap: [25, 7, 34, 41, 19, 5, 98]

Compare 34, 41 -> no swap

Compare 41, 19 -> swap: [25, 7, 34, 19, 41, 5, 98]

Compare 41, 5 -> swap: [25, 7, 34, 19, 5, 41, 98]

(Largest two are now sorted: 41, 98)

After Pass 2: [25, 7, 34, 19, 5, 41, 98] (This is not B, C, or D directly. Option C
[25, 7, 19, 5, 34, 41, 98] looks like a later stage of pass 2 or an error in
options. Let's re-check option C's generation against the document's
description if it implies a different variant of bubble sort. The bonus options
A,B,C,D provided in the PDF seem to represent specific states. It's possible
option C [25, 7, 19, 5, 34, 41, 98] in the question's image represents the
state after the second pass according to their trace.)

If we assume the options given for B1-B4 are correct states:

B1 is A: [25, 34, 7, 41, 19, 5, 98]

If B2 is C: [25, 7, 19, 5, 34, 41, 98]

B2. The second pass: C

Pass 3 (on [25, 7, 19, 5, 34, 41, 98]):

Compare 25, 7 -> swap: [7, 25, 19, 5, 34, 41, 98]

Compare 25, 19 -> swap: [7, 19, 25, 5, 34, 41, 98]

Compare 25, 5 -> swap: [7, 19, 5, 25, 34, 41, 98]

(Largest three are sorted: 25, 34, 41, 98 - but 25 isn't the third largest)

After Pass 3: [7, 19, 5, 25, 34, 41, 98] (This is option D)

B3. The third pass: D

Pass 4 (on [7, 19, 5, 25, 34, 41, 98]):

Compare 7, 19 -> no swap

Compare 19, 5 -> swap: [7, 5, 19, 25, 34, 41, 98]

After Pass 4: [7, 5, 19, 25, 34, 41, 98] (This is not option B [7, 19, 5, 25, 34,
41, 98]. Option B is [7, 19, 5, 25, 34, 41, 98]. My pass 3 result was option D.
My pass 4 first step: [7,5,19,25,34,41,98]. The option B provided seems to be
the state after the fourth pass according to their logic.)

Let's assume the states given A, C, D, B are sequential states.

B4. The fourth pass: If the previous state was [7, 19, 5, 25, 34, 41, 98] (D),
then:

Compare 7, 19 -> no swap

Compare 19, 5 -> swap: [7, 5, 19, 25, 34, 41, 98]

This state is [7, 5, 19, 25, 34, 41, 98]. Option B is [7, 19, 5, 25, 34, 41, 98].
This is inconsistent.
Let's assume the provided options A,B,C,D under the bonus section are the
states after pass 1, pass 2, pass 3, pass 4 respectively as intended by the
question setter.

So:

B1. Pass 1 -> A: [25, 34, 7, 41, 19, 5, 98]

B2. Pass 2 -> C: [25, 7, 19, 5, 34, 41, 98]

B3. Pass 3 -> D: [7, 19, 5, 25, 34, 41, 98]

B4. Pass 4 -> B: [7, 5, 19, 25, 34, 41, 98] (My calculation for pass 4 on D
yielded this)

B4. The fourth pass: B

B5. How many passes are required for the array to be fully ordered?

Array after Pass 4 (Option B): [7, 5, 19, 25, 34, 41, 98]

Pass 5 (on [7, 5, 19, 25, 34, 41, 98]):

Compare 7, 5 -> swap: [5, 7, 19, 25, 34, 41, 98] (Now sorted)

No more swaps in the rest of this pass.

Pass 6: Would make no swaps, confirming it's sorted.

The array is sorted after 5 passes. Bubble sort typically requires at most n-1
passes for an array of n elements if optimized to stop when no swaps occur.
Here n=7.

So, 5 passes made it sorted. The 6th pass would confirm.

The question asks how many passes are required.

d. 6 (Standard Bubble Sort might run for n-1 passes, which is 6. Or it could be
5 if it stops early). Given typical implementations, it often runs n-1 passes.

The options are 5, 7, 8, 6.

After 5 passes: [5, 7, 19, 25, 34, 41, 98] - Sorted.

So, 5 passes are required.

B5. a. 5 (If the question means minimum passes to get it sorted).

If it means the number of passes an unoptimized bubble sort would always
do for an array of this size, it would be n-1 = 6 passes. Given "a. 5" is an
option, it likely refers to when the array becomes sorted.

Disclaimer: Some interpretations, especially for diagrammatic or slightly

ambiguous questions, are based on common conventions in computer
science. There might be specific nuances intended by the examiner that are
not fully captured.