IGNOU BCA MCA SOLVED ASSIGNMENT 2017-18
MCS-013 Discrete Mathematics
QUESTIONS SOLVED IN ASSIGNMENT:
QUESTIONS SOLVED IN ASSIGNMENT 1.With the aid of a diagram, describe what happens during the “fetch-execute” cycle. Include a description of how interrupts are detected. List various types of interrupts. Also explain in detail what happens when an interrupt occurs?
2.(a) Explain the meaning and importance of the following terms with respect to CPU scheduling of processes: CPU bound, I/O bound, Pre-emptive, non-pre-emptive, turnaround time, normalised turnaround time and response ratio.
(b)Consider the following set of processes with arrival time and CPU execution time given in milliseconds. A process with a larger priority number has a higher priority. If any assumptions made by you, state them.
(i)Draw the Gantt charts illustrating the execution of these processes using the FCFS, SJF, Round Robin(with quantum = 2).
(ii) Also calculate the average turn around time, average waiting time, processor utilization and throughput for each of the algorithms mentioned in (i).
(c) Explain the trade-offs involved in choosing the size of a time slice for a round robin algorithm
3.Describe the following disk scheduling policies: First Come First Serve (FCFS), Shortest Seek Time First, SCAN, C-SCAN, Look and C-Look. Show the disk arm movement and calculate the number of tracks traversed using all of the policies if the disk has 200 tracks and the requested tracks, in the order received, are 55, 58, 39, 18, 90, 160, 150, 38, 184.
4.Write an interactive C/C++ program for implementing the Banker’s Algorithm.
5.Discuss in detail the features, Process management, Memory management, I/O Management, File management and Security and Protection in Linux Operating System.