{'

D 6727 (Pages:2)

Reg. 9t;i*'ir

TIIIRD SEMESTER Il[.Sc. DEGREE EXAMINATION, D 4016' '

*, 1
ati
(CUCSS) i9 $ll':

Physics
P}IY 3E O4_COMPUTER SOHTWARE AND APPLICATIONS
(20L2 Admissions)
Time: Three Hours Maximum : S6lVeightage
Section A
Answer aI! questinns.
Each question carri,es t weightage.
1. What are the fundamentals of language processing ?
2. Deiine triples and quadruples with suitable example.
3. Define Macro with suitablg o(amFle.
4, What is the format of assembly language statement?
-Defi'ne
tt. the ive some
algorithms ?

6. Explain why self-relocating programs are less efficient than relocatable program.
7. Illustrate the use of the data structures by the analysis and synthesis phases using a block diagram.
8. Clearly explain the advantages of swapping in an operating system.
9. Briefly explain local optimization and global optimization.
10. Define scheduling.
11. With suitable example explain resource status modeling.

(12x1=12weightage)
Section B
T\ro to be answered, out of 4,6 weightage for each.
13. Discuss in detail with suitable example the design of a two pass assembler.
L4. Explain in detail lhs implementation of interacting proeesses
15. With suitable example explain in detail the salient feature of interpreters.
16. Explain in detail the various stages of handling deadlock.
(2xG = 12weightage)

Turn over

...,,, :r,:,.:.,:.,.',-,- .^., :J

t-

Section C
Four to be onswerc.d. out of sig,,
Doch question cariis I weiightage.
17. Illustrate with help of a block diagram the use of the data structures by the analysis and synthesis
phases.

18. Distinguish between Pure and Impure interpreters.

19. Extend the toy code generator to handle multiple registers in the CPU. Shorn various steps irn the
code generation for the expression (a + b)l(c + d) using 2 CPU registers.
20. Write any sarnple assemblyprogram.
2L. With block diagram illustrate the use of the data structures by the analysis and slmthesis phases.

22. List the fundamental steps in program development.

" (+x3=l2weightage)
c 31293 (Pages:2)

TIIIRD SEMESTER M.Sc. DEGREE EXAMINATI zotT

(CUCSS)

Physics
P}IY 3E O4_COMPIIIER SOETWARE AND APPLICATIONS
(2012 Admissions)
Time : Three Hours Maximum : 36 Weightage
Section A
Answer all questions.
Each questinn carries L weightage.

1. What are the fundamentals of language specification ?

2. Define s sample system of processes with deadlock.

3. Discuss briefly the objectives of the analysis and sym.thesis phases of the assembler.

4. Define time sharing

b. Explain multi-pass translation.

b. Explain macros and their advantages and disadvantages.

7. Why do most practical compilers require more than one pass ?

8. Write a note on topdown parsing.

9. what are the software primitives for process synchronization ?

10. Briefly explain the compilation of control structures.

11. Discuss the step of Program Testing and Debugging in ifre process of program development.

L2. What is scanning ? Explain the basic tasks of a scanner.

(L2xL = 12weightage)
Section B
I\ro to be answered out of four, 6 weightage for each.'

13. Describe the structure of a User Interface Management System. Give an

example.
L4. What is code optimization ? Discuss the different aspects of code optimization
and
its advantages and disadvantages.
Ihrn over
 2 c 31293

15. Explain in detail the desigu of Intermediate Code Forms of a two pass assembler.

16. Describe deadlock detection and deadlock avoidance strategies.

(2x6=12weightage)
Section C
Four to be answered out of six
Each qucstion carries 8 weightoge.

L7. Describe the various aspects for designing a linker.

18. Write an assembly language program that checks whether a number is odd or even.

19. Does swapping increase the effective degree of multiprogramming ? Justiff your answer. Explain
the advautages of swapping in an operating system.

20. Distinguishbetween pure and impure interpreters.

2L. Explain the lexical expansion of the 3 types of strings used with Elacros during uracro expansion.
22. Consider the following set of processes that arrive at time 0, with the length of the cpu-burst time
given in rnilliseconds.

hocess Burst tim,e

P1 24

P2 3

P3 3

Find the average waiting time using FCFS method.

(4x3=12weightage)