ISE218_Homework 7_v1
docx
keyboard_arrow_up
School
Stony Brook University *
*We aren’t endorsed by this school
Course
218
Subject
Industrial Engineering
Date
Jan 9, 2024
Type
docx
Pages
2
Uploaded by AmbassadorWolfMaster380
ISE 218: Fundamentals of Information Technology
Stony Brook University
Homework #7
Fall 2023
Assignment Due: Nov 19, 2023
Neatly write or type your answers to the following problems on a separate sheet of paper and submit a digital
copy on Blackboard by the due date. For mathematical calculations you must show all work to receive full
credit and simplify your answers as much as possible, giving a single number as your answer.
For all questions involving sizes, you should use 2-based units of size. For example, 1 KB =
2
10
bytes, not
10
3
bytes.
1.
[4 pts] What is the difference between multiprogramming, multiprocessing, context switching and
multitasking?
2.
Consider the following set of processes, with the length of the CPU burst given in milliseconds:
Process
Burst Time
P
1
15
P
2
22
P
3
5
P
4
29
a.
[4 pts] Draw a Gantt chart similar to one from the lecture notes that illustrates the execution of
the processes using the round-robin CPU scheduling algorithm. Assume the time quantum is 20
ms.
The processes arrive in the order
P
1
,
P
2
,
P
3
,
P
4
, all around time 0 ms.
b.
[4 pts] What is the waiting time of each process?
c.
[2 pts] What is the average waiting time of the processes?
3.
[5 pts] The performance of a Java program running in the JVM cannot possibly match that of a regular
compiled language. Explain why this is so.
4.
[2 pts] Consider the “ACID” properties of database transaction management. Suppose before a transaction
could be recorded to disk, the hard disk crashed, and the transaction were lost. Which of the ACID
properties would have been violated and why?
1.
[5] Draw a Gantt chart below similar to the ones from lecture that illustrates the execution of the
processes using the shortest-job-first CPU scheduling algorithm.
Process
Arrival
Time
Burst
Time
P
1
7 ms
2 ms
P
2
2 ms
5 ms
P
3
11 ms
10 ms
P
4
0 ms
4 ms
[5] Using the chart you drew, give the waiting time of each process in milliseconds.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
- Access to all documents
- Unlimited textbook solutions
- 24/7 expert homework help