Survey of Programming Languages 3

1. 1What does a lambda expression specify?

   1. AA named function that performs some behavior.
   2. BA variable assignment.
   3. CA nameless function that performs some behavior.
   4. DFunction composition of two unrelated functions.
2. 2In what common data structure are LISP lists normally stored?

   1. AAn array.
   2. BA multidimensional cubic table structure.
   3. CA tree structure in which each node can have any amount of children
   4. DA linked list structure in which each node has two pointers
3. 3Which of the following is not true regarding the original Scheme programming language mentioned in the Text Book?

   1. AThe Scheme language is a dialect of LISP.
   2. BComplex numbers are supported in Scheme.
   3. CScheme like LISP before it uses dynamic scoping
   4. DScheme requires that the scheme language processing systems convert all tail recursive functions to iterations.
4. 4What data type(s) were parts of the original LISP?

   1. AAtoms and lists
   2. BLists and strings
   3. CIntegers, lists, arrays, strings
   4. DLists
5. 5If a function is called tail recursive then?

   1. AIt contains at least one parameter.
   2. BThe last statement with the function returns a constant making it easier to convert to an iterative statement.
   3. CThe last statement within the function is a recursive call to the function itself.
   4. DThe function is one of two functions which together make a recursive function.
6. 6What does the following expression in Scheme evaluate to (- 5 (* 6 3))?

   1. A-13
   2. B13
   3. C6
   4. D3
7. 7What was the type of scoping used in the original LISP?

   1. ADynamic
   2. BStatic
   3. CNA, scope does not make sense in the original LISP
   4. DLexical
8. 8How do Functional Programming languages handle I/O?

   1. AThey are a fundamental part of any programming language and cannot be avoided.
   2. BInput and output operations change the state a program and therefore cannot be part of any pure functional programming language.
   3. CTypical support should exist for I/O as it us a fundamental part of any pure functional programming language.
   4. DThey handle them the same way as Imperative Programming Languages do.
9. 9The Apply-to-All Functional Form is achieved in Scheme by using the following keyword:

   1. Acompose
   2. Bmap
   3. CDEFINE
   4. DLET
10. 10Which of the following is not a characteristic of Purely Functional Programming Language?

    1. AThey are designed to mimic mathematical functions.
    2. BThey do not use variables or assignment statements.
    3. CThey do not always produce the same results when executing the same function with the same parameters.
    4. DThey must specify repetition through recursion rather than iteration.

11. 11When would you use a functional programming language over an imperative one?

    1. AWhen you want to perform a task that involves heavy use of I/O.
    2. BWhen the underlying problem requires a tight coupling with the architecture of the system being used.
    3. CWhen the nature of the underlying problem being solved is an underlying mathematical one.
    4. DIn an internet of things device where its main use would be to collect sensor data.
12. 12All functional programing languages are?

    1. ACompiled.
    2. BCompiled and/or interpreted varies with the languages.
    3. CNeither Compiled nor Interpreted.
    4. DInterpreted.
13. 13What is a higher order function?

    1. AA nameless function.
    2. BA function that can take one or more functions as parameters or returns a function as a result, or both.
    3. CA function that always produces the same result when given the same parameters.
    4. DA function that takes parameters and returns a result.
14. 14Referential transparency refers to what?

    1. AThe type of scope used in functional programming languages.
    2. BA function should only be defined once and only once within a program
    3. CThe execution of a function always produces the same result when give the same parameters
    4. DGiven two functions it is possible to combine them through function composition to make a new function
15. 15Which of the following is considered a functional programming language?

    1. AJava
    2. BC
    3. CPython
    4. DLISP
16. 16What is the difference between EQV? And EQ? In Scheme?

    1. AEQV? tests for the equality of two atoms without knowing whether they are symbolic or numeric whereas EQ? compares the pointer values.
    2. BEQV? tests for floating point number equality whereas EQ? does not.
    3. CThere is no difference between the two
    4. DEQ? is used to check if a list has already been created and EQV? is used for numeric comparison only.
17. 17Lists in Lisp are specified using:

    1. AParentheses
    2. BBrackets
    3. CCurly brackets
    4. DQuotes
18. 18What function is available in Scheme that can be called to interpret Scheme code?

    1. ALET
    2. BDEFINE
    3. CEVAL
    4. DLAMDA
19. 19What is a Functional Programming Language?

    1. AA language whose design mimics the underlying architecture of the machine by using an underlying low-level programing methodology.
    2. BA language that supports the concept of inherently having state of which changes throughout the execution process. This state is represented by the program s variable.
    3. CA language that functionally mimics the lower level processor functionality
    4. DA language that is designed to mimic mathematical functions to the greatest extent possible
20. 20C#, JavaScript, Ruby and Python all provide support for this particular feature found in Functional Programming Languages:

    1. AVariable types and defining.
    2. BSupport for nameless functions
    3. CSupport for iteration.
    4. DVariable assignment statements.

Descripción

Test sobre Survey of Programming Languages 3, creado por Grant King el 12/10/2017.

Autor

Grant King

Idioma

English

Visitas

0

Valoración

Aún sin valoraciones

Valora este test

Valora este test

Más sobre Functional Programming and Haskell