Semester : SEMESTER 7
Subject : Programming Paradigms
Year : 2018
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : CS 403
Page:1
B R7931 Pages: 2
Reg No.: Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SEVENTH SEMESTER B.TECH DEGREE EXAMINATION, DECEMBER 2018
Course Code: CS403
Course Name: PROGRAMMING PARADIGMS
Max. Marks: 100 Duration: 3 Hours
PART A
Answer all questions, each carries 4 marks. Marks
1 Show what is side-effect in an expression with the help of an example? (4)
2 Can a user access a non-local object in case of subroutines, give valid reasons. (4)
3 With example, briefly explain structural and named equivalence. (4)
4 Describe the parameter modes used in ADA. (4)
5 Consider the function (define double(lamda(x)(+xx))) , Evaluate the expression (4)
(double(*23)) in applicative order as well as normal order.
6 With help of an example, show how exception is handled in C++? (4)
7 Differentiate greedy and minimal matches. Generate greedy and minimal (4)
matches for the pattern /(90) in the string ೩000600000
8 Explain constructors and destructors (4)
9 What is a thread pool in Java? What purpose does it serve? (4)
10 In what sense is fork/join more powerful than co-begin? (4)
PART B
Answer any two full questions, each carries 9 marks.
11 ஐ Write a pseudo code to find factorial of a number based on recursive and tail (4)
recursive procedure.
b) Give the code for the following source with and without short-circuit evaluation. (5)
if( (A<=B) and (C
else
else_clause
12 2) Summarize the differences among mark and sweep, stop and copy, and (5)
generational garbage collection.
b) How records are represented in programming languages? Explain. (4)
13 a) Consider the following pseudocode: (4)
X : integer := 3
y : integer := 4
procedure add
Xi=xt+y
procedure second(P : procedure)
% : integer := 5
P()
procedure first
y : integer := 6
Page lof 2