Exam Details
Subject | functional programming | |
Paper | ||
Exam / Course | mca | |
Department | ||
Organization | apj abdul kalam technological university | |
Position | ||
Exam Date | April, 2018 | |
City, State | kerala, thiruvananthapuram |
Question Paper
E EC410 Pages: 2
Page 1 of 2
Reg
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SECOND SEMESTER (Second Year Direct)
FOURTH SEMESTER MCA (Regular) DEGREE EXAMINATION, APRIL 2018
Course Code: RLMCA262
Course Name: FUNCTIONAL PROGRAMMING
Max. Marks: 60 Duration: 3 Hours
PART A
Answer all questions, each carries 3 marks. Marks
1 Explain Tail Recursion and Recursion Trees.
2 How can we use Functions as a value? Explain with suitable example.
3 What are Inverse Functions? Explain with suitable examples.
4 What do you mean by Lazy Evaluation?
5 What is an Enumerated Data Type? What are its uses?
6 What are Type Classes? Explain the usage of any three type classes.
7 Does Haskell provide any structure in which you can accommodate different
values belonging to different types? If so, name and explain how to use it.
8 Write the lists generated by the following Haskell list comprehensions.
x
ii)
iii)
PART B
Each question carries 6 marks.
9 What are the different data structures commonly used in computer
programming? (Explain any 3 data structures)
OR
What are the various data types used commonly in programming
languages? (Explain any 4 types with examples)
10 Explain Functional Composition and the usage of Auxiliary Functions.
OR
Explain Pattern Matching in Function definitions with suitable examples.
ii) Explain the use of Strict Functions and Non-strict Functions
11 Explain any 4 operations defined over a List with examples.
E EC410 Pages: 2
Page 2 of 2
OR
Explain recursion over Lists.
12 Explain the use of MAP function and FILTER function on Lists.
OR
Explain recursion over Natural Numbers
13 What are Abstract Data types? Explain using one example.
OR
What operations are defined on a Binary Search Tree? Explain the
operations using the definition of the functions.
14 How would you implement a Queue Data Structure using Haskell? (You
need to insert and delete values in the data structure).
OR
i.
ii.
Write the Haskell code using Pattern Matching to find the factorial of a
number.
Write the Haskell code to find the sum of even numbers from a list.
Page 1 of 2
Reg
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SECOND SEMESTER (Second Year Direct)
FOURTH SEMESTER MCA (Regular) DEGREE EXAMINATION, APRIL 2018
Course Code: RLMCA262
Course Name: FUNCTIONAL PROGRAMMING
Max. Marks: 60 Duration: 3 Hours
PART A
Answer all questions, each carries 3 marks. Marks
1 Explain Tail Recursion and Recursion Trees.
2 How can we use Functions as a value? Explain with suitable example.
3 What are Inverse Functions? Explain with suitable examples.
4 What do you mean by Lazy Evaluation?
5 What is an Enumerated Data Type? What are its uses?
6 What are Type Classes? Explain the usage of any three type classes.
7 Does Haskell provide any structure in which you can accommodate different
values belonging to different types? If so, name and explain how to use it.
8 Write the lists generated by the following Haskell list comprehensions.
x
ii)
iii)
PART B
Each question carries 6 marks.
9 What are the different data structures commonly used in computer
programming? (Explain any 3 data structures)
OR
What are the various data types used commonly in programming
languages? (Explain any 4 types with examples)
10 Explain Functional Composition and the usage of Auxiliary Functions.
OR
Explain Pattern Matching in Function definitions with suitable examples.
ii) Explain the use of Strict Functions and Non-strict Functions
11 Explain any 4 operations defined over a List with examples.
E EC410 Pages: 2
Page 2 of 2
OR
Explain recursion over Lists.
12 Explain the use of MAP function and FILTER function on Lists.
OR
Explain recursion over Natural Numbers
13 What are Abstract Data types? Explain using one example.
OR
What operations are defined on a Binary Search Tree? Explain the
operations using the definition of the functions.
14 How would you implement a Queue Data Structure using Haskell? (You
need to insert and delete values in the data structure).
OR
i.
ii.
Write the Haskell code using Pattern Matching to find the factorial of a
number.
Write the Haskell code to find the sum of even numbers from a list.
Other Question Papers
Subjects
- advanced database systems
- advanced java programming
- application development andmaintenance
- applied probability and statistics
- applied statistics lab
- big data technologies
- business intelligence and its applications
- computational science
- computer networks
- computer organization andarchitecture
- data structures
- data structures lab
- database lab
- database managementsystems
- design and analysis of parallel algorithms
- design and analysis ofalgorithms
- digital fundamentals
- discrete mathematics
- elective i
- functional programming
- introduction to machine learning
- mobile application developmentlab
- mobile computing
- object oriented programming
- object oriented programminglab
- operating systems
- operations research
- principles of management
- problem solving and computer programming
- programming lab
- software engineering
- system design lab
- web programming
- web programming lab