Download Solution Ignou MCA Solved Question Paper
Category: Solved
Write Dijkstra’s algorithm and explain how does it work. Use the algorithm to find the length of a shortest path between the vertices A and F in the weighted graph shown in Figure 1. Show all the intermediate steps.
Download Solution Ignou MCA Solved Question Paper
Explain how a network congestion is controlled using slow start algorithm in TCP with help of an illustration. Is congestion control and flow control are equivalent?
Download Solution Ignou MCA Solved Question Paper
Describe how MACAW is an improvement over MACA ?
Download Solution Ignou MCA Solved Question Paper
Write a monitor solution to the dinning-philosopher problem.
Download Solution Ignou MCA Solved Question Paper
Study and implement the Lamport’s Bakery Algorithm for Interprocess synchronization using C/C++ programming language.
Download Solution Ignou MCA Solved Question Paper
Discuss in detail the features, Process management, Memory management, I/O and File management and Security and Protection in Windows 10 Operating System.
Download Solution Ignou MCA Solved Question Paper
Consider the following page-reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
How many page faults would occur for following replacementalgorithms for a memory with 4 frames? Remember that all framesare initially empty, so your first unique pages will all cost onefault each.(i) LRU replacement.(ii) FIFO replacement.(iii) Optimal replacement. Download Solution Ignou Read More …
Also calculate the average turn around time, average waiting time, processor utilization and throughput for each of the algorithms mentioned in (i).
Download Solution Ignou MCA Solved Question Paper
Draw the Gantt charts illustrating the execution of these processes using the FCFS, SJF, Round Robin (with quantum = 1) and Priority Based Scheduling algorithms.
Download Solution Ignou MCA Solved Question Paper
