6.00x Chapter 1 - Sheet1

Question 1

Declarative knowledge

Answer 1

statements of fact :: y * y = x^2

Question 2

Imperative knowledge

Answer 2

“how to” or recipe for deducing information

Question 3

algorithm

Answer 3

inputs -> computations ->output

Question 4

fixed vs stored program computer

Answer 4

fixed-program cannot do anything other than its original purpose without modification whereas stored-program manipulates instructions from memory using native elements

Question 5

interpreter

Answer 5

executes a legal set of instructions from a language

Question 6

flow of control

Answer 6

the order in which instructions are executed

Question 7

universal turing machine

Answer 7

simplest machine that can compute any function

Question 8

Turing Complete

Answer 8

if a language can be used to simulate a universal turing machine it qualifies

Question 9

literals

Answer 9

number 3.5 or string “hello”

Question 10

infix operators

Answer 10

(+, =, / , -)

Question 11

syntax

Answer 11

defines what order of characters and symbols are well formed “cat dog boy” or in python (3.5 34)

Question 12

static semantics

Answer 12

defines which syntactically valid strings have meaning ie: 3.2 / ‘abc’ is syntactically correct but produces a static semantic error

Question 13

semantics

Answer 13

associates a meaning with each syntactically correct string of symbols that has no static semantic errors.. semantic errors : loops/ crashes/ unintended output