Computing quiz half term Flashcards

(24 cards)

1
Q

Which one of these are NOT Boolean operators?
A) AND
B) ALSO
C) OR
D) NOT

A

B) Also

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Define a Venn Diagram

A

A series of overlapping circles that represents logic in a graphic.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Define a Truth Table.

A

A table of the outputs from all possible combinations of input.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Is “PRESENT/ABSENT” typically used to represent inputs or outputs in circuits?

A

No

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How many inputs does the NOT gate have?

A

One

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the symbol for an AND gate?

A

A D-shaped symbol.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the symbol for a NOT gate?

A

A triangle with a small circle at the output.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How do OR and AND gates function?

A

The OR gate provides an output if at least one input is on. The AND gate provides an output only if both inputs are o

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a combination of connected logic gates called?

A

A logic circuit

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Does the NOT gate have one symbol?

A

Yes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is an Algorithm?

A

A set of instructions that achieve a specific goal.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How do you reduce the number of instructions in a program?

A

Use repeat commands

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is a repeat command that is put in other repeat commands called?

A

A nested loop.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the difference between a Lossy and Lossless Compression

A

Lossy means the original data will lose some quality once it is decompressed, Lossless means the original data will be restored exactly once decompressed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is an ASCII Table?

A

A table that contains characters and the binary they represent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What does binary representation represent?

A

Alphabetical letters or numbers

17
Q

Abstraction is?

A

Where we hide or remove details that aren’t important to the problem

18
Q

Decomposition is?

A

Breaking down a problem into smaller problems that are more manageable

19
Q

What is a tiny, coloured square that makes up a big image called?

20
Q

Can Network Nodes and Edges vary based on the specific diagram provided?

21
Q

What does the Shortest path in a network depend on?

A

It depends on the specific connections.

22
Q

How to send a packet of data through a network?

A

Crucial information includes the destination address and the packet number.

23
Q

What are Bits for image storage?

A

A black and white image with a width of 10 pixels and a height of 10 pixels will need 100 bits to store the data.

24
Q

Conclude if Tim is a dog, he has two legs

A

He nod a dog.