ENDTERM REVIEWER Flashcards

(47 cards)

1
Q

is a numbering system that represents numeric values using two unique digits (0 and 1)

A

binary system

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

the simplest form of computer code or programming data. It is represented entirely by a binary system of digits consisting of a string of consecutive zeroes and ones

A

binary code

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

the way that most computersand computerized devices ultimately send, receive, and store information.

A

binary code

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

What base does binary use?

A

base 2

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

the language computers use (computer processor instructions)

A

binary code

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

2 digits - 1’s and 0’s (1 = on, 0 = off)

A

2 digits

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

smallest component of a computer word

A

bit

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

measure computer memory and storage

A

bits and bytes

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

1 byte

A

8 bits

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

symbols, letters and numbers

A

keyboard characters

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

1 gigabyte is equal to

A

1000 Megabytes or billion bytes

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

1 kilobyte is equal to

A

1000 bytes

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

1 megabyte is equal to

A

1000 kilobytes or million bytes

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

1 terabyte is equal to

A

1000 gigabytes or trillion bytes

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

A set of standards developed by computer
manufacturers using Binary Code

A

ASCII

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

a continuous signal that varies in amplitude or
frequency with the information being transmitted

A

analog

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

representation of some other time varying quantity

A

signals

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

what does ASCII stand for?

A

American standard code for information interchange

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

what is a binary digit

20
Q

a number expressed in the base-2 numeral system or binary numeral system

A

binary number

21
Q

a transformation consisting of a translation combined with a reflection about a plane parallel to the direction of the translation.

A

glide reflection

22
Q

a pattern that extends infinitely to the left and right in such a way that the pattern can be mapped onto itself by a horizontal translation.

A

frieze pattern or strip pattern

23
Q

180 degrees

24
Q

a Swiss mathematician who is thought to be one of the greatest and most productive mathematician of all time.

A

leonhard euler, 1707-1783

25
it deals with the relationship between objects
graph theory
26
objects that are represented by dots or points are called
vertices
27
objects are related and represented by a line segment or a curve that connects them are called
edges
28
a set of vertices (points or dots) and edges (line segment or curves)
graph
29
it refers to the number of edges that emanate from the vertex
degree of vertex
30
it is a movement from one vertex to other vertices passing through their edges
walk in graph
31
it is a walk in graph that starts and ends on the same vertex
circuit
32
it is a circuit that transverses all the edges at once
eulerian circuit
33
a graph is eulerian if and only if all vertices of the graph are of even degrees
eulerian circuit theorem
34
it is a walk in the graph transversing all edges once, without returning to the starting vertex
eulerian wall/path
35
a path that must pass through each vertex of a graph once and only once
hamilton path
36
a circuit that must pass through each vertex of a graph once and only once
hamilton circuit
37
the number of votes needed to pass a measure
qouta
38
it must be over half the total weights and cannot be more than total weight
qouta
39
the number of votes controlled by a voter
weight of a voter
40
a set of voters each who votes the same way, either for or against a resolution
coalition
41
a set of voters whose total votes is greater than or equal to the qouta
winning coalition
42
a set of voters whose total votes in less than the qouta
losing coalition
43
a voter whose departure from the winning coalition makes it a losing coalition
critical voter
44
a voter who has a weight that is greater than or equal to the qouta
dictator
45
a voter has no power and never a critical voter
dummy
46
the number of possible coalitions on n voters is
2n-1
47
determines the power of the voters in a weighted voting system
banzhaf power index