Sy Sos Practical Questions Paper

UNIVERSITY OF PUNE
T.Y.B.Sc. (Computer Science) Practical Examination, March/October

Lab Course I :System Programming & Operating System
Duration: 3 Hrs
Max Marks:80
1. Write a program for SMACO that supports following instruction set.

Mnemonic
ADD
Opcode
01
Meaning
Add memory operand to register.
SUB
02
Subtract memory operand from register.
MULT
03
Multiply memory operand to register.
MOVER
04
Move memory operand to register.
MOVEM
COMP
05
06
Move register to memory.

Compare register with memory operand.
BC
07
Branch to given address based on condition code in

first operand.
DIV
08
Divide register by memory operand.
READ
09
Read input value.
PRINT
10
Print given value.
STOP
11
Stop the execution of machine language program
Write a machine language program to find 'the greater of 2 numbers by using above instruction
Opcodes.
[ 35 Marks]
2. Write the simulation program for Round Robin Scheduling for given time quantum, The arrival time and
first CPU-burst of different jobs should be input to the system. Assume the fixed I/O waiting time ( 2
units). The next CPU-burst should be generated using random function. The output should give the Gantt
Chart, turnaround time and waiting time for each process. Also display the average turnaround time and
average waiting time.
[ 35 Marks]
3.
Oral/Viva
[ 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80

Mnemonic
ADD
Opcode
09
Meaning
SUB
10
MULT
07
MOVER
01
MOVEM
02
COMP
05
BC
06
Branch to given address based on condition code in first operand.
DIV
08
READ
03
Read input value.
PRINT
04
Print given value.
STOP
11
Write a machine language program to find the addition of given n numbers by using above instruction
Opcodes.
[ 35 Marks]
2. Write a simulation program for the implementation Sequential (Contiguous) File Allocation
Method. Assume disk having n number of blocks. Randomly mark some block as allocated
and accordingly maintain the free block list. Make the use of following menu to perform
Operations.
a)
b)
c)
d)
Allocate space for new file.

Deallocate space of a deleted file.
Show used space/free space on disk
Exit.
3. Oral/Viva
[ 35 Marks]
[ 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80

Mnemonic
ADD
Opcode
04
Meaning
SUB
05
MULT
08
MOVER
06
MOVEM
07
COMP
11
BC
10
DIV
09
READ
01
Read input value.
PRINT
02
Print given value.
STOP
03
Write a machine language program to find the QCD of given 2 numbers by using above
instruction Opcodes.
[ 35 Marks]
2. Consider the snapshot of a system.
JOB
P0
P1
P2
P3
P4
Allocation
A
B
0
1
2
0
3
0
2
1
0
0
C
0
0
2
1
2
A
7
3
9
2
4
MAX
B
5
2
0
2
3
C
3
2
2
2
3
A
3
Available
B
C
3
2
A) Display the contents of Need Matrix.

B) Check whether the system is in safe state or not. If yes give the safe sequence.
C) If request from process p l arrives as (1,0,2) can it be granted immediately.[35 Marks]
3. Oral/Viva
[ 10 Marks]
UNIVERSITY OF PUNE
Lab Course I: System Programming & Operating System
Duration: 3 Hrs
Max Marks:80

Mnemonic
ADD
Opcode
03
Meaning
SUB
02
MULT
05
MOVER
09
MOVEM
08
COMP
11
BC
10
DIV
04
READ
07
Read input value.
PRINT
06
Print given value.
STOP
01
Write a machine language program to print -1,0 or 1 depending on given number is negative, zero or positive
respectively. Use above instruction Opcodes.
[35 Marks]
2. Write the simul.ation program using FCFS. The arrival time and first CPU bursts of different Jobs should
be input to the system. Assume the fixed I/0 waiting time (2 units). The next CPU
Bursts should be generated using random function. The Output should give the Gantt chart,
turnaround time and waiting time for each process and average times.
[35 Marks]
3.
Oral/Viva
[ 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
1. Write a command line program for line editor. The file to be edited is taken as command line
Argument. An empty file is opened for editing if no argument is supplied. It should display a $
Prompt to accept command for editing. Implement the following commands
a
Append
dn
Delete line number n
dmn -
Delete range of lines from m to n
Print all lines
2. Write the simulation program for demand paging and show the page scheduling and total number of page
faults according the MFU page replacement algorithm. Assume the memory of n frames.
Reference String 3,5,7,2,5,1,2,3, 1,3,5,3,1,6,2
3
Oral/viva
[35 Marks]
[ 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
1. Write a command line program for line editor. The file to be edited is taken as command line argument.
An empty file is opened for editing if no argument is supplied. It should display a $ Prompt to accept
command for editing. Implement the following commands
a
p
Pmn
In
Append
Print all lines.
Print range of lines from m to n
Insert lines at position n.
[ 3S Marks]
2. Write the simulation program for Preemptive SJF Scheduling. The arrival time and first CPU -burst of
different jobs should be input to the system. Assume the fixed I/O waiting time ( 2 units). The next Cl'Uburst should be generated using random function. The output should give the Gantt Chart, turnaround time
and waiting time for each process.
Also display the average turnaround time and average waiting time.
[ 3S Marks]
3. Oral/Viva
[ 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
a
p
m nl n2
m nl n2 n3
Append
Print all lines
Move line n I at n2 position.
Move range of lines from n 1 to n2 at n3 position.
[ 35 Marks]
faults according the LRU page replacement algorithm" Assume the memory of n frames.
Reference String : 3,4,5,4,3,4,7,2,4,5,6,7,2,4,6
[ 35 Marks]
3. Oral/Viva
( 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
a
p
in
dmn
Append
Print all lines
Insert lines at position n
Delete lines from number m to n.
[ 35 Marks]
faults according the FIFO page replacement algorithm. Assume the memory of n frames.
3.
Reference String : 3,4,5,4,3,4, 7, 2, 4, 5, 6, 7, 2, 4,6
[35 Marks]
Oral/viva
[ 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
1. Write a Assembler for SMACO that will list the error in a programs. Error to be handled are
a. Symbols used but not defined.
b. Symbols declared but J(ot used.
c. Redeclaration of symbols.
Input Program :START
READ
Y
MOVER
ADD
X
MOVEM
STOP
X
DS
Y
DS
END
100
X
BREG,X
BREG,X
AREG,Z
1
1
[35 Marks]
faults according the FIFO Page Replacement algorithm. Assume the memory of n frames.
Reference String : 3,4,5,6,3,4,7,3,4,5,6, 7, 2, 4,6
[35 Marks]
3. Oral/viva
[ 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
1. Write a Assembler for SMACO that will list the errors in a programs Errors to be handled are
a, Invalid Statement
b. Invalid Mnemonic
[35 Marks]
Input Program
START
1 00,2
A
X
Y
READ
MOVER
ADD
MOVEM
STOP
DS
1
DS
1
END
A,AREG
AREG,A
AREG,='2'
2. Write a program that behaves like shell (Command Interpreter), It should display the command prompt as
"MySheIl$". Any shell command shall be executed from your shell by starting child process to execute the
program corresponding to the given command. Additionally it should interpret the following commands
[35 Marks]
count -c filename :- To print number of characters in the file.
count -w filename' :- To print the number of words in file.
count -I filename :- To print number oflines in file.
3. Oral/viva
[ 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
1. Write a Assembler for SMACO that will display the: contents of Symbol Table, Literal Table and Pool
Table.
A
B
START
MOVER
MOVER
MOVER
LTORG
MOVER
MOVER
MOVER
PRINT
STOP
DS
1
DC
'2'
END
100
BREG,=' 7'
AREG,='l?
AREG,A
DREG,='4'
CREG,='l'
BREG,B
A
[35 Marks]
2. Write a program that behaves like shell (Command Interpreter). It should display the
command prompt as "MyShell$". Any shell command shall be executed from your shell by
starting child process to execute the program corresponding to the given command.
Additionally it should interpret the following commands
typeline +n filename ;To print first n lines in the file.
typeline -n filename ;To print last n lines in the file.
Typeline -a filename ;To print all line in the file. .
[ 35 Marks]
3. Oral/viva
[ 10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
1. Write a Assembler for SMACO that will display the: contents of Symbol Table, Literal Table and Pool
Table.
START
MOVER
MOVER
MOVER
LTORG
MOVER
MOVER
MOVER
PRINT
STOP
DS
1
DC
'2'
END
A
B
100
BREG,=' 7'
AREG,='l?
AREG,A
DREG,='4'
CREG,='l'
BREG,B
A
[35 marks]
2. Consider the following snapshot of a system.

JOB
P0
P1
P2
P3
P4
Allocation
A
B
0
1
2
0
3
0
2
1
0
0
C
0
0
2
1
2
MAX
A
7
3
9
2
4
[35 Marks]
B
5
2
0
2
3
C
3
2
2
2
3
Available
A
B
3
3
C
2
A) Display the contents of Need Matrix.

3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
1. Write a macro per-processor that will display the contents of MNT, MDT, PNTAB, KPDTAB for the
following macro
X
Y
MACRO
CALC
MOVER
&OP
MOVEM
MEND
START
READ
READ
CALCAL
PRINT
STOP
DS
DS
END
&A,&B,&REG=CREG,&O P=M ULT

&REG,&A
&REG,&B
&REG,&A
100
x
Y
X,Y,&OP=ADD
X
1
1
[ 35 Marks]
2. Write a program that behaves like shell (Command Interpreter). It should display the command prompt
as "MyShel1$". Any shell command shall be executed from your shell by starting child process to
execute the program corresponding to the given command.
list -f dirname :To print names of all the files in current directory.
list -n dirname :To print the number of all entries in the current directory.
list -i dirname :To print names and in odes of the files in the current directory.
[35 Marks]
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks:80
1. Write a macro per-processor that will display the contents of MNT, PNTAB. KPDTAB, APT for the
following macro
MACRO
X
Y
OPERT
&LAB MOVER
&OP
MOVEM
MEND
START
READ
READ
OPERT
PRINT
STOP
DS
1
DS
1
END
&A, &B ,&LAB=,&REG=CREG,&OP=MULT

&REG,&A
&REG,&B
&REG,&A
100
X
Y
X,Y,&LAB=LOOP,&OP=ADD
X
2. Consider the following snapshot of a system.

JOB
P0
P1
P2
P3
P4
A
0
0
1
1
0
Allocation
B
C
5
3
1
1
0
0
4
6
0
1
D
2
2
0
4
4
A
5
0
1
2
0
MAX
B
C
5
3
1
1
7
5
4
6
6
5
D
2
2
0
6
6
A
1
A) Display the contents of Need Matrix

C) If request from process p4 arrives as (0,0,4,1) can it be granted immediately
3. Oral/Viva
Available
B
C
D
5
2
0
[35 Marks]
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. Write a macro per-processor that will display the contents or MDT and perform macro expansion.
MACRO
INCR
MOVER
SUB
MOVEM
MOVEM
MEND
START
READ
READ
X
Y
K
&X,&Y,&Z
&REG,&X
&REG,&Y
&REG,&Z
&REG,&X
100
A
B
INCR
PRINT
STOP
A,B,K
DS
DS
DS
END
1
1
1
[35 Marks]
2. Write a program that behaves like shell (Command Interpreter). It should display the command prompt as
"MyShell$". Any shell command shall be executed from your shell by starting child process to execute the
program corresponding to the given command.
list -f dimame :- To print names of all the files in current directory.
list -n dimame :- To print the number of all entries in the current directory.
list -i dimame :- To print names and inodes of the files in the Current directory.
[35 Marks]
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
1.
Y
K
Max Marks: 80
Write a macro per- processor that will display the Contents of MDT
MACRO
INCR
MOVER
SUB
MOVEM
MOVEM
MEND
START
READ
READ
INCR
PRINT
STOP
DS
DS
DS
END
&X,&Y,&Z
&REG,&X
&REG,&Y
&REG,&Z
&REG,&X
100
A
B
A,B,K
K
1
1
1
2. Write a simulation program for the implementation Sequential(Contiguous) File Allocation method. Assume disk
having n number of blocks. Randomly mark some block as allocated and accordingly maintain the free block list.
Make the use of following menu to perform operations.
a) Allocate space for new file.
b) Deallocate space of a deleted file.
c) Show used space/free space on.disk.
[ 35 Marks]
d) Exit.
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. Implement DFA Driver for following language L= 'Set of all strings that starts and end with same letter over {a,b}'
35 Marks]
2. Write the simulation' program using FCFS scheduling algorithm. The arrival time and first
CPU-burst of different jobs should be input to the system. Assume the fixed I/O waiting time
(2 units). The next CPU-burst should be generated using random [unction. The output should
give the Gantt Chart, turnaround time and waiting time for each process. Also display the
average turnaround time and average waiting time.
[ 35 Marks]
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. Implement DFA Driver for following language L='Set of all strings that containing 101 over {O,l},
[35Marks]
2. Write the simulation program for Preemptive SJF scheduling algorithm. The arrival time and first CPU-burst of
different jobs should be input to the system. Assume the fixed I/O waiting time (2 units). The next CPU-burst
should be generated using random function. The output. Should give the Gantt Chart, turnaround time and waiting
time for each process. Also display the average turnaround time and average waiting time.
[ 35 Marks ]
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. Implement DfA Driver for following language L=.Set of all strings that starts with a, ends with b and having
substring bbc over {a.b,c}'
[35 Marks]
2.
Write the simulation program for Non-Preemptive SJF scheduling algorithm. The arrival time and first CPU-burst of different
jobs should be input to the system. Assume the fixed I/O waiting time (2 units). The next CPU-burst should be generated using
random function. The output should give the Gantt chart, turnaround time and waiting time for each process. Also display the
average turnaround time and average waiting time.
[ 35 Marks]
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. implement DFA Driver for following language L= Set of all strings that starts with a, ends with b and having
substring abb over {a.b,c}'
[35 Marks]
2. Write the simulation program for Non-Preemptive Priority scheduling algorithm. The arrival time and first
CPU-burst of different jobs should be input to the system. Assume the fixed I/O waiting time (2 units). The next
CPU-burst should be generated using random function. The output should give the Gantt Chart, turnaround time
and waiting time for each process. Also display the average turnaround time and average waiting time.
[35 Marks]
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. Write a program for SMACO that: supports following instruction set.

Mnemonic
Opcode
ADD
SUB
MULT
MOVER
MOVEM
COMP
BC
DIV
READ
PRINT
STOP
03
02
05
09
08
11
10
04
07
06
01
Meaning
Read input value.
Print given value.
Write a machine language program to print -1, 0 or 1 depending on given number is negative, zero or positive
respectively. Use above instruction Opcodes.
[ 35 Marks]
2. Write a simulation program for the implementation LinkedAllocation method of File
Allocation. Assume disk having n number of blocks. Randomly mark some block as allocated and accordingly
maintain the free block list. Make the use of following menu to
perform operations.
a) Allocate space for new file,
b) Deallocate space .)[ a' deleted file .
c) Show used space/free space on disk.
d) Exit.
[ 35 Marks]
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. Write a program for SMACO that supports following instruction set

Mnemonic
Opcode
ADD
SUB
MULT
MOVER
MOVEM
COMP
BC
DIV
READ
PRINT
STOP
11
10
09
08
07
06
05
04
03
02
01
Meaning
Read input value.
Print given value.
Write a machine language program to find the factorial of given number by using above instruction Opcodes.
[ 35 Marks]
2. Write a simulation program for the implementation Index Allocation Method for File Allocation. Assume disk
having n number of blocks. Randomly mark some block as allocated and accordingly maintain the free block
list. Make the use of following menu to perform operations,
a) Allocate space for new file.
b) Deallocate space of a deleted file.
c) Show used space/free space on disk.
d) Exit.
[35 Marks]
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. Implement DFA Driver [or following language L= 'Set of all strings that starts with 00, ending with II over
{O,I ,2}'
[ 3S Marks]
2. Write a simulation program for the implementation Linked Allocation method of File Allocation. Assume disk having
n number of blocks. Randomly mark some block as allocated and accordingly maintain the free block list. Make the use
of following menu to perform operations.
a). Allocate space for new file.
b). Deallocate space of a deleted file.
c).Show used space/free space on disk.
d). Exit.
[ 3S Marks]
2. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. Write a macro per-processor that will display the contents of MNT, MDT, PNTAB, KPDTAB For the following
micro
MACRO
CALC
MOVER
&OP
MOVEM
&A,&B,&REG=CREG ,&OP= MULT

&REG,&,A
&REG,&B
&REG,&A
MEND
X
Y
START
100
READ
READ
X
Y
CALCAL
PRINT
STOP
DS
DS
END
X,Y,&OP=ADD
X
1
1
[35 Marks]
2. Write the simulation program for demand paging and show the page scheduling and total number of page faults
according the MRU page replacement algorithm. Assume the memory of n frames.
Reference String: 3,5,7, 2, 5,1,2,3,1,3,5,3,1,6,2
[35 Marks]
3. Oral/Viva
[10 Marks]
UNIVERSITY OF PUNE
Duration: 3 Hrs
Max Marks: 80
1. Write command line program for line editor. The file to be edited is taken as command line argument. An
empty file is opened for editing if no argument is supplied. lt should display a $ Prompt to accept command for
editing. Implement the following commands
a
Append
pn
Print line number n
p n, m
Print range of lines from n to m
dn
Delete nth line
2. Write a program that behaves like shell (Command Interpreter). It should display the command prompt as
"MyShell$". Any shell command shall be executed from your shell by starting child process to execute the
program corresponding to the given command.
list -f dimame :To print names of all the files in current directory.
list -n dimame :To print the number of all entries in the current directory.
list -i dimame :To print names and in odes of the files in the current directory.
[ 3' Marks]
3. Oral/Viva
[10 Marks]

Sy Sos Practical Questions Paper

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Sy Sos Practical Questions Paper

Hochgeladen von

Copyright:

Verfügbare Formate

UNIVERSITY OF PUNE

T.Y.B.Sc. (Computer Science) Practical Examination, March/October

1. Write a program for SMACO that supports following instruction set.

Subtract memory operand from register.

Multiply memory operand to register.

Move memory operand to register.

Move register to memory.

Branch to given address based on condition code in

Divide register by memory operand.

Read input value.

Print given value.

Stop the execution of machine language program

1. Write a program for SMACO that supports following instruction set.

Subtract memory operand from register.

Multiply memory operand to register.

Move memory operand to register.

Move register to memory.

Compare register with memory operand.

Branch to given address based on condition code in first operand.

Divide register by memory operand.

Read input value.

Print given value.

Stop the execution of machine language program

Allocate space for new file.

1. Write a program for SMACO that supports following instruction set.

Subtract memory operand from register.

Multiply memory operand to register.

Move memory operand to register.

Move register to memory.

Compare register with memory operand.

Branch to given address based on condition code in first operand.

Divide register by memory operand.

Read input value.

Print given value.

Stop the execution of machine language program

A) Display the contents of Need Matrix.

1. Write a program for SMACO that supports following instruction set.

Subtract memory operand from register.

Multiply memory operand to register.

Move memory operand to register.

Move register to memory.

Compare register with memory operand.

Branch to given address based on condition code in first operand.

Divide register by memory operand.

Read input value.

Print given value.

Stop the execution of machine language program

Delete line number n

Delete range of lines from m to n

Print all lines

Reference String : 3,4,5,4,3,4, 7, 2, 4, 5, 6, 7, 2, 4,6

2. Consider the following snapshot of a system.

A) Display the contents of Need Matrix.

&A,&B,&REG=CREG,&O P=M ULT

&A, &B ,&LAB=,&REG=CREG,&OP=MULT

2. Consider the following snapshot of a system.

A) Display the contents of Need Matrix

1. Write a program for SMACO that: supports following instruction set.

1. Write a program for SMACO that supports following instruction set

&A,&B,&REG=CREG ,&OP= MULT

Das könnte Ihnen auch gefallen