COMPSCI 1MD3 Lecture Notes - Lecture 2: Programming Paradigm, Exponentiation, Guido Van Rossum
25 Jan 2018
School
Department
Course
Professor
Document Summary
Algorithms - a sequence of instructions executed by a machine when provided input and eventually stops and produces output. Need to be precise (unambiguous) and effective ( can be implemented) Programs - algorithms that can be executed automatically by a computer. Fixed-program computers only have one purpose (e. g digital clock, washing machine) Stored - program computers store a program"s sequence of instructions and has components that execute any sequence of instructions. Control unit - keeps track of which process comes first and last. Operate on bits(0, and 1s) that are grouped into words, usually 32 or 64 bit words. Contain their own very limited memory called registers. Perform arithmetic operation on data in the register. Jump to another instruction based on the value of data in a register. Early high-level language : fortran in 1958, formula translator for mathematical expressions into machine language. Compilers - translate high-level programs to machine language.
