Building a Simple Operating System (SOS) Overview
The aim of the assignment is to implement a simple operating system (SOS) developed in c++. The SOS is expected provide a specified system allowing for processes and memory management. The project will be completed by groups of 2-3 students of 414/514 sections (at least 1 student for 514 section). This is a challenging project.
Assessment
The points for the project are obtained for timely and complete demonstration of intermediate milestones. These milestones will be submitted every three weeks. When submitting your solution you should be able to
show a working solution,
explain how to code your written works,
explain any design decisions you made,
testing your code with the specifications,
inspecting your code as to how well and efficiently it is written, and
writing your documentation as to its completeness, appropriateness and consistency with your implementation.
Milestones
The whole system allows up to 10 processes currently stay in the memory, only one of them is running on the CPU, while the others are either in the Ready Queue, or blocked in the Disk Queue (i. e. waiting for disk I/O). Each process has its PCB, just follow the format in the textbook. For memory management, you may choose paging (page size 64 byte or larger) or other management methods. No requirement on deadlock prevention or virtual memory.
Each process has a corresponding program written in script. Although not required, the script may also involve some loop and if-then-else statements so that it will take longer time for you to view the execution of processes.
Submission of milestones
You are to show that your project passes the milestone requirements by submitting a hardcopy of code and snapshot of screen, along with
an electronic copyEach group only need to submit one copy.

1. package newton’s method for approximating square roots (case study 3.6) in a function named newton. this function expects the input number as an argument and returns the estimate of its square root. the script should also include a main function that allows the user to compute square roots of inputs until she presses the enter/return key. 2. convert newton’s method for approximating square roots in project 1 to a recursive function named newton. (hint: the estimate of the square root should be passed as a second argument to the function.) 3. elena complains that the recursive newton function in project 2 includes an extra argument for the estimate. the function’s users should not have to provide this value, which is always the same, when they call this function. modify the definition of the function so that it uses a keyword parameter with the appropriate default value for this argument, and call the function without a second argument to demonstrate that it solves this problem. 4. restructure newton’s method (case study 3.6) by decomposing it into three cooperating functions. the newton function can use either the recursive strategy of project 1 or the iterative strategy of case study 3.6. the task of testing for the limit is assigned to a function named limitreached, whereas the task of computing a new approximation is assigned to a function named improveestimate. each function expects the relevant arguments and returns an appropriate value. 5. a list is sorted in ascending order if it is empty or each item except the last one is less than or equal to its successor. define a predicate issorted that expects a list as an argument and returns true if the list is sorted, or returns false otherwise. (hint: for a list of length 2 or greater, loop through the list and compare pairs of items, from left to right, and return false if the first item in a pair is greater.)

Write a program that prints the day number of the year, given the date in the form month-day-year. for example, if the input is 1-1-2006, the day number is 1; if the input is 12-25-2006, the day number is 359. the program should check for a leap year. a year is a leap year if it is divisible by 4, but not divisible by 100. for example, 1992 and 2008 are divisible by 4, but not by 100. a year that is divisible by 100 is a leap year if it is also divisible by 400. for example, 1600 and 2000 are divisible by 400. however, 1800 is not a leap year because 1800 is not divisible by 400.

An environmental protection agency study of 12 automobiles revealed a correlation of 0.47 between engine size and emissions. at 0.01 significance level, can we conclude that there is a positive association between the variables? what is the p value? interpret.