Reference no: EM13725599

Question 1: The quality of a language that allows a programmer to express a computation clearly, correctly, concisely, and quickly is called _____.

1. Efficiency
2. Orthogonality
3. Regularity
4. Writ ability

Question 2: Which of the following is a functional language?

1. Lisp
2. Python
3. ALGOL
4. FORTRAN

Question 3: Which of the following is an object-oriented language?

1. Algol
2. C++
3. FORTRAN
4. C

Question 4: A language achieves ____ by avoiding special cases in the use of constructs.

1. Orthogonality
2. Generality
3. Efficiency
4. Uniformity

Question 5: A language that allows the user to add features to it is said to have the property of ____.

1. Uniformity
2. Extensibility
3. Regularity
4. Reliability

Question 6: A ____ specifies the syntax of a piece of code that expands to other standard code.

1. Compiler
2. Function
3. Macro
4. Procedure

Question 7: C++ ____.

1. Is an object-oriented language
2. Is a functional type language
3. Is a logic type language
4. Is not widely used

Question 8: Which of the following statements about functional programming languages is incorrect?

1. In pure functional programming, there are no assignments
2. In pure functional programming there are no loops
3. In pure functional programming loops are replaced by recursive calls
4. The value of a function depends on the order of evaluation of its parameters

Question 9: To express symbols as a data type in Scheme, use the keyword ____.

1. Symbol
2. Quote
3. Form
4. Exclamation

Question 10: Which of the following represents a list of data in Scheme?

1. (3.1, 3.2, 3.3)
2. (Quote (3.1 3.2 3.3))
3. (3.1; 3.2; 3.3)
4. (Quote (3.1, 3.2, and 3.3))

Question 11: Which of the following correctly assigns values to two variables and then multiplies them in the Scheme programming language?

1. (Let ((x 5) (y 3)) (* x y))
2. (Let (x 5) (y 3)) (* x y)
3. Let (x 5) (y 3) (* x y)
4. (Let (x 5 y 3) (* x y))

Question 12: The ____ is used in Scheme to create a function.

1. Let special form
2. Lambda special form
3. Letrec special form
4. Procedure special form

Question 13: Which of the following Scheme statements will insert the number 6 at the head of a list named L?

1. (Add 6 L)
2. (Hd 6 L)
3. (Insert 6 L)
4. (Cons 6 L)

Question 14: Given a list L in Scheme with contents of (3 7 2 8). What will be returned if the command (cdr L) is executed?

1. (8)
2. (2 8)
3. (3)
4. (7 2 8)

Question 15: Given a list L in Scheme with contents of ((x y) s (t)). What will be returned if the command (cdr (car L)) is executed?

1. (x)
2. (x y)
3. (y)
4. (t)

Question 16: ____ are statements that are assumed to be true and from which other true statements can be proved.

1. Axioms
2. Logical statements
3. Predicates
4. Universal statements

Question 17: In the Horn clause a1 and a2 and a3 ? b, the variable b is called the ____.

1. Head
2. Tail
3. Body
4. Fact

Question 18: In the Horn clause a1 and a2 and a3 ? b, the portion a1 and a2 and a3 is called the ____.

1. Head
2. Tail
3. Body
4. Query

Question 19: ____ is the process of pattern matching to make statements identical.

1. Unification
2. Instantiation
3. Resolution
4. Equalization

Question 20: Variables set equal to patterns are said to be ____.

1. Unified
2. Initialized
3. Instantiated
4. Resolved

Question 21: Prolog uses ____.

1. Lowercase for variable names, and uppercase for constants and functions
2. Uppercase for variable names, and lowercase for constants and functions
3. Lowercase for variable names and constants, and uppercase for functions
4. Uppercase for variable names and constants, and lowercase for functions

Question 22: A list is written in Prolog using ____ to enclose the items.

1. Curly braces
2. Single quotes
3. Square brackets
4. Double quotes

Question 23: To force evaluation of an arithmetic term in Prolog, you must use the built-in predicate ____.

1. Force
2. Equals
3. Evaluate
4. Is

Question 24: To force Prolog to perform loops, we must force backtracking even when a solution is found by using the built-in predicate ____.

1. Is
2. Parent
3. Fail
4. Repeat