10 Questions
In computing, a compiler is a computer program that
translates source code from a high-level programming language to a lower level language to create an executable program.
In the imperative programming paradigm the programmer.
instructs the machine how to change its state.
Purely functional languages don't have loops, because...
they don't have mutable variables.
All but one of the following Haskell expressions are equivalent. Which one is different?
\n -> n
What makes a recursive function definition tail recursive?
There's exactly one recursive call and its return value is immediately returned by the calling function.
Which technique can be used to transform a recursive function definition into an equivalent tail recursive function definition?
Accumulating parameters
Evaluate the Haskell expression foldr (-) 1 [2,3]
0
In Haskell a list [1, 2, 3] is just syntactic sugar for
1:(2:(3:[]))
The worst case time complexity to access a random element is...
O(1) for arrays and O(n) for lists.
Which of the following Haskell data type definitions uses type recursion?
data Tree a = Tip | Branch (Tree a) a (Tree a)
Test your knowledge about the role of a compiler in computer programming. A compiler is a crucial component in the development process, but how well do you understand its function? Take this quiz to find out!
Make Your Own Quizzes and Flashcards
Convert your notes into interactive study material.
Get started for free
