CPSC 121 Chapter 1: cora-studypack
38
CPSC 121 Full Course Notes
Verified Note
38 documents
Document Summary
__ __ __ __ __ x n x n-1 x 2 x 1 x 0. Bit : a single binary digit ( __ ) Byte : 8 bits ( __ __ __ __ __ __ __ __ ) # of values as fxn of digits (n) Divide by base (2) & note remainders until you reach 0. Decimal multiply each digit by power of base (2), then sum. Convert to binary first, then convert binary to decimal. Convert each 4-bit binary value to 1 hexadecimal value. Convert to binary first, then convert binary to hexadecimal. P ^ q prove p and prove q. P v q prove p or prove q. Let x be an arbitrary element of d. Assume ~q and prove ~p (~q -> ~p) Steps for predicate logic proofs: remove quantifiers outside-in, choose values based on outer universals (not inner). e. g. x d, y e, z f, p(x, y, z)
