0% found this document useful (0 votes)
7 views3 pages

Nov Dec 2024

This document is an examination paper for the Principles of Programming Languages course, consisting of 8 questions. Students are instructed to answer four questions from the provided options, with a total duration of 2.5 hours and a maximum score of 70 marks. The questions cover various programming concepts, including Java features, inheritance, exception handling, and functional programming.

Uploaded by

mayuraniljamdade
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views3 pages

Nov Dec 2024

This document is an examination paper for the Principles of Programming Languages course, consisting of 8 questions. Students are instructed to answer four questions from the provided options, with a total duration of 2.5 hours and a maximum score of 70 marks. The questions cover various programming concepts, including Java features, inheritance, exception handling, and functional programming.

Uploaded by

mayuraniljamdade
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Total No. of Questions : 8] SEAT No.

7
23
PC2815 [Total No. of Pages : 3

ic-
tat
[6352]-39

0s
S.E. (Computer Engineering)

7:4
PRINCIPLES OF PROGRAMMING LANGUAGES

02 91
9:3
(2019 Pattern) (Semester - IV) (210255)

0
40
Time : 2½ Hours] 0/1 13 [Max. Marks : 70
Instructions to the candidates:
0
2/2
1) Answer four questions Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
.23 GP

2) Neat diagrams must be drawn wherever necessary.


3) Assume suitable data if necessary.
E
72

7
C

23
ic-
Q1) a) Explain following features of Java in detail. [6]
16

tat
i) Platform Independence
8.2

0s
ii) Object – Oriented
.24

7:4
91
49

9:3
iii) Dynamic Programming
30
40

b) Explain one dimensional and multi - dimensional array used in Java with
01
02

suitable examples. [6]


2/2
GP

c) Define constructor. Explain different types of Constructors used in Java


0/1

with example. [6]


CE
72

7
23
OR
.23

ic-
16

Q2) a) Write a program in Java using switch-case statement to perform addition,


tat
8.2

subtraction, Multiplication and Division of given two numbers and print


0s

the result. [6]


.24

7:4
91
49

9:3

b) Explain in brief below keywords with example in Java. [6]


30
40

i) final
01
02

ii) finalize()
2/2
GP
0/1

iii) references
CE
72

c) Explain Command line argument Concept for Java language. [6]


.23
16
8.2
.24

P.T.O.
49

[6352]-39 1
Q3) a) Define Inheritance and list the advantages. Explain the types of Inheritance

7
23
in Java with suitable Java code. [9]

ic-
b) Explain following concepts with example. [8]

tat
0s
i) abstract classes

7:4
02 91
9:3
ii) Method Overloading

0
40
iii) 0/1 13
Package
0
2/2
.23 GP

iv) Interface
E

OR
72

7
C

23
Q4) a) Describe Exception. Write any two examples of exception. Explain

ic-
16

keywords try, catch, throw, throws and finally related to exception

tat
8.2

handling. [9]

0s
.24

7:4
b) Elaborate the significance of keyword “Super” in Java. Demonstrate with
91
49

9:3
suitable example. [8]
30
40
01
02
2/2
GP

Q5) a) Differentiate Multiprocessing and Multi-threading. Explain life cycle of


0/1

Thread model in Java. [9]


CE
72

7
23
b) List the features of JavaScript. Write short note angular JS. List its
.23

ic-
advantages and disadvantages. [9]
16

tat
8.2

0s

OR
.24

7:4
91

Q6) a) Explain methods in Java thread with example. [9]


49

9:3
30
40

i) getPriority()
01
02

ii) setPriority()
2/2
GP
0/1

iii) notifyAll()
CE
72

b) List and elaborate features of React JS, Angular JS, Vue JS. [9]
.23
16
8.2
.24
49

[6352]-39 2
Q7) a) Describe Functional Programming. Enlist its features. Also list the

7
23
commonly used functional programming languages. [6]

ic-
b) Write sequences of CAR’s and CDR’s that will pick the atom of the

tat
following s- [6]

0s
expression:

7:4
02 91
9:3
i) (Monday Tuesday Wednesday Thursday)

0
40
ii) ((Monday Tuesday) (Wednesday Thursday))
0/1 13
iii) (((Monday) (Tuesday) (Wednesday) (Thursday)))
0
2/2
.23 GP

c) Explain the concept of “List” in Prolog. Explain basic operations on


lists. [5]
E
72

7
OR
C

23
ic-
Q8) a) Explain the following functions with suitable examples. [6]
16

tat
i) CAR ()
8.2

0s
ii) CDR ( )
.24

7:4
91
iii) cons ( )
49

9:3
30

b) Explain the following number predicates using suitable example. [6]


40
01
02

i) NUMBERP
2/2
GP

ii) ZEROP
0/1

iii) PLUSP
CE
72

7
iv) EVENP

23
.23

ic-
v) ODDP
16

tat
vi) MEMBERP
8.2

0s

c) Describe Logical Programming. Explain the phrases “Facts”, “Rules”


.24

7:4
91

with examples. [5]


49

9:3
30
40
01
02
2/2
GP

… … …
0/1
CE
72
.23
16
8.2
.24
49

[6352]-39 3

You might also like