Scribd
Upload
59 views2 pages

MSCCST 301

This document is an exam for a System Programming course. It contains 13 multiple choice questions across two sections. Section A contains 15 short answer questions, each worth 2 marks. Section B contains 9 longer answer questions, each worth 5 marks. The questions cover topics related to system programming including compilers, assemblers, linkers, loaders, memory management, and processes. Students are instructed to answer all questions in Section A and choose 9 questions from Section B.

Uploaded by

api-3782519
Copyright
© Attribution Non-Commercial (BY-NC)
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
59 views2 pages

MSCCST 301

This document is an exam for a System Programming course. It contains 13 multiple choice questions across two sections. Section A contains 15 short answer questions, each worth 2 marks. Section B contains 9 longer answer questions, each worth 5 marks. The questions cover topics related to system programming including compilers, assemblers, linkers, loaders, memory management, and processes. Students are instructed to answer all questions in Section A and choose 9 questions from Section B.

Uploaded by

api-3782519
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 2

Roll No........................

Total No. of Questions : 13] [Total No. of Pages : 02


J-3153[S-1009] [2037]
M.Sc. (CST) (Lateral) (Semester - 3rd)
SYSTEM PROGRAMMING (M.Sc.(CST) - 301)
Time : 03 Hours Maximum Marks : 75

Instruction to Candidates:
1) Section - A is compulsory.
2) Attempt any Nine questions from Section - B.

Section - A
Q1) (15 x 2 = 30)
a) What is the regular grammar?

b) Can uniform symbols be avoided? If so, what are gains and losses?

c) What is parse tree?

d) What is dynamic linking?

e) Describe the functions of TXT and END cards.

f) List two advantages of binding at load time over binding at assembly


time.

g) How many passes are required for the design of direct linking loader?

h) Compare the properties of macros and subroutines.

i) What is assembly language?

j) What features of assembly language required to build a two pass


assembler?

k) What is Symbol table and how it differs from machine operation table?

1) What is race condition?

m) What is compaction and why it is needed?

P.T.O.
n) What is the difference between scheduler and dispatcher?

o) What is the need of segmentation with paging memory management


technique?

Section - B
(9 x 5 = 45)
Q2) What is compiler? Explain different phases of compiler.

Q3) What is the purpose of the uniform symbol? Can uniform symbol be avoided?
If so, what are the gains and losses?

Q4) What is direct linking loader? How it is designed.

Q5) Explain relocation loader in detail and give its advantages and disadvantages.

Q6) Describe the input and output of the microprocessor. How dependent is it
upon the assembler source code format?

Q7) What are the steps performed by the design of assembler explain briefly?

Q8) Can the operand expression in an ORIGIN statement contain forward


references? If so, outline how the statement can be processed in a two pass
assembly scheme.

Q9) When do page faults occur? Describe the actions taken by the operating
system when a page fault occurs.

Q10) Explain First fit, Best fit and Worst fit allocation algorithms with examples.

Q11) What is the structure of the page table and explain the methods for storing
page tables along with advantages and disadvantages?

Q12) What is process? Explain different process states.

Q13) Explain code optimization in detail.

J-3153[S-1009] 2

You might also like