need this done as soon as possible please.

Preferably in the next day if possible.

College of Engineering and Science NIT1202 Operating Systems Semester 2, 2017 Assignment 1, Part 1 (15%) The aim of this assessment is to understand the functions of an operating system regardless of the hardware that houses it. The operating system can be represented as a pyramid of four essential managers - Memory, Processor, Device and File Managers. This assessment helps you to understand the functions of the first two managers - Memory and Processor Managers. Due: Friday 8 September 2017, 5 pm (paper and electronic copy) Answer the following questions: 1. Write a one-page (400 words) review on an article about the subject of operating systems that appeared in a recent (publication from 2017 only) computing magazine or academic journal. Give a summary of the article, including the primary topic, your own summary of the information presented, and the author's conclusion. Give your personal evaluation of the article, including topics that made the article interesting to you and its relevance to your own experience. Be sure to cite your source. [25 marks] 2. Given the following information: Job List: Memory Block List: Job Memory Memory Block Memory Block Size Number Requested Job A 77K Block 1 900K Job B 900K Block 2 910K Job C 54K Block 3 200K Job D 801K Block 4 300K a. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. b. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. [5 + 5 = 10 marks] 3. If a program has 571 bytes and will be loaded into page frames of 100 bytes each, and the instruction to be used is at byte 132, answer the following questions: a. How many pages are needed to store the entire job? b. Compute the page number and exact displacement for each of the byte addresses where the data is stored. (Remember that page numbering starts at zero). [5 + 5 = 10 marks] 4. Given that main memory is composed of only three-page frames for public use and that a seven-page program (with pages a, b, c, d, e, f, g) that requests pages in the following order: a, c, a, b, a, d, a, c, b, d, e, f a. Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the available page frames (called a page trace analysis) indicating each page fault with an asterisk (*). Then compute the failure and success ratios. b. Increase the size of memory so it contains four-page frames for public use. Using the same page requests as above and FIFO, do another page trace analysis and compute the failure and success ratios. c. What general statement can you make from this example? Explain your answer. [5 + 5 + 5 = 15 marks] 5. The table shows some commonly used special characters on a Unix/Linux system. These characters are used to perform special operations. Explain what each character does. [10 marks] Character | >> ? ; Description .. 6. The following table contains details of a set of processes that need to be scheduled by an operating system. [10 marks] Process Arrival time 1 0 Burst (CPU time required) 9 2 2 4 3 5 10 4 6 8 5 10 3 Wait Turnaround time Average Draw a Gantt chart to illustrate the order that these processes will run, assuming the scheduling algorithm, Shortest Remaining Time Next. Be sure to complete the Wait and Turnaround columns for this set of processes, including averages. 7. Given the following information: Job Arrival CPU Time Cycle A 0 15 B 2 2 C 3 14 D 6 10 E 9 1 Calculate the start time and finish time for each of the five jobs using each of the following scheduling algorithms a. FCFS b. SJN c. SRT d. Round robin (using a time quantum of 5, but ignore the time required for context switching and natural wait) Job Arrival A B C D E CPU Time Cycle 0 15 2 3 6 9 2 14 10 1 FCFS SJN SRT RR Start: Start: Start: Start: Finish: Finish: Finish: Finish: Start: Start: Start: Start: Finish: Finish: Finish: Finish: Start: Start: Start: Start: Finish: Finish: Finish: Finish: Start: Start: Start: Start: Finish: Finish: Finish: Finish: Start: Start: Start: Start: Finish: Finish: Finish: Finish: [20 marks] Due: Friday, 8 September 2017, 5:00 pm Late assignments without a valid excuse will be penalised at the rate of 10% per day, that is, an assignment is marked out of 90% for 1 day late, 80% for 2 days late, etc. and after one-week (7 days) assignments will not be accepted at all. (Example: An assignment due in on Friday, but handed in on the next Monday morning is marked out of 70%.) Extensions: If students are adversely affected by life circumstances then they may, at the discretion of the Unit Coordinator, be granted up to one week as an extension on the due date. If students' work is affected to a substantial degree, requiring more than the few days extension, then they may apply for Special Consideration. Submission: You are required to submit both a paper and an electronic copy of your assignment to your tutor. Electronic submission needs to be made via VU Collaborate Assessment Dropbox. Electronic means may be used to check for plagiarism. Layout and content: Assignment must be submitted with a proper layout and content. Weight: This task is worth 15% of the assessment for the unit. Your answers should be in your own words. Random oral testing following the submission of assignments may be conducted. PLAGIARISM It is important to learn from the work of others and you are encouraged to explore the library, World Wide Web resources and have discussions with other students. However, work for assessment must be entirely the student's own work. Plagiarism, that is copying or using the work of others without giving details of the source of information is not acceptable. All sources used and any collaboration in the exploratory work for an assignment must be clearly acknowledged using standard academic referencing. You must not allow other students to copy your work and must take care to safeguard against this happening. In cases of copying, normally all students involved will be penalised equally; an exception will be if you can demonstrate the work is your own and you took reasonable care to safeguard against copying. References: (refer to the unit description for additional references) McIver-McHoes, A. & Flynn, I. (2017). Understanding Operating Systems, 8th ed. Cengage Learning. NIT1202 Operating Systems Semester 2, 2017 Assignment - Part 1 Marking Scheme Name: __________________________ Student ID: _________________________ Question 1 /25 Question 2 /10 Question 3 . /10 Question 4 /15 Question 5 /10 Question 6 /10 Question 7 /20 Total No title page, table of contents, page numbers /100 /-5 Poor presentation, no acknowledgements, poor references /-5 Late Overall Total /100 PDFsToWord.Com Sunam Pradhan 2017-08-17T16:22:33+00:00 College of Engineering and Science NIT1202 Operating Systems Semester 2, 2017 Assignment 1, Part 1 (15%) The aim of this assessment is to understand the functions of an operating syst em regardless of the hardware that houses it. The operating system can be represented as a pyramid of fo ur essential managers - Memory, Processor, Device and File Managers. This assessment helps you to under stand the functions of the first two managers - Memory and Processor Managers. Due: Friday 8 September 2017, 5 pm (paper and electronic copy) Answer the following questions: 1. Write a one-page (400 words) review on an article about the subject of operating systems that appeared in a recent (publication from 2017 only) computing magazine or aca demic journal. Give a summary of the article, including the primary topic, your own summary of the information presented, and the author's conclusion. Give your personal evaluation of the article, i ncluding topics that made the article interesting to you and its relevance to your own experie nce. Be sure to cite your source. [25 marks] 2. Given the following information: Job List: Memory Block List: Job Number Memory Requested Memory Block Memory Block Size Job A 77K Block 1 900K Job B 900K Block 2 910K Job C 54K Block 3 200K Job D 801K Block 4 300K a. Use the best-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. b. Use the first-fit algorithm to indicate which memory blocks are allocated to each of the four arriving jobs. [5 + 5 = 10 marks] 3. If a program has 571 bytes and will be loaded into page frames of 100 bytes each, and the instruction to be used is at byte 132, answer the following questions: a. How many pages are needed to store the entire job? b. Compute the page number and exact displacement for each of the byte addresses where the data is stored. (Remember that page numbering starts at zero). [5 + 5 = 10 marks] 4. Given that main memory is composed of only three-page frames for public use and that a seven-page program (with pages a, b, c, d, e, f, g) that requests pages in the following order: a, c, a, b, a, d, a, c, b, d, e, f a. Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the available page frames (called a page trace analysis) indicating each page fault with an asterisk (*). Then compute the failure and success ratios. b. Increase the size of memory so it contains four-page frames for public use. Using the same page requests as above and FIFO, do another page trace analysis and compute the failure and success ratios. c. What general statement can you make from this example? Explain your answer. [5 + 5 + 5 = 15 marks] 5. The table shows some commonly used special characters on a Unix/Linux system. These characters are used to perform special operations. Explain what each character does. [10 marks] Character Description | >> ? ; .. 6. The following table contains details of a set of processes that need to be scheduled by an operating system. [10 marks] Process Arrival time Burst (CPU time required) Wait Turnaround time 1 0 9 2 2 4 3 5 10 4 6 8 5 10 3 Average Draw a Gantt chart to illustrate the order that these processes will run, assuming the scheduling algorithm, Shortest Remaining Time Next. Be sure to complete the Wait and Turnaround columns for this set of processes, including averages. 7. Given the following information: Job Arrival Time CPU Cycle A 0 15 B 2 2 C 3 14 D 6 10 E 9 1 Calculate the start time and finish time for each of the five jobs using each of the following scheduling algorithms a. FCFS b. SJN c. SRT d. Round robin (using a time quantum of 5, but ignore the time required for context switching and natural wait) Job Arrival Time CPU Cycle FCFS SJN SRT RR A 0 15 Start: Finish: Start: Finish: Start: Finish: Start: Finish: B 2 2 Start: Finish: Start: Finish: Start: Finish: Start: Finish: C 3 14 Start: Finish: Start: Finish: Start: Finish: Start: Finish: D 6 10 Start: Finish: Start: Finish: Start: Finish: Start: Finish: E 9 1 Start: Finish: Start: Finish: Start: Finish: Start: Finish: [20 marks] Due: Friday, 8 September 2017, 5:00 pm Late assignments without a valid excuse will be penalised at the rate of 10% per day, that is, an assignment is marked out of 90% for 1 day late, 80% for 2 days late, etc. and after one-week (7 days) assignments will not be accepted at all. (Example: An assignment due in on Friday, but handed in on the next Monday morning is marked out of 70%.) Extensions: If students are adversely affected by life circumstances then they may, at the discretion of the Unit Coordinator, be granted up to one week as an extension on the due date. If students' work is affected to a substantial degree, requiring more than the few days extension, then they may apply for Special Consideration. Submission: You are required to submit both a paper and an electronic copy of your assignment to your tutor. Electronic submission needs to be made via VU Collaborate Assessment Dropbox. Electronic means may be used to check for plagiarism. Layout and content: Assignment must be submitted with a proper layout and content. Weight: This task is worth 15% of the assessment for the unit. Your answers should be in your own words. Random oral testing following the submission of assignments may be conducted. PLAGIARISM It is important to learn from the work of others and you are encouraged to explore the library, World Wide Web resources and have discussions with other students. However, work for assessment must be entirely the student's own work. Plagiarism, that is copying or using the work of others without giving details of the source of information is not acceptable. All sources used and any collaboration in the exploratory work for an assignment must be clearly acknowledged using standard academic referencing. You must not allow other students to copy your work and must take care to safeguard against this happening. In cases of copying, normally all students involved will be penalised equally; an exception will be if you can demonstrate the work is your own and you took reasonable care to safeguard against copying. References: (refer to the unit description for additional references) McIver-McHoes, A. & Flynn, I. (2017). Understanding Operating Systems, 8 th ed. Cengage Learning. NIT1202 Operating Systems Semester 2, 2017 Assignment - Part 1 Marking Scheme Name: __________________________ Student ID: _________________________ Question 1 /25 Question 2 /10 Question 3 . /10 Question 4 /15 Question 5 /10 Question 6 /10 Question 7 /20 Total /100 No title page, table of contents, page numbers /-5 Poor presentation, no acknowledgements, poor references /-5 Late - Overall Total /100