My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: S.Yamininagarajan Member Level: Diamond Posted Date: 20 May 2008
|
2005 Andhra University M.C.A Computer Aplications Principles of Programming Languages Question paper
Testpapers of Andhra University MCA - 1.2.3 Principles of Programming Languages
2004-05 MODEL PAPER
MCA 1.2.3
PRINCIPLES OF PROGRAMMING LANGUAGES
First Question is Compulsory
Answer any four from the remaining
Answer all parts of any Question at one place.
Time: 3 Hrs.
Max. Marks: 100
1. Explain the following terms.
a. Dangling – Else ambiguity.
b. Coercion.
c. Activation record.
d. Dangling pointers.
e. Constructors.
f. In-Line functions.
g. Recursive functions.
h. Quoting in Lisp.
i. Cut predicate in PROLOG.
j. Rendezvous in Ada.
2. a. Discuss the evolution of programming languages.
b. The following is a set of BNF rules for real numbers where R stands for Real number, I stands for Integer, F for fraction, D for digit
::= .
::= ?
::= ?
::= 0?1?2?3?4?5?6?7?8?9
Using the above grammar give a left most derivation of the string 2.89 and draw tree snapshots corresponding to the above derivation.
3. a. Discuss syntax directed control flow.
b. Dew flow diagram for the following program fragment.
loop
S1;
If E then exit end;
S2
End4. a. With suitable examples explain type equivalence
b Explain Static and dynamic scope roles.
5. a. With a suitable example explain the concept of inheritance in Object Oriented programming.
b. Explain Virtual functions in C++.
6. a. Explain the rules for expression evaluation in functional programming.
b. Explain control mechanism in PROLOG.
7. a. Discuss concurrent tasks in Ada.
b. Explain how semaphores can be used to achieve mutual exclusion.
8. Explain the following
a. Early and late binding.
b. Information hiding.
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Watch TV Channels
|