CS 18000 Lecture Notes - Lecture 1: 5,6,7,8, Octal, Java Syntax
Document Summary
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, a, b, c, d, e, f: numbers as written with the base as subscript. Examples 4510, 0112, 0113: when its clear from the context, subscript is omitted, we will focus on integers. Decimal to binary from a positive integer: algorithm: series of steps to solve a problem, divide the integer by two, store the remainder, replace the integer by the quotient, repeat steps 1-3 until quotient is zero. 1: standard representation for signed integers in modern computers, the left most bit represents the sign. 0 for positive and 1 for negative: positive numbers are represented as shown before, what about negative numbers, find the binary representation of the absolute value, flip the bits (0 1)(1 0, add 12 to it. Why we care: know how is information represented in the computer and its capabilities, numbers can represent many things.