CS 18000- Midterm Exam Guide - Comprehensive Notes for the exam ( 16 pages long!)

89 views16 pages

Document Summary

Algorithm: a step-by-step series of instructions to solve a problem (needs to be precise not ambiguous and has to end) Abstraction: the creation of a concept from specific examples (cid:894)e(cid:454)a(cid:373)ple: the (cid:272)o(cid:374)(cid:272)ept (cid:862)(cid:373)ouse(cid:863) (cid:272)o(cid:374)sists of se(cid:374)sors, (cid:449)ires, a(cid:374)d (cid:271)utto(cid:374)s (cid:449)hi(cid:272)h are so(cid:373)e esse(cid:374)tial properties of a (cid:862)(cid:373)ouse(cid:863)(cid:895) Von neumann architecture: underlying structures of virtually all computers including memory, cpu, and input/output devices. Number systems: a s(cid:455)ste(cid:373) (cid:449)here a (cid:374)u(cid:373)(cid:271)er"s positio(cid:374) (cid:449)here the de(cid:272)i(cid:373)al poi(cid:374)t deter(cid:373)i(cid:374)es its (cid:448)alue (each system multiplies or divides value from a base) Systems include decimal (base 10, goes from 0-9), binary (base 2), hexadecimal (base 16) Computers store numbers using bits (base 2) which are organized into bytes (8 bits) The left (cid:373)ost (cid:271)it of a (cid:449)ord is the (cid:862)sig(cid:374) (cid:271)it(cid:863) (cid:894)(cid:1005) is (cid:374)egati(cid:448)e, (cid:1004) is positi(cid:448)e(cid:895) To make 8 bits, fill with 0s until you have 8 numbers 00101010.