Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CSCI 1120 > Terms > Flashcards

Terms Flashcards

1
Q

What are the 8 primary logic gates & their functions?

A

AND, OR, XOR, NOT, NAND, NOR, XNOR & BUFFER.
AND: returns 1 if both inputs are 1.
OR: returns 1 if either imput is 1.
XOR: returns 1 if only one of the inputs is 1.
NOT: negates the imput.
NAND: negates the AND gate.
NOR: Negates the or gate.
XNOR: negates the XOR gate.
BUFFER: simply passes input into output without change

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

What does Base 10 notation mean?

A

It represents the decimal number system

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

What is Hexadecimal?

A

A base 16 number system: 1,2,3,4,5,6,7,8,9,A,B,C,D,E,F

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

Define code

A

In computer science we define codes as being a unique algorithm that represents symbols from some source alphabet through encoded strings
Essentially a mapping from one string of symbols to other symbols

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

How can you identify even numbers in binary? Multiples of 4?

A

Even always ends in 0, multiples of 4 always end in 00

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

How many bits are needed to represent 8? 16?

A

8 = 2^3 therefor you need 3 bits.

16=2^ therefor you need 4 bits

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

What is MSB? LSB?

A

Most significant bit, Least significant bit

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

What are the 9 main laws of Boolean algebra?

A 
Identity
Complement
Annulment
Idempotent
Double negation
De morgans theorem
Commutative
Distributive
Absorption
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the identity law?

A

A + 0 = A

A . 1 = A

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

What is the complement law?

A

A + NOT A = 1

A . NOT A = 0

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

What is the Annulment law?

A

A + 1 = 1

A . 0 = 0

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

What is the Idempotent law?

A

A . A = A

A + A = A

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

What is double negation?

A

NOT NOT A = A

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

What is deMorgans Theorem?

A

NOT A . NOT B = NOT (A +B)

NOT(A . B) = NOT A + NOT B

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

What is the commutative law?

A

A+B = B+A

A . B = B . A

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

What is the distributive law?

A

A(B+C) = AB + AC

allowing the factoring of an expression, are the same as in ordinary algebra.

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

What is the absorption law?

A

A+ A . B = A
NOT A + A . B = NOT A + B
A + NOT A . B = A + B

18
Q

What is a truth table?

A

shows each possible input combination to the gate or circuit with the resultant output depending upon the combination of these input(s).

19
Q

How can you tell how many rows a TT needs based on the # of variables?

A

a truth table with x variables with have 2^x rows

20
Q

What is the Fmaj function?

A

In Boolean logic, the majority function is the Boolean function that evaluates to false when half or more arguments are false and true otherwise, i.e. the value of the function equals the value of the majority of the inputs.

21
Q

What is a MUX?

A

Multiplexer. The multiplexer, shortened to “MUX” or “MPX”, is a combinational logic circuit designed to switch one of several input lines through to a single common output line by the application of a control signal

22
Q

What is a functionally complete set?

A

A set of operators with which we can implements all possible boolean functions

23
Q

What is a decoder?

A

a binary decoder is a combinational logic circuit that converts binary information from the n coded inputs to a maximum of 2^n unique outputs

24
Q

What is an electrical relay?

A

A relay is an electrically operated switch. It consists of a set of input terminals for a single or multiple control signals, and a set of operating contact terminals.

25
Q

What is an electromagnet?

A

Electromagnets are made of coils of wire with electricity passing through them. Moving charges create magnetic fields, so when the coils of wire in an electromagnet have an electric current passing through them, the coils behave like a magnet.

26
Q

What is a half adder?

A

A half adder is a type of adder, an electronic circuit that performs the addition of numbers. The half adder is able to add two single binary digits and provide the output plus a carry value. It has two inputs, called A and B, and two outputs S (sum) and C (carry).

27
Q

What is an algorithm?

A

a process or set of rules to be followed in calculations or other problem-solving operations

28
Q

What is ASCII?

A

American Standard Code for Information Interchange. It’s a character encoding standard for electronic communication. ASCII codes represent text in computers, telecommunications equipment, and other devices.

29
Q

What is a bit? A Byte? (bonus: nybble)

A

The bit is the most basic unit of information in computing and digital communications. The name is a contraction of binary digit. The bit represents a logical state with one of two possible values.
A byte is a group of 8 bits
Nybble is a group of 4 <3 (rarely used)

30
Q

What is positional representation?

A

A positional (numeral) system is a system for representation of numbers by an ordered set of numerals symbols (called digits) in which the value of a numeral symbol depends on its position.

eg

1345 //number
3210 //index

(1base^3) + (3base^2) + (4base^1) + (5base^0)

31
Q

What is a radix/base?

A

the base of a system of numeration. For decimal number system the radix is 10, hex its 16, octal its 8 etc

32
Q

What are the powers of 2 up to 15?

A 
2^0= 0
2^1= 2
2^2= 4
2^3= 8
2^4= 16
2^5= 32
2^6= 64
2^7= 128
2^8= 256
2^9= 512
2^10= 1024
2^11= 2048
2^12= 4096
2^13= 8192
2^14= 16384
2^15= 32768
33
Q

What is a Minterm?

A

a minterm is a logical expression of n variables that employs only the complement operator and the conjunction operator.

eg

input / minterm
ABC
001 = NOT A * NOT B * C
011 = NOT A * B * C

34
Q

What is disjunction? Conjunction?

A 
disjunction = OR operation
conjunction = AND operation
35
Q

What is a circuit/gates “dual”?

A

a different gate/combination of gates that creates the same output. same truth table

36
Q

How are hex numbers written?

A

Prefix: 0x
Suffix: F

decimal / hex
10 = A
11 = B
12 = C
13 = D
14 = E
15 = F
37
Q

What is minterm notation?

A

F = ∑ m(2,6,7)

where the numbers in the brackets correspond with columns in a functions truth table that return a 1

38
Q

What does ‘universal gate’ mean?

A

A universal gate is a gate which can implement any Boolean function without need to use any other gate type. The NAND and NOR gates are universal gates

39
Q

What is Signed Magnitude representation?

A

When the MSB of a binary digit is used to represent a binary numbers sign.

40
Q

What is 1’s complement notation?

A

When the MSB represents the sign of a binary AND the magnitude bits are all negated

41
Q

What is the 2’s complement law?

A

MSB represents -8 (if we are using 4 bits) allowing us to represent, add and subtract FIXED WIDTH negative and positive binary numbers

CSCI 1120 (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions