# Class Notes for CSE 241 at University at Buffalo (UB)

- 11 Results
- About UB

## CSE 241 Lecture Notes - Lecture 8: Parity Bit, Karnaugh Map, George Boole

1

Last class: boolean algebraic simplification k-map plots minterms are plotted on a map. This map has 1 cell/minterm i. e. f(x,y) 2 variable map. 22 = 4

View Document## CSE 241 Lecture Notes - Lecture 16: Logic Gate, Xnor Gate, Canonical Normal Form

0

Building combinational circuits using a mux mux ____ log2n selection lines n_____ n x 1. ___ selection lines = s2, s1, s0 inputs = m0 . m7 f(a,b,c) = (

View Document## CSE 241 Lecture 10: 2.20.17 lecture 10 K-Map Simplification

0

Simplify to minimum number of terms and minimum number of literals. K-map simplification f(a, b, c) = (0, 2, 3, 4, 6) 5 (ii) as large a group as possib

View Document## CSE 241 Lecture Notes - Lecture 13: Integrated Circuit, Truth Table

0

Combinational circuit (cc) n ______ cc _____ f() inputs output. Output is dependent only on the inputs for a given circuit cc synthesis: problem statem

View Document## CSE 241 Lecture Notes - Lecture 5: Logic Gate, Algebraic Expression

2

{0, 1: terms boolean algebraic terms need boolean operators: f(x,y,z) {or, and, not} x . y . z x + y + z product term (also written without multiplicat

View Document## CSE 241 Lecture Notes - Lecture 2: Number One Crossbar Switching System, Decimal Mark

2

Example: determine the base of the numbers such that an equation is true. (22+4) + (11+7) = (44) 44 = 44 (24)b + (17)b = (40)b (2xb + 4x1) + (1xb + 7x1

View Document## CSE 241 Lecture Notes - Lecture 2: 5,6,7,8, Radix, George Boole

1

Dice 6 sides, each with a number. Pack of cards to represent this to a computer, we use a number 1-6 to represent this to a computer, we use 1-52. We c

View Document## CSE 241 Lecture Notes - Lecture 4: George Boole, Commutative Property, Negative Number

4

The laws of thought: today we are obsessed with ai intelligent thought. Established boolean algebra: binary logic things are either true (x) or false (

View Document## CSE 241 Lecture Notes - Lecture 6: And Gate, Nand Gate, Or Gate

0

The steps in the design and implementation of a boolean function: problem statement, truth table, sum of minterms expressions. 1 output: bcd binary cod

View Document## CSE 241 Lecture Notes - Lecture 3: Signed Number Representations, Number Sign, Statistical Hypothesis Testing

1