11

12

13

14

15

16

17

18

19

20

05RLMCA262052001

Let pred x = ೫-1, Write and explain a definition to subtract two numbers using

recursion.

Module 11
Explain with the help of examples, compare functional programming and

imperative programming.

OR
“In imperative languages, new values may be associated with the same name

through command repetition.”. Justify with suitable example.

Module 111
Explain the concept of functional composition with the help of an example.

OR
Explain lazy evaluation strategy with the help of suitable examples.

Explain the usage of function guards and pattern matching with suitable

examples.

Module IV
Define, explain and state the use of any three list operations with suitable

examples.

OR
Prove x ^ (m + 1) = (x ^ m) * (x ^ n) where ^ 15 the exponentiation operation

using Mathematical Induction. Before proving, first define exponentiation using
Recursion.

Module V
Explain how a type can be defined whose values depend on the values of other

types along with examples.
Explain how List data structure can be created as a Recursive data type along

with examples.

OR
Define binary search tree as a Recursive data type. Define and explain any two

operations on it using that.

Module VI
Explain the use of zip function in functional programming with suitable

example.
Define a function in Haskell to find length of a list.

OR
Define stack data structure in Haskell. Define and explain any two operations on

it.

ಶೇ ‏عد‎ Kak

Page 2 of 2

(3)

(6)

(6)

(6)

(3)
(3)

(6)

(6)

(3)

(3)

(6)

(3)

(3)

(6)