Unit 4 - Chapter 10

Question 1

procedural languages

Answer 1

Programs written in such languages differ in the way the statements must be arranged on a line and in how variables can be named.

Question 2

FORTRAN

Answer 2

the first high-level language that was actually implemented.

Question 3

JAVA programs come in two flavours:

Answer 3

Applications and applets. Applications are complete stand-alone programs that reside and run on a self contained computer.

Question 4

Pradigm

Answer 4

a model or mental framework for representing or thinking about something.

Question 5

Recursive

Answer 5

something that is defined in terms of smaller versions of itself.

Question 6

Side effect

Answer 6

occurs when a function, in the course of acting on its argument values to produce a result value, also changes other values that it has no business changing.

Question 7

Logic programming languages

Answer 7

In logic programming, various facts are asserted to be true, and on the basis of these facts, a logic program can infer or deduce from other facts. When a query ( a question) is posed to the program, it begins with the storehouse of facts and attempts to apply logical deductions , in as efficient a manner as possible, to answer the query.

Question 8

Declarative languages

Answer 8

Logic programming languages are usually called declarative as opposed to procedural, because their programs, instead of issuing step-by-step commands, make declarations or assertions that various facts are true.

Question 9

knowledge base

Answer 9

of facts and rules about a certain domain of interest. this knowledge base constitutes the program. Interaction with the program takes place by posing queries - sometimes rather complex queries - to an inference engine ( also called a query interpreter). The inference engine is a piece of software that is supplied as part of the language itself; that is, it is the part of the compiler or interpreter, not something the programmer has to write.

Question 10

Modus ponens

Answer 10

In propositional logic, modus ponens, also known as modus ponendo ponens or implication elimination or affirming the antecedent, is a deductive argument form and rule of inference. It can be summarized as “P implies Q. P is true. Therefore Q must also be true.”

Question 11

divide-and-conquer model

Answer 11

used to solve a task. In this approach, the problem is successively partitioned into smaller and smaller parts and sent off to other processors, until each one has only a trivial job to perform.