Please enable JavaScript.

Coggle requires JavaScript to display documents.

ASC (Bit-wise Operations (AND (make smth 0), OR (make smth 1), TEST (tests…

- - - - jump
        
        "if"
      - JMP
        
        jump to relative position
    - - "above"
        
        CF=1
        
        X > Y
    - - Equals
        
        ZF=0
        
        X == Y
    - - below
        
        CF=0
        
        X < Y
    - - if carry==1
        
        CF = 1
- - - - AL -> AX
    - - AX -> EAX
    - - AX -> DX:AX
    - - EAX -> EDX:EAX
    - - mov AH,0 ; pentru conversia AL → AX
      - mov DX,0 ; pentru conversia AX → DX:AX
      - mov EDX,0 ; pentru conversia EAX → EDX:EAX
  - - - sub
      - mul
      - div
      - add
    - - idiv
      - imul
    - - adc
      - sbb
- - - - user defined
    - - BufferError
      - ArithmeticError
        
        ZeroDivision
        
        FloatingPointer
        
        Overflow
      - LookupError
    - - Raised when an assert statement fails.
    - - Raised when a sequence subscript is out of range
    - - Raised when the input() function hits an end-of-file condition (EOF) without reading any data
    - - Not currently used, (unalocated pointer)
    - - Raised when a mapping (dictionary) key is not found in the set of existing keys
    - - It is raised when the interpreter detects that the maximum recursion depth is exceeded
    - - the rest
- - - - 1 \ 2 \ 3
      - 01 10 11
  - - - base to be converted from < base to be converted to
        
        134,21(5)
        
        15^2 + 35^1 + 4 + 25^-1 + 15^-2 =(8) 31 + 17 + 4 + 0.31 + 0.02 = 54.33 (8)
    - - Nb = N`g = N``h
        
        de exemplu din baza 5 in 2/4 si apoi in baza 16
    - - base to be converted from > base to be converted to
        
        For the integer part we divide
        For the decimal part we multiply
        
        0,77(16) 7(next base)= 3,41(16)
        0,41 7 = 1,C7
        we take the integer part of the results and form the decimal part
        =xx,31
        
        We take the quotient and then the remnants in a high to least significant order
    - - 29 = 16 + 8 + 4 + 1 = 2^4 + 2^3 + 2^2 + 2^0 = 11101
  - - - 101521(7)
  - - - if b + m - s >= 0
        
        d = b+m-s
      - else
        
        d = (base) + b+m-s | bi+1 = -1
  - - - for negative numbers = 111..1 - X
    - - 2^n - X
    - - you get a number: xxx,yy
        
        convert xxx to binary = bbbbbb
        
        for the mantisa to be > 1
        
        1,bbb = bbbbb *2^(exponent)
        Ex:
        1,10110000 =110110000 * 2^8
        
        if single precision
        
        c = 127 + exponen
        
        1 more item...
        
        if double precision
        
        c = 1023 + exponent
        
        1 more item...
        
        for mantisa < 1
        
        0,bbbb = bbb *2^e
        
        add ,bbbb in the high part of M
        
        Without the integer part!!!
        
        convert yy to binary to as high of a precision as you have space left in M after inserting xxx
      - number will be stored in either 32b or 64b
      - in a |S|C|M| format
        
        ex 1|10101011|100010101010.....0
- - - - negation
    - - disjunction
    - - conjunction
    - - implication
    - - equivalence
    - - XOR
    - - all symbols & meanings
    - - NAND
    - - NOR
    - - truth table
  - - - ⊨
        
        if all interpretations are true
    - - all interpretations are false