Primitive Types, Arithmetic Expressions, Order of Operations

Primitive Type:
Arithmetic Expression:
Order of Operation:

Note:

  • 2.1 + 2.2 != 4.3 because Python evaluates to 4.300000000000001. This is due to the binary addition of these values and approximations in the binary values of the equivalent decimal values. Therefore, checking for exact equality is not recommended for values of this type.
  • -15 // 10 = -2 because Python use floor operation for Integer division (-1.5 becomes -2)
  • 3 * 10 ** 2 = 300. Operators that have the same precedence are applied left to right except for exponentiation. Exponentiation is applied right to left. Exponentiation binds more strongly than multiplication
  • 5.0 == 5 is True, 1 == True is True, 0 == False is True, 1.0 == True is true. Python equality is strict by default


Comments

Post a Comment

Popular posts from this blog

Conditional Statements

Image
Relational Operators Boolean Operators: and, or, and not Rule of precedence: Arithmetic > Relational > Boolean Short-circuit evaluation: Boolean expression involving 'and', if first operand evaluates to False, Python stops evaluation even if some operands have not been evaluated yet and the entire expression is considered to be False. Similarly for Boolean expression involving 'or' and one of the operands is True
Read more

6.00.1x - Week 2

Image
2.3.1 Simple Algorithms slice string using: start:stop:step s[::-1] reverse the string string is immutable 2 ways to write for loop: "for char in s" "for index in range(len(s))" 2.3.2 Approximate Solutions Exhaustive enumeration start with initial guess step: any small number, takes many steps 2.3.3 Bisection Search takes log time to get an answer works well with problem with "ordering" property: value increases as input increases print("Hi", end=' ') print("there") will print "Hi there" 2.3.4 Floats and Fractions This is why sometimes we get weird result because in binary you can get close to it, but not exact Should not use == to compare float, instead use abs(a-b) < epsilon 2.3.5 Newton-Raphson Algorithm Approximation algorithm to find roots of a polynomial: g -> g - p(g)/p'(g) Even better than Bisection search
Read more

Basic Machine Architecture

Image
Basic Machine Architecture includes: Memory: store/load instructions Arithmetic Logic Unit (ALU): perform primitive operations Control Unit: has a program counter to keep track of where things are and ask the ALU to perform operations. It is initially pointed to the first instruction Below are basic steps: Read in instruction, ie. interpreter translate codes into instruction steps and stores inside Memory Interpreter execute first instruction pointed by program counter in Control Unit First instruction: runs through ALU, perform primitive operations, then stores it back into Memory Program counter increases by 1, ie. go to the next instruction Every once in a while, one of the instruction is a Test. If Test is true, it will change the Program Counter which allows the machine to run to a different instruction (whether back or forward), ie. changing where we are in the code Reaches the point where we're done, then it will Output Turing showed that using 6 primit...
Read more