COSC 221 Computer organization
What is a maxterm of F(A,B,C,D)? what is the meaning of a maxterm?
A+B+C+D a truth table being 0
What is the midterm of F(A,B,C,D)? what is the meaning of a midterm?
A,B,C,D each midterm corresponds to truth table row being 1
What is the practical foundation of modern computers?
Ivan newman machine
What does CPOS stand for?
canonical product of sums
What does CSOP stand for?
canonical sum of products
What is the advantage of BCD number system?
easy to convert for humans
What is a feasible foundation of modern computers?
electronics
Why art processes in general are very hard?
multi-answers, no precedure
Why simplification is harder than proof?
no RHS to cross reference
What is the advantage of 2's compliment?
no need for subtraction
What is the rationale of 2's compliment expression?
positive and negative values equals 0
Why proof by theorem is so hard?
too many choices, forms, and art proccess
What is the theocratic foundation of modern computers?
universal turing machine
What is the approximate decimal value of (10010010011)2? why?
2^0 to 2^10
How many switching functions F(A,B,C,D) has?
2^16= 65 thousand
How many binary digits is needed for expressing (48197)10? why?
2^16= 65,536 because 2^15 falls short in representing that number
How many switching functions F(A,B,C,D,F,G) has?
2^2^7=2^128
How many distinct maxterms F(AA,BB,CC,DD) has?
2^4= 16
How man rows a truth table of F(AA,BB,CC,DD) has?
2^4=16
How many distinct midterms F(AA,BB,CC,DD) has?
2^4=16
How many rows if truth table for f(A,B,C,D,E,F,G)?
2^7= 128
What is the binary number for 32k
32 = 2^5
What is the question this course is designed to answer?
How do computers work?
4 set of complete boolean operators.
and, not or, not nand nor
What are the three fundamental boolean operators?
and, or, not
What is the "key idea" of our switching function approach?
assign a number to an expression
