INTERNAL ASSIGNMENT – 2
Operating System
(BBCAMAJ06C)
Subject BCA(Hons.)
Last Date of Submission
Semester V
08/09/2025
Course Type MAJ-6
Name of Student Roll
Submitted to
1. Consider the following processes, which are in the ready queue in the given order with the next CPU
burst in milliseconds-
Process Burst Time
P1 7
P2 14
P3 3
P4 6
Find out the ATAT and AWT of the processes using-
i) FCFS scheduling algorithm
ii) SJF scheduling algorithm
iii) RR scheduling algorithm (assume 1 time quantum = 4 milliseconds).
2. Consider the following process-
Process Burst Time Arrival Time
P1 15 0
P2 2 2
P3 9 2
P4 3 10
Find out the ATAT and AWT of the processes using-
i) SJF scheduling algorithm
ii) SRTF scheduling algorithm
3. Consider the following set of process with the length of the CPU burst given in milliseconds-
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
All the processes are assumed to have arrived in order P1, P2, P3, P4 and P5 at time 0 milliseconds.
a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling
algorithm-
FCFS scheduling
Page 1 of 2
INTERNAL ASSIGNMENT – 2
Operating System
(BBCAMAJ06C)
SJF scheduling
RR scheduling (1 time quantum = 1 milliseconds)
Non-Preemptive Priority scheduling (a smaller number implies the higher priority)
b) What is the Turnaround time for each process of the scheduling algorithm at part a?
c) Which of the algorithm results in the minimum average waiting time?
4. Find out the average waiting time and average turnaround time of the following processes by using
FCFS scheduling and draw the require Gantt chart.
Process Arrival Time Burst Time
A 0 7
B 4 4
C 5 1
D 9 1
E 2 3
5. Consider the set of 5 processes whose arrival time and burst time are given below-
Process Arrival time Burst time
P1 3 4
P2 5 3
P3 0 2
P4 5 1
P5 4 3
If the CPU scheduling policy is FCFS, calculate the average waiting time and average turnaround time.
Assignment must be submitted in handwritten form (on A4 size paper, single side)
Print this Assignment (B/W) and attach with your answers
Page 2 of 2
INTERNAL ASSIGNMENT – 3
Operating System
(BBCAMAJ06C)
Subject BCA(Hons.)
Semester V Last Date of Submission
15/09/2025
Course Type MAJ-6
Name of Student Suman Baral Roll 01
Submitted to Abhijit Roy
1. Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order), how would the
first-fit, best-fit and worst-fit algorithms places processes of 212 KB, 417 KB, 112 KB and 426 KB (in order)?
Which algorithm makes the most efficient use of memory?
2. On a system using best-fit allocation, assume memory is allocated as specified in Fig. 8(Ex) before additional
requests for 20K, 10K, and 5K (in that order) are received. At what starting address will each of the additional
requests be allocated?
3. A worst-fit allocator always splits the largest free memory area while making an allocation. A free list
contains three memory areas of sizes 6 KB, 15 KB and 12 KB. The next four memory requests are for 10 KB,
2 KB, 5 KB, and 14 KB of memory. The only placement strategy that would be able to accommodate all four
processes is - (a) First Fit (b) Best Fit (c) Worst Fit (Perform all required calculation for your answer)
4. Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 KB,
4 KB, 20 KB, 18 KB, 7 KB, 9 KB, 12 KB, and 15 KB. Which hole is taken for successive segment requests
of - (a) 12 KB (b) 10 KB (c) 9 KB
for first fit? Now repeat the question for best fit, worst fit, and next fit.
5. Given the following information:
Job list:
Job Number Memory Requested Memory Block Memory Block Size
Job 1 690 K Block 1 900 K (low-order memoy)
Job 2 275 K Block 2 910 K
Job 3 760 K Block 3 300 K (high-order memory)
a. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the three arriving
jobs.
b. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the three arriving
jobs.
Assignment must be submitted in handwritten form (on A4 size paper, single side)
Print this Assignment (B/W) and attach with your answers
INTERNAL ASSIGNMENT – 4
Operating System
(BBCAMAJ06C)
Subject BCA(Hons.)
Semester V Last Date of Submission
22/09/2025
Course Type MAJ-6
Name of Student Suman Baral Roll 01
Submitted to Abhijit Roy
1. Consider the following segment table-
Segment Base Limit (length)
0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96
What are the physical address for the following logical address-
a. 0, 430
b. 1, 10
c. 2, 500
d. 3, 400
e. 4, 112
2. Consider a logical address space of 8 pages of 1024 words or bytes each, mapped onto a physical memory
of 32 frames.
a. How many bits are there in the logical address?
b. How many bits are there in the physical address?
3. Consider a paging system with the page table stored in memory
a. If a memory reference takes 200 nanoseconds, how long does a page memory reference take?
b. If we add a associative registers (TLB), and 75% of all page table references are found in the
associative registers, what is the effective memory reference time? (Assume that, finding a page
table entry in the associative register takes 0 nanoseconds, if the entry is there).
4. Consider a logical address space of 32 pages with 1024 words per page, mapped onto a physical memory of
16 frames.
a. How many bits are required in logical address?
b. How many bits are required in physical address?
5. Assuming a 1 KB page size, what are the page number and offset for the following address references
(Provided as decimal numbers)-
a. 2375;
b. 19366;
c. 30000;
d. 256;
e. 16385;
6. On a single paging system with 224 bytes of physical memory, 256 pages of logical address space, and a page
size of 210 bytes, how many bits in the physical address specify the age frame?
Assignment must be submitted in handwritten form (on A4 size paper, single side)
Print this Assignment (B/W) and attach with your answers
INTERNAL ASSIGNMENT – 5
Operating System
(BBCAMAJ06C)
Subject BCA(Hons.)
Semester V Last Date of Submission
10/10/2025
Course Type MAJ-6
Name of Student Suman Baral Roll 01
Submitted to Abhijit Roy
1. Consider the following page reference, how many page fault occur where frame size is four:
2, 3, 2, 1, 6, 1, 2, 1, 3, 6, 7, 1, 2, 3, 7
use:
a) FIFO replacement
b) LRU replacement
c) Optimal replacement
2. Given reference to the following pages by a program,
0, 9, 0, 1, 8, 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3
If the program has three (3) page frames available in memory, determine the number of page faults that
will occur using each of the following page replacement algorithms:
a) FIFO replacement
b) LRU replacement
c) Optimal replacement
3. Given reference to the following pages by a program,
0, 1, 4, 2, 0, 2, 6, 5, 1, 2, 3, 2, 1, 2, 6, 2, 1, 3, 6, 2
How many page faults will occur if the program has three page frames available to it and use:
a) FIFO replacement
b) LRU replacement
c) Optimal replacement
4. Using frame size three calculate the total number of page fault of the following reference string(pages)-
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
How many page faults will occur if the program has three page frames available to it and use:
a) FIFO replacement
b) LRU replacement
c) Optimal replacement
5. Using frame size three calculate the total number of page fault of the following reference string(pages)-
1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5
Solve the problem using frame size of four.
Assignment must be submitted in handwritten form (on A4 size paper, single side)
Print this Assignment (B/W) and attach with your answers