CISC 101 Lecture Notes - Lecture 1: Von Neumann Architecture, Guido Van Rossum, Arithmetic Logic Unit
11 Aug 2015
School
Department
Course
Professor
Document Summary
The sum output = xor, carry output = and; requires 10 transistors: full-bit adder requires 22 transistors (2 half-bit adders, 1 or) 90s; he has the title benevolent dictator for life . Precedence rules: ** (exponents, unary (negative or not, binary boolean (true or false, logical: and, logical: or, = (assignment) Operators: > < >= <= == != and or, division always results in float, floor division results in int! Console i/o: input( prompt: ) always returns a string. Escape characters: used to control how strings are displayed when using print() function, \n, , \", \"", \ Comparing strings with boolean operators: depends on position in ascii table, (low) str(#s), upper case, lower case (high, aaa < aaaa true, a < a true, abc == abc false. Raising and catching exceptions: syntax errors will result in the interpreter not finishing its interpretation, run-time errors are errors that happen when running the program, an exception is a run-time error.
