wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

OCR H446 - 1.4 Data Types and Structures - Computer Systems - 01

Total questions: 78

Worksheet time: 3hrs 35mins

Name
Class
Date
1.

The following is an example of which type of data: "He110!"

a)

String

b)

Integer

c)

Float/Real

d)

Boolean

2.

The following is an example of which type of data: 12345

a)

String

b)

Integer

c)

Float/Real

d)

Boolean

3.

The following is an example of which type of data: 1.2345

a)

String

b)

Integer

c)

Float/Real

d)

Boolean

4.

The following is an example of which type of data: True

a)

String

b)

Integer

c)

Float/Real

d)

Boolean

5.

Convert 117 to hexadecimal

(a)  

6.

Convert 61 to hexadecimal

(a)  

7.

Convert 212 to hexadecimal

(a)  

8.

Convert #7B to Denary

(a)  

9.

Convert #AC to Denary

(a)  

10.

Convert #BB to Denary

(a)  

11.

Convert #AB5 to Denary

(a)  

12.

Convert #2BE to Denary

(a)  

13.

When a binary number is shifted two places to the left the effect on the result is?

a)

The result is 4 times larger.

b)

The result is 2 times larger.

c)

The result is 4 times smaller.

d)

The result is half the original.

14.

When a binary number is shifted one place to the right the effect on the result is?

a)

The result is 4 times larger.

b)

The result is 2 times larger.

c)

The result is 4 times smaller.

d)

The result is half the original.

15.

Complete a 3 place left shift on: 10101011

(a)  

16.

Complete a 1 place left shift on: 01010110

(a)  

17.

Complete a 2 place right shift on: 01010110

(a)  

18.

Convert this binary to denary using Sign and Magnitude: 10101011

(a)  

19.

Convert this binary to denary using Sign and Magnitude: 01010110

(a)  

20.

Convert this denary to binary using Sign and Magnitude: -117

(a)  

21.

Convert this denary to binary using Sign and Magnitude: -61

(a)  

22.

Convert this denary to binary using Two's Complement: -27

(a)  

23.

Convert this denary to binary using Two's Complement: -117

(a)  

24.

Convert this binary to denary using Two's Complement: 11110111

(a)  

25.

Convert this binary to denary using Two's Complement: 10011100

(a)  

26.

Convert this binary to denary using Two's Complement: 10101011

(a)  

27.

Convert this binary to denary using Two's Complement: 00011100

(a)  

28.

Convert this floating-point binary to denary using Two's Complement, they have a 10-bit mantissa and a 6-bit exponent:

0.111001110 000110

(a)  

29.

Convert this floating-point binary to denary using Two's Complement, they have a 10-bit mantissa and a 6-bit exponent:

0.110010101 000111

(a)  

30.

Convert this floating-point binary to denary using Two's Complement, they have a 10-bit mantissa and a 6-bit exponent:

1.011011101 000111

(a)  

31.

Convert this floating-point binary to denary using Two's Complement, they have a 10-bit mantissa and a 6-bit exponent:

1.011110110 000101

(a)  

32.

Convert this denary number to floating-point binary using Two's Complement, they have a 10-bit mantissa and a 6-bit exponent:

-1.5

(a)  

33.

Convert this denary number to floating-point binary using Two's Complement, they have a 10-bit mantissa and a 6-bit exponent:

-13.875

(a)  

34.

Convert this denary number to floating-point binary using Two's Complement, they have a 10-bit mantissa and a 6-bit exponent:

123.25

(a)  

35.

Convert this denary number to floating-point binary using Two's Complement, they have a 10-bit mantissa and a 6-bit exponent:

73.25

(a)  

36.

Normalise the floating-point binary using Two's Complement, they have a 8-bit mantissa and a 4-bit exponent:

0.0000110 0001

(a)  

37.

Normalise the floating-point binary using Two's Complement, they have a 8-bit mantissa and a 4-bit exponent:

1.1110011 0011

(a)  

38.

Normalise the floating-point binary using Two's Complement, they have a 8-bit mantissa and a 4-bit exponent:

0.0110101 0011

(a)  

39.

Normalise the floating-point binary using Two's Complement, they have a 8-bit mantissa and a 4-bit exponent:

10111.001 0010

(a)  

40.

Add the following binary numbers together:

1111 + 1001

(a)  

41.

Add the following binary numbers together:

10100110 + 110011

(a)  

42.

Subtract the following binary numbers together:

10000 - 1111

(a)  

43.

Subtract the following binary numbers together:

10101010 - 10111

(a)  

44.

Add the following floating point binary numbers together:

0.1100 001 + 0.1000 010

(a)  

45.

Subtract the following floating point binary numbers together:

0.1101 010 - 0.1010 001

(a)  

46.

Which logic gate is pictured?

a)

NOT

b)

AND

c)

OR

d)

XOR

47.

Which logic gate is pictured?

a)

NOT

b)

AND

c)

OR

d)

XOR

48.

Which logic gate is pictured?

a)

NOT

b)

AND

c)

OR

d)

XOR

49.

Which logic gate is pictured?

a)

NOT

b)

AND

c)

OR

d)

XOR

50.

Which logic gate is pictured?

a)

NOT

b)

NAND

c)

NOR

d)

XOR

51.

Which logic gate is pictured?

a)

NOT

b)

NAND

c)

NOR

d)

XOR

52.

Which logic gate does the symbol represent?

a)

NOT

b)

AND

c)

OR

d)

XOR

53.

Which logic gate does the symbol represent?

a)

NOT

b)

AND

c)

OR

d)

XOR

54.

Which logic gate does the symbol represent?

a)

NOT

b)

AND

c)

OR

d)

XOR

55.

Which logic gate does the symbol represent?

a)

NOT

b)

AND

c)

OR

d)

XOR

56.

Which logic gate does the symbol represent?

a)

NOT

b)

NAND

c)

NOR

d)

XOR

57.

Which logic gate does the symbol represent?

a)

NOT

b)

NAND

c)

NOR

d)

XOR

58.

Which Simplifying Boolean Algebra Method is shown below:

¬(¬A) = A

a)

Double Negation

b)

Associative

c)

Absorption

d)

Commutative

e)

Distributive

59.

Which Simplifying Boolean Algebra Method is shown below:

(A ˄ B) ˄ C = A ˄ (B ˄ C)

(A ˅ B) ˅ C = A ˅ (B ˅ C)

a)

Double Negation

b)

Associative

c)

Absorption

d)

Commutative

e)

Distributive

60.

Which Simplifying Boolean Algebra Method is shown below:

A ˅ (A ˄ B) = A

A ˄ (A ˅ B) = A

a)

Double Negation

b)

Associative

c)

Absorption

d)

Commutative

e)

Distributive

61.

Which Simplifying Boolean Algebra Method is shown below:

A ˄ B = B ˄ A

A ˅ B = B ˅ A

a)

Double Negation

b)

Associative

c)

Absorption

d)

Commutative

e)

Distributive

62.

Which Simplifying Boolean Algebra Method is shown below:

A ˄ (B ˅ C) = (A ˄ B) ˅ (A ˄ C)

A ˅ (B ˄ C) = (A ˅ B) ˄ (A ˅ C)

a)

Double Negation

b)

Associative

c)

Absorption

d)

Commutative

e)

Distributive

63.

Which Simplifying Boolean Algebra Method is shown below:

A ˄ (B ˅ C) = (A ˄ B) ˅ (A ˄ C)

A ˅ (B ˄ C) = (A ˅ B) ˄ (A ˅ C)

a)

Double Negation

b)

Associative

c)

Absorption

d)

Commutative

e)

Distributive

64.

Which Simplifying Boolean Algebra Method is shown below:

¬(A ˅ B) = ¬A ˄ ¬B

¬(A ˄ B) = ¬A ˅ ¬B

a)

De Morgan's Rule

b)

Associative

c)

Absorption

d)

Commutative

e)

Distributive

65.

Which statement is a simplification of the boolean algebra in the Karnaugh Map.

a)

C

b)

C˄D

c)

A

d)

A˄B

66.

Which statement is a simplification of the boolean algebra in the Karnaugh Map.

a)

¬A ˅ C

b)

A ˄ C

c)

A ˅ C

d)

¬A ˄ C

67.

Which statement is a simplification of the boolean algebra in the Karnaugh Map.

a)

(A ˄ B) ˅ (A ˄ C)

b)

(A ˄ A) ˅ (B ˄ C)

c)

(A ˅ B) ˄ (A ˅ C)

d)

(A ˅ A) ˄ (B ˅ C)

68.

Which statement is a simplification of the boolean algebra in the Karnaugh Map.

a)

(C ˄ ¬B) ˅ (B ˄ D)

b)

(C ˄ B) ˅ (¬B ˄ D)

c)

(C ˄ B) ˅ ¬(B ˄ D)

d)

¬(C ˄ B) ˅ (B ˄ D)

69.

Identify what is shown in the image?

a)

Half-Adder

b)

Full-Adder

c)

Flip-Flop

d)

D-type Flip-Flop

70.

Identify what is shown in the image?

a)

Half-Adder

b)

Full-Adder

c)

Flip-Flop

d)

D-type Flip-Flop

71.

Identify what is shown in the image?

a)

Half-Adder

b)

Full-Adder

c)

Flip-Flop

d)

D-type Flip-Flop

72.

Identify what is shown in the image?

a)

Half-Adder

b)

Full-Adder

c)

Flip-Flop

d)

D-type Flip-Flop

73.

Which character set is Single language and 7-bit

a)

ASCII

b)

Extended ASCII

c)

UNICODE

74.

Which character set is Multilingual and can be between 8 and 32 bit?

a)

ASCII

b)

Extended ASCII

c)

UNICODE

75.

Which data structure is described: Stores multiple pieces of data under one name, this can come in 1D, 2D and 3D.

a)

Array

b)

Stack

c)

Queue

d)

Linked List

76.

Which data structure is described: Stores data in as Last In First Out.

a)

Array

b)

Stack

c)

Queue

d)

Linked List

77.

Which data structure is described: Stores data in as First In First Out.

a)

Array

b)

Stack

c)

Queue

d)

Linked List

78.

Which data structure is described: Stores data in a file structure where each node links to another using a pointer to the next node.

a)

Array

b)

Stack

c)

Queue

d)

Linked List

Similar Resources on Wayground

Bank Soal KRPL 12 RPL

80 questions

Bank Soal KRPL 12 RPL

quiz

Worksheet

•

12th Grade

IT Fundamentals CompTIA practice

75 questions

IT Fundamentals CompTIA practice

quiz

Worksheet

•

10th - 12th Grade

ICT CBT ASSESSSMENT YEAR 12

80 questions

ICT CBT ASSESSSMENT YEAR 12

quiz

Worksheet

•

12th Grade

Стартовая диагностика

75 questions

Стартовая диагностика

quiz

Worksheet

•

9th - 12th Grade

Level Determination Quiz

82 questions

Level Determination Quiz

quiz

Worksheet

•

12th Grade

GCSE Computer Science Easter Recap

80 questions

GCSE Computer Science Easter Recap

quiz

Worksheet

•

9th - 12th Grade

SOAL OLIMPIADE JARINGAN MIKROTIK - 1

77 questions

SOAL OLIMPIADE JARINGAN MIKROTIK - 1

quiz

Worksheet

•

12th Grade

Final Question Bank 24-25

81 questions

Final Question Bank 24-25

quiz

Worksheet

•

9th - 12th Grade