C 1100CST305122101 Pages: 3

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Fifth Semester [Link] Degree Examination December 2021 (2019 scheme)

Course Code: CST305

Course Name: SYSTEM SOFTWARE
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks
1 Explain the different I/O instructions in SIC. 3
2 Describe the different instruction formats available in SIC/XE machine. 3
With a simple example describe what is meant by forward reference and how is it
3 3
handled in one pass assembler.
Write a sequence of instructions for SIC/XE to set ALPHA equal to 4*BETA-9.
4 Use immediate addressing modes for constants and assume ALPHA and BETA 3
to be floating point numbers.
5 Give the structure and purpose of Modification record and Define record. 3
How is a feature of an assembler categorized as machine dependent or machine
6 3
independent? Support your answer with an example for each category.
Describe the structure and the use of the ESTAB data structure used in the two
7 3
pass linking loader.
8 Outline the need and functions of a bootstrap loader. 3
List the three data structures used in one pass macro processor and describe its
9 3
usage.
With a simple diagram illustrate the communication pathway of an application
10 3
program to a device through a device driver.
PART B
(Answer one full question from each module, each question carries 14 marks)
Module -1
Compare the SIC and SIC/XE architecture with respect to:
11 a) 6
(i) Registers (ii) Instruction Formats (iii) Data Formats Supported
Illustrate the roles and functions of Operating System, Assembler, Compiler and
b) 8
Linker in a modern computer system.

Page 1 of 3
 1100CST305122101

Compare the Input-Output capabilities of the SIC and SIC/XE machine. Also list
12 a) 6
the I/O instructions available in SIC and SIC/XE machines.
Describe the use of n,i,x,b,p and e bits in the SIC/XE instruction format. Write
the binary combination for these bits such that the resultant target address would
b) 8
be as below and also state what would be the addressing modes for each.
i. (PC) + disp ii. (B) + disp iii. (PC) + disp + (X) iv. (B) + disp + (X)
Module -2
13 a) Outline in detail the function and algorithm for pass one of a two pass assembler. 8
b) Write a SIC program to perform linear search in an array of 100 elements. 6
Outline in detail the function and algorithm for the pass two of the two pass
14 a) 8
assembler.
Generate the assembled object program for the below SIC program. The machine
code for the instructions used are: LDX – 04, LDA – 00, ADD – 18, TIX – 2C,
STA – 0C, JLT – 38 and RSUB – 4C. Show the location counter value for each
instruction.

b) 6

Module -3
Define Control Section. With an example illustrate how a control section is
15 a) declared within an assembly program and what are the constituents of the object 7
code program of a control section.
What is the need of relocation in assembly programs? With a small example
b) 7
illustrate how relocation is handled in assemblers.
Describe how the concepts of segments are handled in MASM assembler for
16 a) 6
8086. Also compare near and far jump concept and its handling in MASM.
Define Program Blocks. With an example and diagram demonstrate how the
b) 8
different program blocks within an assembly program are organised within the

Page 2 of 3
 1100CST305122101

memory. Also mention how the object code program for a program block is
organised.
Module -4
17 a) Define Absolute loader and outline the algorithm for it. 6

b) Give the algorithm for the pass two of a two pass linker loader. 8

18 a) Write the algorithm for the pass one of a two pass linker loader. 7
List the different machine dependent and machine independent features of a
b) 7
loader. Explain any two machine independent features.
Module -5
19 a) State the algorithm for a one pass macro processor. 10
b) Distinguish between character and block device driver. 4
20 a) With a neat diagram outline the structure of a text editor. 10
b) Compare induction and backtracking mode of debugging. 4
***

Page 3 of 3
 1100CST305122101 Pages 11

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

Scheme for Valuation/Answer Key
Scheme of evaluation (marks in brackets) and answers of problems/key
FIFTH SEMESTER [Link] DEGREE EXAMINATION, DECEMBER 2021
Course Code: CST 305
Course Name: SYSTEM SOFTWARE
Max. Marks: 100 Duration: 3 Hours
PART A
(Answer all questions; each question carries 3 marks) Mar
ks
1 I/O instructions- TD, RD, WD explain- 3 marks 3
2 3

Maximum 3 marks
3 The scenario in which a label is referenced in an instruction before it is defined is known as 3
forward reference. – 1 mark
In one pass assembler it is handled by including a link field in the SYMTAB, which stores the
links to the instructions which uses the label so that once the label address is obtained the
corresponding instructions object code can be modified. – 1 mark
Suitable example – 1 mark
4 Any correct SIC/XE program can be given marks. Also if the logic is correct without floating 3
point operation, partial marks can be awarded.
(Sample Program:
PGM START 1000
LDF #4
MULF BETA
SUBF #9
STF ALPHA
BETA BYTE 09 11 0A 23 24 56 ; 6 byte floating point number

Page 1 of 11
 1100CST305122101 Pages 11

ALPHA RESB 6
END 1000)
Maximum 3 marks

5 Modification record is used to list the object code fields which need to be modified as part of 3
the loading and linking process.
Define record is used to list the labels of the control sections which would be referenced by
some external control section.

Or

Modification Record – 1.5 marks

Define Record – 1.5 marks
6 Machine dependent features depend on the underlying hardware while machine independent 3
features is realized by the assembler and do not depend on the underlying hardware.
Examples:
Machine dependent – Instruction format and addressing mode
Machine Independent – Literals, Symbol defining statements.

Page 2 of 11
 1100CST305122101 Pages 11

Basic explanation – 2 marks

Examples – 1 mark.
7 ESTAB stands for External Symbol Table. It is used to store the external labels defined within 3
each control section and published through the Define record of each control section. It has
four fields as shown below:

8 Bootstrap loader is used to load the first program (alternate loader) into the memory during the 3
system start-up.
The main functions include:
i. Creating an environment which is conducive for the first program to execute.
ii. Locating and loading the first program to be executed.
iii. Transferring the control to the first program.
Maximum 3 marks.
Marks can be given if the process/algorithm is explained.
9 NAMTAB – Used to maintain the name and link to DEFTAB for each macro definition. 3
DEFTAB – Used to maintain the definition code for each macro
ARGTAB – Used during the expansion of the macro for storing the arguments.
1 mark for each. Maximum 3 marks.
10 The device driver has communication pathway as shown below. 3

Proper explanation. Maximum 3 marks

Page 3 of 11
 1100CST305122101 Pages 11

PART B
(Answer one full question from each module, each question carries 14 marks)
Module -1

11 a) Registers of SIC and SIC/XE – 2 marks 6

Instruction Format of SIC and SIC/XE – 2 marks
Data Formats of SIC and SIC/XE – 2 marks
b) Operating System: Controls and monitors the overall resource management of system – 2 marks 8
Assembler: Provides a means to the programmer to use mnemonic codes instead of machine
instruction. – 2 marks
Compiler: Provides an environment to the programmer to apply modern programming concepts
in code development without bothering the underlying hardware – 2 marks
Linker: Helps in linking the object code generated by different sources but meant for the same
machine – 2 marks
12 a) SIC has no I/O channels while SIC/XE has IO channels. Both supports reading and writing of 6
8bits from and to a device identified by a 8bit address.
The instructions supported by SIC are
TD (Test Device), RD (Read Device) and WD (Write device)
Apart from the above instructions SIC/XE also supports:
TIO (Test IO), SIO (Start IO) and HIO (Halt IO)

Proper comparison – 2 marks

Instructions – 4 marks
b) 8
n i x b p e Addressing Mode
1 1 0 0 1 0
i (PC) + disp Program Counter Relative
0 0 0 0 1 0
1 1 0 1 0 0
ii (B) + disp Base Relative
0 0 0 1 0 0
1 1 1 0 1 0 Program Counter Relative
iii (PC) + disp + (X)
0 0 1 0 1 0 plus index
1 1 1 1 0 0
iv (B) + disp + (X) Base Relative plus index
0 0 1 1 0 0

Page 4 of 11
 1100CST305122101 Pages 11

2 marks for each binary representation (of n,I,x,b,p and e bits) -only SIC/XE needed- and the
addressing modes. Maximum 8 marks
Module -2
13 a) Functions of Pass 1 8

Algorithm:

Functions – 2 marks. Algorithm – 6 marks

b) Any correct SIC program can be given full marks. Also if the program is partially correct, partial 6
marks can be awarded.
14 a) 8

Page 5 of 11
1100CST305122101 Pages 11

Functions – 2 marks. Algorithm – 6 marks

b) Loc Label Opcode Operand ObjectCode 6
SUM START 4000
4000 FIRST LDX ZERO 045788
4003 LDA ZERO 005788
4006 LOOP ADD TABLE,X 18C015
4009 TIX COUNT 2C5785
400C JLT LOOP 384006
400F STA TOTAL 0C578B
4012 RSUB 4C0000
4015 TABLE RESW 2000
5785 COUNT RESW 1
5788 ZERO WORD 0 000000
578B TOTAL RESW 1
578E END FIRST

Object Program (optional)

H^SUM^4000^78E
Page 6 of 11
 1100CST305122101 Pages 11

T^4000^15^045788^005788^18C015^2C5785^384006^0C578B^4C0000
T^5788^3^000000
E^4000

Maximum – 7 marks (Full marks can be given if the object program in H, T and E is not written)
Module -3
15 a) Definition of control section – 1 marks 7
Control sections are defined using assembler directive such as CSECT. – 1 mark
Suitable example with proper use of CSECT – 2 marks
Object code program for each control sections have the records such as header, Define, Refer,
text, Modification and End. Proper description for each records – 3 marks.
b) Relocation is required so that the object code program for given assembly program can be loaded 7
at any given location and executed. It is controlled by the modification record within the object
code program. - 2marks

Proper explanation with suitable examples – Maximum 5 marks

16 a) Segments are handled using the assembler directives such as CODE, STACK, CONST, DATA 6
and USE. Proper explanation with appropriate examples – 3 marks
An instruction jump within the current code segment is known as near jump while if the
destination address of the jump is outside the current code segment it is known as far jump. It is
handled in MASM by explicitly specifying that a jump is near or far by using assembler
directives FAR and SHORT along with the JNP instruction. Proper explanation with examples
– 3 marks
b) Program Block Definition – 1 marks 8
Example and Diagram – 5 marks
The records are for an assembly program containing program blocks contains the normal
Header, Text, Modification and End record. If needed Define and Refer record can also be
included. – 2 marks
Module -4
17 a) Definition – 1 mark 6
Algorithm – 5 marks

Page 7 of 11
 1100CST305122101 Pages 11

b) 8
Algorithm – 8 marks

18 a) Algorithm – 7 marks 7

Page 8 of 11
 1100CST305122101 Pages 11

b) Machine dependent features and machine independent features- list only 1 marks- (Relocation 7
, Program Linking , Automatic Library Search , Loader Options)
Explain Machine independent features – 6
Automatic Library Search – Proper explanation 3 marks
Loader Options – Proper explanation 3 marks

Module -5
19 a) 10

Page 9 of 11
1100CST305122101 Pages 11

Algorithm – 10 marks
b) 4 comparison points. Maximum 4 marks. 4

Page 10 of 11
 1100CST305122101 Pages 11

20 a) 10

Diagram – 4 marks
Proper description of each component – 6 marks
b) Any 2 points of comparison. Maximum 4 marks. 4
*********

Page 11 of 11
 C 1100CST305122101 Pages: 2
1100CST305122201

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Fifth Semester [Link] Degree Regular and Supplementary Examination December 2022 (2019 Scheme)

Course Code: CST 305

Course Name: SYSTEM SOFTWARE
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks

1 Distinguish between interpreter and compiler. 3

2 List any three registers available in SIC machine along with their purpose 3
3 List out the basic functions of Assemblers 3
4 Write an SIC program to swap the values of ALPHA and BETA 3
5 With an example explain any two symbol defining statements? 3
6 Define a program [Link] it is created? 3
7 List the basic functions of a loader 3
8 Define a modification record along with its structure 3
9 Illustrate the concept of macro definition with an example 3
10 What are the two parts of a device driver? 3
PART B
(Answer one full question from each module, each question carries 14 marks)

Module -1
11 a) Write notes on SIC machine architecture 8
b) What are assembler directives? List any four assembler directives in SIC 6
machine.
12 a) Elucidate the architecture of SIC/XE machine 8
b) Compare the features of Standard SIC and SIC/XE architecture 6
Module -2
13 a) Write a sequence of instructions for SIC/XE to divide BETA by GAMMA, 5
setting ALPHA to the integer portion of the quotient and DELTA to the
remainder. Use register to-register instructions to make the calculation as
efficient as possible.

Page 1 of 2
 1100CST305122101
1100CST305122201

b) Illustrate the use and structure of three records used in object program 3
c) Explain the data structures used and their purposes in a two-pass assembler 6
14 a) Suppose ALPHA is an array of 100 words. Write SIC/XE program to set all array 6
elements to zero.
b) Design an algorithm for pass 1 operations of a two pass assembler for SIC 8
architecture.
Module -3
15 a) Write short notes on MASM assembler 7
b) Employ the following code to explain the concept of multipass assembler 7
1 A EQU B/2
2 B EQU C-D
3 E EQU D-1
4 D RESB 4096
5 C EQU *

16 a) Outline in detail Load-and-go Single Pass Assembler Algorithm 7

b) What are control sections? Illustrate with an example, how control sections are 7
used and linked in an assembly language program.
Module -4
17 a) Write notes on machine independent loader features. 8
b) Which are the data structures used during the operation of a linking loader? Write 6
the algorithm for Pass 2 of a Linking Loader
18 a) Give the algorithm for an absolute loader 6
b) Write notes on the different loader design options 8
Module -5
19 a) Explain the working of One pass Macro Processor along with algorithm 6
b) Explain the types of macro with example 8
20 a) Write notes on text editor 7
b) Discuss the features of device drivers 7
***

Page 2 of 2
 1FINAL SCHEME100CST305122101
1100CST305122201122101

Total Pages: 11
Scheme of Valuation/Answer Key
(Scheme of evaluation (marks in brackets) and answers of problems/key)
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
FIFTH SEMESTER [Link] DEGREE(R/S) EXAMINATIONS, DECEMBER 2022
(2019 Scheme)
Course Code: CST 305

Course Name:SYSTEM SOFTWARE

Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks

1 Compiler-1.5 marks 3
Interpreter-1.5 marks
2 3

Any three registers with use- 1mark each

3 3

Any 3 functions-1 mark each

Page 1 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

4 3

5 3
1. EQU Statement
EQU is an assembler directive that allows the programmer to define symbols and specify
their values

Syntax: Symbol EQU value

2. ORG Statement
ORG is an Assembler directive that allows the assembler to reset the PC to values
Syntax: ORG value

1.5 marks each

6 Program blocks allow the generated machine instructions and data to appear in a different 3
order while they are loading in memory-1 mark
Assembler directive: USE-1 mark
Syntax: USE [blockname] -1 mark
7 • Allocation 3
• Linking
• Relocation
• Loading
------0.75 marks each
8 A Modification record is used to describe each part of the object code that must be changed 3
when the program is relocated.-1.5 marks

Page 2 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

-1.5 marks
9 Assembler Directives- MACRO and MEND—1.5 marks 3
Example---1.5 marks
10 Device specific—1.5 marks 3
Operating System specific—1.5 marks
PART B
(Answer one complete question from each module)

Module -1

11 a) 7 features-memory,registers,instruction format,data format,addressing mode,Instruction set, 8

I/O
b) Definition-2 marks 6
Any 4 assembler directives—1 mark each
START
RESW
RESB
WR
BYTE
END
12 a) 7 features-memory,registers,instruction format,data format,addressing mode,Instruction set, 8
I/O
b) Compare any 6 features---1 mark each 6
Module -2

Page 3 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

13 a) 5

b) 3

1 mark for each record

c) Location Counter(LOCCTR) ---2 marks 6
Operation Code Table(OPTAB) ---2 marks
Smbol Table(SYMTAB) ---2 marks

Page 4 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

14 a) 6

Page 5 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

b) 8

Module -3
15 a) List the features of MASM 7
b) 7

This is the final symtab after executing all statements--- 3 marks

4 marks can be given to the procedure/steps

Page 6 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

16 a) 7

b) Definition- 2 marks 7

Page 7 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

Example- 5 marks
Module -4
17 a) Automatic Library Search-4 marks 8
Loader options- 4 marks
b) Data structures---External Symbol Table(ESTAB)-2 marks 6

---4 marks

Page 8 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

18 a) 6

b) 4 loader options-2 marks each 8

Bootstrap loader
Linking loader
Linkage editor
Dynamic linking
Module -5
19 a) 6

Page 9 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

b) Simple macro---2 marks 8

Parametrized macro---2 marks
Nested macro---2 marks
Recursive macro---2 marks
20 a) Text editor-structure&components,types---4 marks 7
Diagram 3 marks

Page 10 of 11
 1FINAL SCHEME100CST305122101
1100CST305122201122101

b) Definition-1mark 7
Functions—2 marks,
types—2 marks,
anatomy—2 marks
*********

Page 11 of 11
C 1100CST305122203 Pages: 2

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
[Link] Degree S5 (R, S) / S3 (PT) (R, S) Examination December 2023 (2019 Scheme)

Course Code: CST 305

Course Name: SYSTEM SOFTWARE
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks

1 Explain any three addressing modes in SIC/XE. 3

2 Describe any three assembler directives used in SIC. 3
3 Explain literal. How is a literal handled by an assembler? 3
4 With an example explain forward reference? 3
5 Explain the usage of EQU statement with an example. 3
6 Explain the working of a one pass assembler. 3
7 Describe the design of an absolute loader. 3
8 Explain automatic library search. 3
9 Illustrate unique labels generation in macro expansion? 3
10 Describe the user interfaces used in a text editor. 3
PART B
(Answer one full question from each module, each question carries 14 marks)

Module -1
11 a) Explain the addressing modes supported by SIC/ XE machine with suitable 8
illustrations.
b) List and explain any three syatem softwares. 6
12 a) Explain the SIC/XE architecture in detail. 8
b) Illustrate the working of a relocating loader. 6
Module -2
13 a) Write and explain the pass one of a two pass assembler algorithm and different 8
data structures used in it.
b) Write a SIC program for doing the following arithmetic operations:
BETA = ALPHA + INCR – 1 6
DELTA = GAMMA + INCR – 1

Page 1 of 2
 1100CST305122203

14 a) Write and explain the pass two of a two pass assembler algorithm and different 8
data structures used in it.
b) Write SIC program to swap the values of two variables ALPHA and BETA. 6
Module -3
15 a) Explain control sections and its implementation with example. 8
b) Explain program relocation and its uses. 6
16 a) Explain program blocks and its implementation with example. 8
b) Illustrate the working of a multipass assembler with an example. 6
Module -4
17 a) Write and explain the algorithm and the data structures used for the pass 1 of a 8
two-pass linking loader.
b) Explain the need and working of a bootstrap loader. 6
18 a) Write and explain the algorithm and the data structures used for the pass 2 of a 8
two-pass linking loader.
b) With the help of a diagram, compare linking loader and linkage editor. 6
Module -5
19 a) Explain one pass macroprocessor algorithm. Illustrate it with an example. 8
b) Distinguish between character and block device drivers. 6
20 a) With a neat diagram outline the structure of debugger. 8
b) Explain any two machine independent feature of a macroprocessor. 6
***

Page 2 of 2
 1100CST305122203

DRAFT SCHEME

Total Pages: 5
Scheme of Valuation/Answer Key
(Scheme of evaluation (marks in brackets) and answers of problems/key)
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

FIFTH SEMESTER [Link] DEGREE(R/S) EXAMINATIONS, DECEMBER 2023

(2019 Scheme)
Course Code: CST 305

Course Name:SYSTEM SOFTWARE

Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks

1 For each addressing modes – 1 Mark each (only 3 needed) 3

Direct ( x,b and p All set to 0): Operand address goes as it is.
Relative (Either b or p equal to 1 and the other one to 0):
Address of operand should be added to the current value stored
at the B register ( if b=1) or to the value stored at the PC register
( if p=1)
Immediate ( i=1,n=0): The operand value is already enclosed on the instruction.
Indirect ( i=0, n=1): The operand value points to an address that
holds the address for operand value.
Indexed ( x=1): Value to be added to the value stored at the
register x to obtain real address of operand.
2 For each assembler directive – 1 mark each 3
START – Specify name and starting address for the program.
END – Indicate the end o the source program and(optionally) specify the first
executable instruction in the program.
BYTE – Generate character or hexadecimal constant , occupying as many bytes
as needed to represent the constant.
WORD- Generate one word integer constant.
RESB- Reserve the indicated number of bytes for a data area.
RESW- Reserve the indicated number of words for a data area.
3 3
Literal definition – 1 mark
Literal handling , LTORG statement and its working – 2 marks
4 Definition of forward reference – 1 Mark 3

Page 1 of 4
 1100CST305122203

DRAFT SCHEME

Explanation with an example – 2 Marks

5 The directive used for this EQU (Equate). The general form of the statement is 3

Symbol EQU value

3 Marks
6 Definition of one pass assembler – 1 Mark 3
How forward reference is avoided in one ass assembler algorithm – 2 Marks
7 Definition of absolute loader – 0.5 Mark 3
Algorithm – 2.5 Marks
8 Definition of Automatic Library Search – 1 Mark 3
Working – 2 Marks
9 Explanation of unique label creation with an example – 3 Marks 3
10 Explanation of user interfaces in text editor – 3 Marks 3
PART B
(Answer one complete question from each module)

Module -1

11 a) Explanation of addressing modes – minimum 4 modes – 4*2 =8 Marks 8

b) Any two system software 3*2 = 4 mars 6

12 a) Explanation of Memory – 1 Mark 8
Explanation of Instruction formats – 2 Marks
Explanation of addressing modes – 2 Marks
Explanation of instruction set – 2 Marks
Explanation of Input and output – 1 Marks
b) Loader Definition – 2 Mark 6
Algorithm – 4 Mark
Module -2
13 a) Explanation of SYMTAB and OPTAB – 2 Marks 8
For correct algorithm of pass 1 – 6 Marks
b) LDA ALPHA 6

Page 2 of 4
 1100CST305122203

DRAFT SCHEME

ADD INCR
SUB ONE
STA BETA
LDA GAMMA
ADD INCR
SUB ONE
STA DELTA
ONE WORD 1
ALPHA RESW 1
BETA RESW 1
GAMMA RESW 1
DELTA RESW 1
INCR RESW 1
For correct program - 6 marks
14 a) Explanation of SYMTAB and OPTAB – 2 Marks 8
For correct algorithm of pass 1 – 6 Marks
b) LDA ALPHA 6
STA GAMMA
LDA BETA
STA ALPHA
LDA GAMMA
STA BETA
ALPHA RESW 1
BETA RESW 1
GAMMA RESW 1
For correct program – 6 Marks
Module -3
15 a) Definition of control section, syntax and an example code – 2 Mark 8
EXTDEF and EXTREF concepts – 3 Marks
Define record, refer record and modification record – 3 Marks
b) Program relocation – 2 marks 6

Page 3 of 4
 1100CST305122203

DRAFT SCHEME

Uses – 2 marks
Example – 2 marks
16 a) Definition of Program blocks – 1 Mark 8
Assembler directive USE syntax and example – 2 Marks
How the assembler handles program block in pass 1 and pass 2 – 4 Marks
Pictorical representation – 1 Mark
b) Definition of Multipass assembler – 1 Mark 6
Working of multipass assembler – 2 Marks
Explanation with an example program – 3 Marks
Module -4
17 a) Explanation of data structure – 2 Marks 8
For correct algorithm of pass 1 – 6 Marks
b) Definition of bootstrap loader – 1 Mark 6
Need for bootstrap loader – 2 Marks
Working – 3 marks
18 a) Explanation of data structure – 2 Marks 8
For correct algorithm of pass 1 – 6 Marks
b) Figure– 2 Marks 6
Differences – 4 Marks
Module -5
19 a) Algorithm with the functions GETLINE, PROCESSLINE, DEFINE & 8
EXPAND – 5 Marks
Example – 3 marks
b) Any two differences with explanation – 4 Marks 6
20 a) Explanation of debugger – 5 Marks 8
Figure – 3 Marks
b) Any two machine independent features – 2*3 = 6 marks 6
*********

Page 4 of 4
C C1100CST305122202 Pages: 2

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
[Link] Degree S5 (S, FE) / S3 (PT) (S) Examination June 2024 (2019 Scheme)

Course Code: CST 305

Course Name: SYSTEM SOFTWARE
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks
1 List out the addressing modes used in SIC/XE 3
2 What are the functions of Operating System? 3
3 Describe the format of object program generated by the two-pass SIC 3
assembler algorithm
4 Write an SIC/XE program to calculate ALPHA=BETA X GAMMA 3
5 Outline the use of assembler directives EXTDEF and EXTREF 3
6 Define expression? Explain different type of expression with example 3
7 Differentiate between Linking loader and linkage editor 3
8 Discuss the advantages and disadvantages of load and go loader 3
9 Differentiate between character and block device drivers 3
10 Illustrate macro expansion with an example. 3
PART B
(Answer one full question from each module, each question carries 14 marks)

Module -1
11 a) Explain the different Addressing Modes and instruction formats used in 9
SIC/XE
b) Define an assembler directive and list out any 3 assembler directive with its 5
use.
12 a) Explain in detail about any 4 types of system software. 8
b) Briefly explain on SIC machine architecture 6
Module -2
13 a) Explain the use of SYMTAB, OPTAB and LITTAB in pass 1 of assembler wit 8
suitable example
b) Write SIC/XE program to find Largest among 100 elements in an array 6

Page 1 of 2
 C1100CST305122202

14 a) Perform the hand assembly of given SIC/XE program. 8

LABEL OPCODE OPERAND
EXAMPLE START 4000
LDS #3
LDT #300
LDX #0
ADDLP LDA ALPHA,X
ADD BETA,X
STA GAMMA,X
ADDR S,X
COMPR X,T
JLT ADDLP
ALPHA RESW 100
BETA RESW 100
GAMMA RESW 100
END EXAMPLE
b) Explain in detail about the pass2 algorithm of two pass assembler 6
Module -3
15 a) What are the problems encountered by single pass assembler? How it is 7
resolved?
b) Explain any 2 symbol defining statements. What are its restrictions? 7
16 a) What is the difference between literal and immediate operand? Illustrate with 6
example
b) With an example explain the working of multipass assembler 8
Module -4
17 a) Describe about bootstrap loader with the help of an algorithm 8
b) Explain about any one method of program relocation 6
18 a) Outline Pass 1 algorithm and data structure used in linking loader 8
b) What is dynamic linking? Explain with an example 6
Module -5
19 a) Describe one pass macro processor algorithm and the data structures used in it 8
b) Explain any two machine independent macro processor features 6
20 a) Explain the various macroprocessor design options 6
b) Describe about any two commonly used debugging methods 8
***

Page 2 of 2
 1100CST305122101
1100CST305122101
1100CST305122202

Draft Scheme of Valuation/Answer Key

(Scheme of evaluation (marks in brackets) and answers of problems/key)
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
[Link] Degree S5 (S, FE) / S3 (PT) (S) Examination June 2024 (2019 Scheme)

Course Code: CST 305

Course Name:SYSTEM SOFTWARE

Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks

1 Direct addtressing mode-1.5 marks 3

Indexed addressing mode-1.5 marks
2 Any three functions- 1 mark each 3
3 3

1 mark each
4 3

5 EXTDEF-1.5 marks 3

EXTREF-1.5 marks

6 Definition-1 marks 3

Page 1 of 7
 1100CST305122101
1100CST305122101
1100CST305122202

Absolute and relative expression 1 mark each

7 Any 3 difference 1 mark each 3
8 2 advantage and 2 disadvantage - 1.5 mark each 3
9 3 points 1 mark each 3
10 Macro expansion-1.5 marks 3
Example-1.5 marks
PART B
(Answer one complete question from each module)

Module -1

11 a) Any 5 addressing mode- 5 marks 9

4 instruction format- 1 mark each
b) Definition- 2marks 5
Any 3 assembler directive- 1mark each
12 a) any 4 types of system software-2 marks each 8
b) any 6 features-memory,registers,instruction format,data format,addressing mode,Instruction 6
set, I/O- 1mark for 1 feature
Module -2
13 a) SYMTAB And OPTAB 2 Marks each 8
LITTAB- 4 marks( with example)
b) LDS #3 6
LDT #300
LDX #0
CLOOP LDA ALPHA, X
COMP MAX
JLT NOCH
STA MAX
NOCH ADDR S, X
COMPR X, T
JLT CLOOP
ALPHA RESW 100
MAX WORD -32768

Page 2 of 7
 1100CST305122101
1100CST305122101
1100CST305122202

14 a) LABEL OPCODE OPERAND 8

4000 EXAMPLE START 4000
4000 LDS #3 6D0003
4003 LDT #300 750012C
4006 LDX #0 050000
4009 ADDLP LDA ALPHA,X 03A00D
400C ADD BETA,X 1BA136
400F STA GAMMA,X 0FA25F
4012 ADDR S,X 9041
4014 COMPR X,T A015
4016 JLT ADDLP 3B2FF0
4019 ALPHA RESW 100
4145 BETA RESW 100
4271 GAMMA RESW 100
439D END EXAMPLE

Page 3 of 7
 1100CST305122101
1100CST305122101
1100CST305122202

b)

Module -3
15 a) Problem encountered is Forward reference. 2 marks 7
Resolving the problem it diagram- 5 marks
b) EQU and ORG with syntax and example 3 marks each 7
Restriction. Does not support forward reference- 1 mark
16 a) Difference 3 marks 6
Example 3 marks
b) Multipass assembler-4 marks 8
Example-4 marks
Module -4

Page 4 of 7
 1100CST305122101
1100CST305122101
1100CST305122202

17 a)

b) Modifcation Record/ Relocation bits-6 marks 6

18 a) Algorithm -6 marks 8
Data structure- 2 marks
b) dynamic linking-4 marks 6
Example-2 marks
Module -5
19 a) 8
Definition table (DEFTAB)
Name table (NAMTAB)
Argument table (ARGTAB)
1 marks each
Algorithm- 5 mark

Page 5 of 7
 1100CST305122101
1100CST305122101
1100CST305122202

b) Any 2, 3 marks each 6

20 a) 1. Recursive macro 6

Page 6 of 7
 1100CST305122101
1100CST305122101
1100CST305122202

2. General purpose microprocessor

3. Macroprocessor within language translator
2 marks each
b) 4 marks for each method 8
1. Debugging by Induction
2. Debugging by Deduction
3. Debugging by Backtracking
Any two methods

*********

Page 7 of 7
 C 1100CST305122102 Pages: 3

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
[Link] Degree S5 (R, S) / S3 (PT) (S,FE) / S5 (WP) (R) Examination November 2024 (2019 Scheme)

Course Code: CST 305

Course Name: SYSTEM SOFTWARE
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks
1 Write a SIC code to show the use of TD instruction and explain its working. 3
2 How are floating point numbers represented in SIC/ XE? 3
3 Explain the format of object program generated by a two-pass SIC assembler 3
by highlighting contents of each record type.
4 Define assembler directives. Describe any four assembler directives in SIC. 3
5 Differentiate absolute expression and relative expression. Give an example 3
each.
6 Explain literal pool and LITTAB. 3
7 Describe Bootstrap loader. 3
8 Explain dynamic linking. 3
9 With an example explain conditional macro expansion. 3
10 How should a programmer decide whether to use a macro or a subroutine to 3
accomplish a given logical function?

PART B
(Answer one full question from each module, each question carries 14 marks)
Module -1
11 a) Explain the architecture of SIC /XE machine. 9
b) SIC assembly code is upward compatible with SIC/XE. How is this achieved? 5
Explain with respect to the addressing modes and instruction formats.
12 a) Explain the architecture of SIC machine. 8
b) Explain the following: (i) Compilers (ii) Operating system (iii) Interpreters 6
Module -2
13 a) For the following SIC instructions which is assembled using a 2-pass 10

Page 1 of 3
 1100CST305122102

assembler, design an algorithm for performing the pass 1 operations. Also

generate object code and build various data structures and variables for the
following code.

b) Write a sequence of instructions for SIC/XE to divide BETA by GAMMA and 4

to store the integer quotient in ALPHA and remainder in DELTA.
14 a) Write a SIC/XE program to set all the 100 elements of an array A to 0. Here A 5
is an array of 100 words. Use immediate addressing and register-to-register
instructions to make the process as efficient as possible.
b) List out the basic functions of assembler. Identify the uses of SYMTAB and 9
OPTAB during pass 1 and pass 2 of a two-pass assembler.
Module -3
15 a) Describe Program Blocks. With a suitable example, explain how Program 8
Blocks are handled by SIC assembler.
b) Demonstrate the concept of program relocation with the help of a suitable 6
example.
16 a) Describe control section. With suitable example, explain how control sections 7
are handled by SIC assembler.
b) What is the need for a multi-pass assembler? With the help of an example 7
show how forward references are handled by a multi-pass assembler.
Module -4
17 a) What are the data structures used by a two-pass linking loader algorithm? 4
b) Explain pass two algorithm for a two-pass linking loader. 10

Page 2 of 3
 1100CST305122102

18 a) Explain any two machine independent loader features. 8

b) Differentiate between linking loader and linkage editor, with a diagram. Which 6
of these is preferable in a program development environment? Why?
Module -5
19 a) Explain the structure of a text editor using a neat diagram. 10
b) What are the data structures used by a single pass macro processor algorithm? 4
Give their functions.
20 a) Explain Debugging Method by (i) Induction, (ii) Deduction and (iii) 10
Backtracking.
b) Differentiate various types of device drivers. 4
***

Page 3 of 3
 1100CST305122102

Total Pages: 3
Scheme of Valuation/Answer Key
(Scheme of evaluation (marks in brackets) and answers of problems/key)
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
[Link] Degree S5 (R, S) / S3 (PT) (S,FE) / S5 (WP) (R) Examination November 2024 (2019
Scheme)
Course Code: CST 305

Course Name: SYSTEM SOFTWARE

Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks

1 Code : 1 mark 3
The test device (TD) instruction tests whether the addressed device is ready to
send or receive a byte of data. The condition code is set to indicate the result of
this test. Setting of < means the device is ready to send or receive, and = means
the device is not ready. (2 marks)

2 Floating point is stored in 48 bit signed-exponent-fraction format: 3

The fraction is represented as a 36 bit number and has value between 0 and 1.
• The exponent is represented as a 11 bit unsigned binary number between 0
and2047.
• The sign of the floating point number is indicated by s : 0=positive, 1=negative.
• If the exponent has value e and the fraction has value f, the absolute value of
the number represented is f*2^(e-1024). (3 marks)

3 Header, Text and End Records format (1 x 3 = 3 marks) 3

4 Definition of assembler directives. (1 mark) 3
Describe any four assembler directives in SIC. (4x0.5=2 marks)
5 If the result of the expression is an absolute value (constant) then it is known as 3
absolute expression. (1 mark)
If the result of the expression is relative to the beginning of the program then it is
known as relative expression. Label on instructions and data areas and references
to the location counter values are relative terms. (1 mark)
Example each-0.5+0.5

Page 1 of 4
 1100CST305122102

6 Literal pool (1 mark). 3

LITTAB and its contents (2 marks).
7 Bootstrap loader- steps 3
8 Dynamic linking explanation or figures showing dynamic linking (3 marks) 3
9 Conditional macroexpansion- 2 marks 3
Example 1 mark
1 Features like size of the function/macro body, frequency of calling, speed or 3
0 space is of most concern etc...

PART B
(Answer one complete question from each module)
Module -1

1 a) Memory - 1 mark. 9
1 Registers - 1 mark.
Data Formats - 1 mark.
Addressing mode - 2 marks.
Instruction Formats - 1 mark .
Instruction Set - 2 marks.
Input and Output – 1 mark.

b Explain the instruction format in SIC and format 3 instruction format in SIC/XE 5
) and compare the addressing modes and opcode fields that makes it compatible– 5
marks
1 a) Memory - 1 mark. 8
2 Registers - 1 mark.
Data Formats - 1 mark.
Addressing mode - 1 marks.
Instruction Formats - 1 mark..
Instruction Set - 2 marks.
Input and Output – 1 mark.

b Explain each one briefly - 2marks*3 6

Page 2 of 4
 1100CST305122102

)
Module -2
1 a) Pass 1 algorithm – (6 marks). 10
3 Show the Symbol table generation and LOCCTR values assigned to the given
instructions and also the object code (4 marks).
b Correct SIC/XE program with use of extended features of XE architecture- 4 4
) marks
1 a) Correct SIC/XE program with use of extended features of XE architecture- 5 5
4 marks
b Five functions of assembler - (4 marks). 9
) Uses of SYMTAB during pass 1 and pass 2 – (2.5 marks)
Uses of OPTAB during pass 1 and pass 2 – (2.5 marks)
Module -3
1 a) Program Block – (2 marks). 8
5 Example and explanation- (6 marks).
b Concept of program relocation - (4 marks). 6
) Example - (2 marks).
1 a) Control section - (2 marks). 7
6 Example – and handling by assembler- linking of control sections (5 marks).
b Multi-pass assembler need - (2 marks). 7
) Example of handling forward references- (5 marks).
Module -4
1 a) Data structures used - (4 marks). 4
7
b Algorithm/ Steps of Pass 2 of Linking Loader - (10 Marks). 10
)
1 a) Machine independent loader features – 2 nos-explanation - ( 4 Marks *2). 8
8
b Differentiate between linking loader and linkage editor + Figure -( 4 Marks). 6
) preferable explanation-(2marks).
Module -5
1 a) Text editor explanation – (7 marks) 10
9 Diagram -(3 marks)

Page 3 of 4
 1100CST305122102

b Data structures used by a single pass macro processor algorithm -list- 1mark 4
) Function of each- 3 marks
2 a) Debugging by induction, deduction and backtracking are used, explaining each 10
0 process. (3+3+4 marks).

b Character device driver -(2 marks). 4

) Block device driver-(2 marks).
*********

Page 4 of 4
C 1100CST305122103 Pages: 4

Reg No.:_______________ Name:__________________________

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
[Link] Degree S5 (S,FE) (FT/WP), (S3 PT) Examination May 2025 (2019 Scheme)

Course Code: CST305

Course Name: SYSTEM SOFTWARE
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Mar
ks
1 What is system software? List out the differences between system software and 3
application software.

2 Explain about various registers used in SIC/ XE. 3

3 What are assembler directives? Explain the difference between assembler 3

directives WORD and RESW.

4 Describe the addressing modes and instruction format of SIC machine. 3

5 Write notes on literals. What are the different ways of storing the literal values? 3

6 Narrate notes on program relocation and different schemes for relocation. 3

7 What is Linkage editor? Explain using diagram. 3

8 Explain the formats and purpose of revised modification record used along with 3
control sections.

9 Discuss various functions of device drivers. 3

10 Why Debugging is important? Explain different debugging techniques. 3

PART B
(Answer one full question from each module, each question carries 14 marks)
Module -1
11 a) Explain the addressing modes supported by SIC/ XE machine with suitable 8
examples.

b) How are characters, integers and floating-point numbers represented in SIC/XE? 6

12 a) Explain about SIC/XE machine architecture in detail. 10

 1100CST305122103

b) Write an SIC program to find the largest number among FIRST, SECOND and 4
THIRD.

Module -2

13 a) Explain the data structures used by two pass assembler, and write the algorithm 6
for pass 2 of two pass assembler.

b) Explain the functions of assembler. Describe the format of the object program 8
generated by the SIC assembler, explain the content of each record type.

14 a) Write and explain the algorithm for pass 1 of two pass assembler by highlighting 6
the use of different data structures needed for the translation.

b) Assemble the following instructions of SIC/XE. Explain the instruction formats 8

and addressing modes used in each instruction.

Location Symbol field Opcode field Operand field

0003 LDB #LENGTH

… … …

001D STA BUFFER

0020 LDA #3

… … …

002A J @RETADR

… … …

0030 RETADR RESW 1

0033 LENGTH RESW 1

0036 BUFFER RESB 4096

The required opcode values are given below.

Mnemonic Opcode value

 1100CST305122103

LDB m 68

STA m 0C

LDA m 00

Jm 3C

Module -3

15 a) Differentiate the concept of Program blocks and Control Sections using proper 8
examples.

b) Explain the working of a multi pass assembler with example. 6

16 a) Explain the following 8

i) Method of handling Forward references by single pass assemblers, using the

algorithm.

ii) Relocation bit scheme for SIC machine, using example.

b) Explain the difference between the following: 6

i) LDA #3

ii) THREE EQU 3

…
LDA #THREE

iii) THREE EQU 3

…

LDA THREE

Module -4

17 a) Explain the two passes of linking loader using algorithms and associated data 9
structures.

b) Write notes on the different loader design options. 5

18 a) Write short note on the following terms: 6

 1100CST305122103

i) Dynamic Linking

ii) linking loader

ii) Bootstrap loader

b) Write notes on machine dependent loader features. How are these features 8
implemented in Linking loader?

Module -5

19 a) Explain the algorithm and data structures for one pass Macro processor. 10

b) Explain the general design of device driver. 4

20 a) Draw and explain the functions of each block in the structure of a typical text 8
editor.

b) Describe macro definition and expansion with the help of examples. 6

***
 1100CST305122103

Total Pages: 4
Scheme of Valuation/Answer Key
(Scheme of evaluation (marks in brackets) and answers of problems/key)
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

[Link] Degree S5 (S,FE) (FT/WP), (S3 PT) Examination May 2025 (2019 Scheme)

Course Code: CST 305

Course Name: SYSTEM SOFTWARE

Max. Marks: 100 Duration: 3 Hours

PART A

(Answer all questions; each question carries 3 marks) Marks

1 Definition system software 1 mark, comparison at least two points 2 marks. 3

2 Total 9 registers, register name and use 3 marks 3

3 Definition assembler directives 1 mark, comparison 2 marks 3

4 Addressing modes 1.5 marks, instruction format 1.5 marks 3

5 Notes on literals 1 mark, ways of storing the literal values 2 marks 3

6 Notes on program relocation 1 mark, different schemes i)modification record 3

scheme 1 mark, ii)relocation bitmask 1 mark.

7 Linkage editor explanation 2 marks, diagram 1 mark. 3

8 Revised Modification record is used for relocating external reference symbols, 3

explanation 2 marks, format 1 mark.

9 Functions of device drivers, explanation 3 marks 3

 1100CST305122103

10 Importance of Debugging 1 mark, different debugging techniques 2 marks. 3

PART B

(Answer one complete question from each module)

Module -1

11 a) Mainly 5 addressing modes supported by SIC/ XE machine and combinations 8

are also possible, setting n i x b p bit values according to the addressing mode
used 5 marks. Explanation withs uitable examples 3 marks.

b) Character representation1.5 mark, integer representation 1.5 mark and floating 6

point numbers are representation format and value calculation in SIC/XE 3
marks.

12 a) SIC/XE machine architecture – memory 1 mark, registers 1 mark, data formats 1 10

mark, instruction formats 2 marks, addressing modes 2 marks, instructions set 1
mark, handling input and output devices 2 marks.

b) Write an SIC program to find the largest number among FIRST, SECOND and 4
THIRD.

Module -2

13 a) Data structures used 2 marks, and the algorithm and explanation 4 marks 6

b) Functions of assembler 2 marks, the content of each record type 6 marks. 8

14 a) Algorithm for pass 1 of two pass assembler 4 mark, data structures needed 6
explanation 2 marks.

b) 2 marks for each instruction, formats and addressing modes should be explained 8
properly.

Module -3
 1100CST305122103

15 a) Concept of Program blocks 3 marks, Control Sections 3 marks, comparison 1 8

mark, and proper use of examples 1 mark.

b) Working of a multi pass assembler 5 marks, proper use of example 1 mark. 6

16 a) Method of handling Forward references by single pass assemblers, using the 8

algorithm 4 marks.

Relocation bit scheme for SIC machine, using example 4 marks.

b) Explain the difference between the following: each carry 2 marks 6

i) LDA #3 // immediate, stored in the instruction

ii) THREE EQU 3

…
LDA #THREE //immediate and Pc relative, address value is
moving to register

iii) THREE EQU 3

…

LDA THREE //pc relative content of the address location is

moving to register

Module -4

17 a) pass 1 of linking loader using algorithms and associated data structures 4 marks, 9
pass2 - 5 marks

b) Different loader design options. Proper explanation 5 marks 5

18 a) Write short note on the following terms each carry 2 marks 6

i)Dynamic Linking ii)linking loader ii)Bootstrap loader

b) Machine dependent loader features. i)program relocation ii)program linking – each 8

carry 4 marks.
 1100CST305122103

Module -5

19 a) Algorithm 7 marks , and data structures 3 marks . 10

b) Explanation 4 marks 4

20 a) Diagram 4 marks, and explanation 4 marks 8

b) Macro definition and expansion 5 marks, proper use of examples 1 mark. 6

*********