Theory Of Programming Language BSCS 6th Term 2016 UOS

University of Sargodha

BS 6th Term Examination 2016

Subject: Computer Science
Paper: Theory of Programming Language (CS: 4140)

Time Allowed: 2:30 Hours
Maximum Marks: 80

Objective Part (Compulsory)

Q.1. Write short answers of the following in 2–3 lines each on your answer sheet. (2*16)

i. What are recursive types?
ii. Define type checking.
iii. What are subroutines?
iv. Define data abstraction.
v. What is encapsulation?
vi. Write name of any two scripting languages.
vii. Write names for any two third generation languages.
viii. What is functional programming?
ix. Define dynamic binding.
x. What is the role of inheritance?
xi. Differentiate between arrays and vector.
xii. What is push down automata?
xiii. Define strings.
xiv. What is data binding?
xv. What is naming space?
xvi. Write name of any two structured programming languages

Subjective part (3*16)

Q.2. Differentiate between finite state automata and push down automata. Explain with an example.

Q.3. What are different classes of binding time? Explain any two.

Q.4. Differentiate between static storage management and heap storage management.

Q.5. What is inheritance? Differentiate between abstract class and derived classes.

Q.6. Explain the application area for logic programming. Explain the concept of recursion through any logic programming concepts.