TYBsc Computer Science Solve OS-SysPro Slips | IProgramX

CLICK HERE to download slip questions

Slip 1:

1. Implement a menu driven simulator for hypothetical Simple Instruction Computer that provides the following functionalities.
• Load – Loading of the program from file into memory 
• Print – Printing the program loaded in memory. 
• Run – Executing the loaded program
2. Write a simulation program to implement demand paging using LFU page replacement algorithm. Assume the memory of “n” frames. Show the contents of page after every page replacement in a frame and it at end we told number of page faults accordingly. Input the following page reference string: Page reference string : 3,4,5,4,3,4,7,2,4,5,6,7,2,4,6 

Slip 2:

1. Implement a menu driven simulator for hypothetical Simple Instruction Computer that provides the following functionalities.
• Load – Loading of the program from file into memory 
• Print – Printing the program loaded in memory. 
• Run – Executing the loaded program
2. Write a simulation program to implement Round Robin CPU scheduling algorithm for the given time quantum as input. Also accept the number of processes and arrival time and CPU burst time for each process as input. The output should give the Gant Chart, turnaround time and waiting time for each process. Also display the average turnaround time and average waiting time. 

Slip 3:

1. Implement a menu driven simulator for hypothetical Simple Instruction Computer that provides the following functionalities.
• Load – Loading of the program from file into memory 
• Print – Printing the program loaded in memory. 
• Run – Executing the loaded program
2. Write a simulation program to implement demand paging using LRU (Using Counter) page replacement algorithm. Assume the memory of “n” frames. Show the contents of page after every page replacement in a frame and at end show the total number of page faults accordingly. Input the following Page Reference String : Page Reference String  : 12, 15, 12, 18, 6, 8, 11, 12, 19, 12, 6, 8, 12, 15, 19, 8

Slip 4:

1. Implement a menu driven simulator for hypothetical Simple Instruction Computer that provides the following functionalities.
• Load – Loading of the program from file into memory 
• Print – Printing the program loaded in memory. 
• Run – Executing the loaded program
2. Write a program to implement a toy shell (Command Interpreter). It has its own prompt say “MyShell $”. Any normal shell command is executed from this shell (MyShell$) by starting a child process to execute the system program corresponding to the command. It should additionally interpret the following commands: 
• 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 inodes of the files in the current directory. 

Slip 5: 

1. Implement a menu driven simulator for hypothetical Simple Instruction Computer that provides the following functionalities.
• Load – Loading of the program from file into memory 
• Print – Printing the program loaded in memory. 
• Run – Executing the loaded program
2. Write a simulation program to implement sequential (Contiguous) Allocation method for file. Assume disk having “n” number of blocks ranging from 0 to n-1. Randomly mark some of the blocks as allocated and accordingly maintain the list of free blocks. Perform the following operation using following menu.
• Show Bit Vector
• Create New File
• Show Directory
• Delete File
• Exit

Slip 6:

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 the line editing commands. Implement the following commands.
• a - Append
• p - Print all Lines
• s - Save
• e - Exit
2. Write a simulation program to implement demand paging using MFU page replacement algorithm. Assume the memory of “n” frame. Show the contents of page after every page replacement in a frame and at end show the total number of page faults accordingly. Input the following Page Reference String: Page Replacement String: 8, 5, 7, 8, 5, 7, 2, 3, 7, 3, 5, 9, 4, 6, 2. 

Slip 7:

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 „$‟ prompt to accept the line editing commands. Implement the following commands:
• a - Append
• d n- Delete N^th Line
•  p - Print all Lines
• e - Exit
2. Write the simulation program to implement demand paging using FIFO page replacement algorithm. Assume the memory of “n” frames. Show the contents of page after every page replacement in a frame and at end show the total number of page faults accordingly. Input the following Page Reference String: Page Reference String: 3,4,5,6,3,4,7,3,4,5,6,7,2,4,6.

Slip 8:

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 „$‟ prompt to accept the line editing commands. Implement the following commands.
• s - Save
• a - Append
• d n1 n2 -  Delete lines from position n1 to n2
• e - Exit
2. Consider the following snapshot of the system 
   Calculate and display the contents of matrix Need. Using Safety and Resource-Request Algorithm perform the following operations: 
• Check whether the current system is in safe state or not. 
• If a request from process P1 arrives as (1, 0, 2), can it be granted immediately by keeping system in safe state.

Slip 9:

1. Write a program to implement a DFA Driver for any given language. Accept number of states, number of input symbols, set of input symbols, number of final states, set of final states and transition table as input. (Input language should be given by examiner). Write menu driven program that will have options as:
• Read DFA 
• Show Transition Table
• Check Acceptance of the Given String
• Exit
2. Write a simulation program to implement demand paging using FIFO page replacement algorithm. Assume the memory of “n” frames. Show the contents of page after every page replacement in a frame and at end show the total number of page faults accordingly. Input the following Page Reference String. Page Reference String : 3,4,5,4,3,47,2,4,5,6,7,2,4,6 

Slip 10:

1. Write a program to implement DFA driver for the language L = “Set of all string that starts with a, ending with b” over {a,b}. 
2. Write a simulation program to implement a Pre-emptive Shortest Job First (SJF) – CPU scheduling algorithm. Accept the number of Processes as input. Also accept arrival time and CPU burst time for each process as input. 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.

Slip 11:

1. Write a command line program for line editor. The file to be edited is taken as command line arguments. An empty file is opened for editing if no argument is supplied. It should display a „$‟ prompt to accept the line editing commands. Implement the following commands: 
• a - Append 
• p m n - Print range of lines from m to n 
• i n  - Insert line at position n
• e - Exit
2. Write a simulation program to implement a linked allocation method for file. Assume disk having “n” number of blocks ranging from 0 to n-1. Randomly mark some blocks as allocated and accordingly maintain the list of free blocks. Perform the following operation using the following menu:
• Show Bit Vector
• Create New File
• Show Directory
• Delete File
• Exit

Slip 12:

1. Write a program to implement a DFA driver for the language L = “Set of all strings that containing 101 as substring” over {0,1}.
2. Write a simulation program to implement Pre-emptive Priority CPU scheduling algorithm. Accept the number of processes, arrival time, CPU burst time and priority for each process as input. Priorities should in High to Low order (1 is High). 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.

Slip 13:

1. Consider the following Macro definition and Data structures (stored as an array of structure) association with it as follows: 
   
2. Write a program to implement a toy shell (Command Interpreter). It has its own prompt say “MyShell $”. Any normal shell command is executed from this shell (MyShell$) by starting a child process to execute the system program corresponding to the command. It should additionally interpret the following commands:  
• search f file name :- To search first occurrence of the pattern in the file 
• search a file name :- To search all the occurrence of the pattern in the file 
• search c file name :- To count the number of occurrence of the pattern in the file. 

Slip 14:

1. Write a macro pre-processor program that will create and display the contents of MDT, MNT and PNTAB for the following macro definition: 
   
2. Write a program to implement a toy shell (Command Interpreter). It has its own prompt say “MyShell $”. Any normal shell command is executed from this shell (MyShell$) by starting a child process to execute the system program corresponding to the command. It should additionally 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 the lines in the file.

Slip 15:

1. Write a macro pre-processor program that will create and display the contents of MNT, MDT and KPDTAB for the following macro definition
   
2. Write a simulation program to implement FCFS CPU-scheduling algorithm. Accept the number of Processes as input. Also accept arrival time and CPU burst time for each process as input. 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. 

Slip 16:

1. Write an assembler that will create and display the contents of symbol table. Also construct the Intermediate Code of type variant I for the following error-free assembly program:
   
2. Write a program to implement a toy shell (Command Interpreter). It has its own prompt say “MyShell $”. Any normal shell command is executed from this shell (MyShell$) by starting a child process to execute the system program corresponding to the command. It should additionally interpret the following commands: 
• count c filename :- To print number of characters in the file.
• count w filename  :- To print number of words in the file. 
• count 1 filename :- To print number of lines in the file.

Slip 17:

1. Write an assembler that will create and display the contents of symbol table. Also construct the Intermediate Code of type variant I for the following error-free assembly program:
   
2. Write a program to implement a toy shell (Command Interpreter). It has its own prompt say “MyShell $”. Any normal shell command is executed from this shell (MyShell$) by starting a child process to execute the system program corresponding to the command. It should additionally interpret the following commands: 
• count c filename :- To print number of characters in the file.
• count w filename  :- To print number of words in the file. 
• count 1 filename :- To print number of lines in the file.

Slip 18:

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 the line editing commands. Implement the following commands.
• s - Save
• a - Append
• c n1 n2 -  Copy line from position n1 to n2
• e - Exit
2. Write a simulation program to implement sequential (Contiguous) Allocation method for file. Assume disk having “n” number of blocks ranging from 0 to n-1. Randomly mark some of the blocks as allocated and accordingly maintain the list of free blocks. Perform the following operation using following menu.
• Show Bit Vector
• Create New File
• Show Directory
• Delete File
• Exit

Slip 19:

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 the line editing commands. Implement the following commands.
• s - Save
• a - Append
• m n1 n2 -  Copy line from position n1 to n2
• e - Exit
2. Write a simulation program to implement a Non-Pre-emptive Shortest Job First (SJF) – CPU scheduling algorithm. Accept the number of Processes and arrival time and CPU burst time for each process as input. 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.

Slip 20:

1. Write a macro pre-processor program that will create and display the contents of MNT, PNTAB, and KPDTAB for the following macro definition. 
   
2. Write a simulation program to implement non-pre-emptive Priority CPU scheduling algorithm. Accept the number of Processes and arrival time, CPU burst time and priority for each process as input. Priorities should in High to Low order (1 is High). 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.

Slip 21:

1. Write an assembler that will display the following errors and warnings:
• Symbol used but not defined
• Symbol defined but not used
• Re-declaration of the Symbol,,,, Present in the following assembly program:
2. Write a program to implement a toy shell (Command Interpreter). It has its own prompt say “MyShell $”. Any normal shell command is executed from this shell (MyShell$) by starting a child process to execute the system program corresponding to the command. It should additionally interpret the following commands:
• count c filename :- To print number of characters in the file.
• count w filename  :- To print number of words in the file. 
• count 1 filename :- To print number of lines in the file.

Slip 22:

1. Write an assembler that will display the following errors and warnings:
• Symbol used but not defined
• Symbol defined but not used
• Re-declaration of the Symbol, Present in the following assembly program: 
2. Write the simulation program to implement demand paging using FIFO page replacement algorithm. Assume the memory of “n” frames. Show the contents of page after every page replacement in a frame and at end show the total number of page faults accordingly. Input the following Page Reference String. Page Reference String: 3,4,5,6,3,4,7,3,4,5,6,7,2,4,6 

Slip 23:

1. Write a program to implement DFA driver for the language L = “Set of all strings that containing 101 as substring” over {0, 1}. 
2. Write a program to implement a Banker‟s Algorithm. Accept the total number of processes (n) and resource types (m) as input. Also accept the number of initial instances for each resource type. Allocation and Max of size “nxm” as input and perform the following operations:
• a) Calculate and display the final contents of Available array of size “m”
• b) Calculate and display the contents of Need matrix of size “nxm”
• Using Safety and Resource-Request algorithm perform the following operations:
• a) Check whether system is in safe sate or not. 
• b) If request of size “m” arrives from process Pi, can it be granted immediately by keeping system in safe state?

Slip 24:

1. Write a command line program for line editor. The file to be edited is taken as command line arguments. An empty file is opened for editing if no argument is supplied. It should display a „$‟ prompt to accept the line editing commands. Implement the following commands:
•  i n  : Insert line at position n.
• d n1 n2 : Delete line between position n1 and n2
• s  : Save
• p   : Print all lines
• e  : Exit
2. Consider the following snapshot of the system 
     Calculate and display the contents of matrix Need. Using Safety and Resource-RequestAlgorithm perform the following operations:
• Check whether the current system is in safe state or not.
• If a request from process P4 arrives as (0, 0, 4, 1), can it be granted immediately by keeping system in safe state. 

Slip 25:

1. Consider the following Macro definition and Data structures (stored as an array of structure) association with it as follows: 
   
2. Write a simulation program to implement demand paging using MFU page replacement algorithm. Assume the memory of “n” frame. Show the contents of page after every page replacement in a frame and at end show the total number of page faults accordingly. Input the following Page Reference String. Page Replacement String: 3,4,5,4,3,4,7,2,4,5,6,7,2,4,6