Thapar University 2006 M.C.A System Programming - Question Paper
Thapar Institute of Engineering & Technology
MCA (2nd Year)
Final Term exam
CA020 (System Programming)
School Of Mathematics & Computer Applications
End Semester Exam(07/12/2006)
CA-020( System Programming)
Time : 3 Hrs Marks 36
Note: Attempt only five questions. Q No 1 is compulsory. Attempt all parts of a question in a sequence.
Q1 a. Which steps of compiler uses the knowledge of machine architecture? 3 What are the important issues relating to that step?
b. Compare and contrast the efficiency of the execution of the following 2 code(on the speed ,memory and correctness)
(i) Binary bit stream
(ii) Assembly program
c. What is an ambiguous grammar? How the ambiguity is determined? 2 Explain by using an example
d. On what type of operations, strength reduction optimization can not be 1 performed and why?
Q2 a. What is operator precedence? How the precedence is determined- from the 3 given set of rules?
b. An if statement may be written with or without an else part. Given the 4 following operator grammar for if
<if_stmt> if <exp> then <stmt> else <stmt> | if <exp> then <stmt> <assignment> <var> = <exp>
<stmt> <assignment> | <if_stmt>
where if, then and else are operators, find the operator precedence matrix.
Q3 a. Write down the second pass algorithm for the 2 pass assembler. 4
b. An assembly program contains the statement 3
A EQU B+10 Indicate how the EQU statement can be processed if
(i) B is a back reference.
(ii) B is a forward reference.
Explain the algorithm of Marco expansion?
What is data type? For what purpose the semantic of a data type is used? What is value numbers? Why these are used?
Write down the algorithm for the evaluation order for operators?
Explain the formats of the following object records
(i) EXTDEF
(ii) SEGDEF
(iii) LEDATA
(iv) PUBDEF
Write a program to generate code from a table of quadruples.(only the pseudo code)
What types of features are used by compiler to implement function calls? Which data structures are used in the second pass of the linker? Explain each of the data structure.
Write down the algorithm for the first pass of the linker.
Define token and lexemes through an example.
What is the efficient way to access non local variables in block structured languages? Support your answer.
|
Attachment: |
| Earning: Approval pending. |
