CPSC 355 Lecture Notes - Lecture 10: Octal, 64-Bit Computing, Truth Table

• School: University of Calgary
• Department: Computer Science
• Course: CPSC 355
• Professor: Leonard Manzara

Document Summary

Cpsc 355 - lecture 10 oct 3rd. The sign-magnitude and o(cid:374)e"s co(cid:373)ple(cid:373)e(cid:374)t representations are also possible: but are awkward to handle in hardware, have two zeroes: +0 and -0, rarely used today. , 9, a, b, c, d, e, f. Are commonly used as a shorthand for denoting bit patterns: each hex digit corresponds to a particular 4-bit pattern: May be used as shorthand for denoting bit patterns: each digit corresponds to a 3-bit pattern, eg: 0756. Linux on armv8 in aarch64 uses the lp64 data model long integers and pointers are 64-bits long. Size in bits c keyword char short int int long int, void *(pointer) I(cid:374) c, use the (cid:862)u(cid:374)sig(cid:374)ed(cid:863) ke(cid:455)word to de(cid:374)ote u(cid:374)sig(cid:374)ed i(cid:374)tegers: eg: unsigned int x, eg: unsigned char y; Manipulate one or more bits in a register. Form (64-bit): and xd, xn, xm: eg: mov x19, 0xaa mov x20, 0xf0 and x21, x19, x20. // 1010 0000: note that 0xf0 form a bitmask.