Software Engineering Answers

Computer cannot perform anything on its own..thus any error in output is not a technicological error..comment?

Some mobile software programs are designed to be compatible with popular __ to facilitate sharing documents between the two platforms

What is the difference between single tasking OS and multi tasking OS?

What do data structures NOT do?

What is application software

A hospital keeps a file of blood donors in which each record
has the format:
Name:
Address:
Age:
Blood Type: (Type 1, 2, 3 or 4)
Write a program to read the file and print a list of all blood
donors whose age is below 25 and blood is type 2.

Consider at a point in time the available memory partitions are 90K, 500K, 200K, 300K, and 600K (in order). How would each of the First-fit and Best-fit handle processes coming in with memory requests of 212K, 417K, 112K, and 401K (in order)?

Can you guarantee that a feasible schedule exists without a simulation of the schedule or time demand analysis, if
(a) The set of tasks T = {(5, 2),(8, 3),(10, 1)} is scheduled by the rate-monotonic algorithm.
(b) The set of tasks T = {(3, 1),(6, 1),(18, 6),(36, 4)} is scheduled by the least-slack-time-first algorithm.
(c) The set of tasks T = {(3, 1),(0, 6, 1, 4),(18, 6),(36, 4)} is scheduled by the earliest-deadline-first algorithm.
(d) The set of tasks T = {(3, 1),(6, 1),(18, 6),(36, 4)} is scheduled by the deadline-monotonic algorithm

Which of the following systems of periodic tasks are schedulable by the rate-monotonic algorithm?
By the earliest-deadline-first algorithm? Explain your answer.
(a) T = {(8, 3), (9, 3), (15, 3)}
(b) T = {(8, 4), (12, 4), (20, 4)}
(c) T = {(8, 4), (10, 2), (12, 3)}

1. Can you guarantee that a feasible schedule exists without a simulation of the schedule or time demand analysis, if
(a) The set of tasks T = {(5, 2),(8, 3),(10, 1)} is scheduled by the rate-monotonic algorithm.
(b) The set of tasks T = {(3, 1),(6, 1),(18, 6),(36, 4)} is scheduled by the least-slack-time-first algorithm.
(c) The set of tasks T = {(3, 1),(0, 6, 1, 4),(18, 6),(36, 4)} is scheduled by the earliest-deadline-first algorithm.
(d) The set of tasks T = {(3, 1),(6, 1),(18, 6),(36, 4)} is scheduled by the deadline-monotonic algorithm