207SE: Compare Multiprogramming and Multitasking. You Should Define What These Multiprocessing: Operating Systems, Security and Networks Assignment, CU, Singapore

Task 1

1. Compare multiprogramming and multitasking. You should define what these multiprocessing approaches are and identify their similarities and differences. You might consider including diagrams to support your findings. Write no more than 500 words.
2. Discuss microkernels and how it compares with monolithic kernels. Use suitable diagrams to illustrate the differences between them.
3. Complete the following in TWO languages of your choice. The program must be able to compile and run on Linux OS
   • The program will ask for your student number. Eg. 76567890
   • The program will then print only the digits in the even places of your student number.
   • The program will also display the lucky number which is a reminder of the odd numbers divided by 9.

What is your student number?

76567890

Evaluating special number 6680…

Your lucky number is 2

Task 2

This task requires you to work on the terminal with various common Linux commands. Use the Linux command script to record your activities and save it for review. Show [Linux command] and [Evidence from Linux].

1. Display your current working directory. Ensure it is your home List ALL the files in your home directory including hidden files in a long format.
2. Go to the working directory. Download the script http://www.centerkey.com/tree/tree.sh to your home directory using wget and make it executable. (man wget to see how it works)
3. Create a 207se directory in your home directory.
   • Create a subdirectory of 207se called portfolio
   • Create numbered directories for this week and last week. i.e. 1 and 2. iii. Transfer your week 1 evidence into the folder called 1.
   • Show your evidence using tree.sh
4. In the 207se directory, create a file named txt. Input the following text in this manner in your clash.txt file using editor or echo and indirection. Witch; Baby; Dragon; Skeleton; Graveyard; Barbarians; Archer; Giant; Goblins; Minions; Fireball; Tesla; Miner; Wizard; Prince
5. Sort the file in descending order and output only the last 10 names into another file called clash2.txt
6. Demonstrate some Linux command-line manipulation of processes: Suspend, background (make run in the background), foreground, and kill processes. Use typescript to show evidence. There are a few ways to do each of these. Demonstrate more ways to get the full marks.
7. Write a shell script program with a menu in Linux that does the following:

2. List the current directory
3. Call a function and fork a child to greet “Greetings”. Display both parent ID and child ID
4. Generate a child process (with PID displayed) that calls a sleep function to print Hello to the screen every 5 seconds
5. Terminate/Kill the process in part e)
6. Quit

Example:

The program will display the contents of the current directory when the user keys in 1.

The program must allow the user to quit when he keys in 5.

Task 3

1. In no more than 500 words, explain the need(s) for a 2-stage bootloader.
2. Write using Assembly Language to display a rectangle of dots with the expected output as shown. The marks awarded will depend on how the program is coded (whether it is hardcoded, loops used, etc.)
3. Implement in code to calculate the average wait time and the average turnaround time for a Shortest Job First algorithm for 3 to 6 processes. Assume all processes arrive at T=0.
4. Each of you will be given a different scenario to do this part. Draw the Gantt chart of the processes using the Round Robin Algorithm (RR). Calculate the average wait time and average turnaround time with RR with a quantum of 3.

Task 4

In this task, there are THREE parts: Memory allocation program, Virtual Memory Paging approaches, and writing the program (TCP Server).

1. Write a program to read in 5 memory slots and up to 5 processes. Display the result of the memory allocation using the First Fit approach.
2. Virtual Memory Paging: Each of you will be given a different scenario to accomplish the task. You are to complete the tables for:
   • First In First Out
   • Least Recently Used
   • Least Frequently Used
3. Modify the given TCP server (in C code) to be a “Fun Bulletin Board Server (FBBS)”. The FBBS will connect only on a fixed port. The fixed port will be based on the last 5 digits of your student number. FBBS will be able to reply based on the option entered. You will work on the code provided (C programming language )
   • Upon successful connection to FBBS, the client will be greeted with the menu as shown “This is the Fun Bulletin Board Server.” “1. Quote of the Day” “2. News “Enter a number:
   • The following table shows the corresponding for a car Type.

Example 1: When user keys in “1” into the client terminal (Connected to the server), the server may reply with: “In the right light, at the right time, everything is extraordinary. – Aaron Rose” or any of the other 2 responses provided above.

Example 2: When user keys in “2”, the reply may be “Next Prime Minister will not cause ‘huge discontinuity’: Chan Chun Sing” or any of the other 2 responses.

Any invalid type keyed in would result in a reply: “Please choose a valid option.”

This part will constitute a total of 4 marks for Task part 4.

4. This part of the assignment deals with named pipes (1 mark). Complete the following:

• Create a named pipe called quote_pipe.
• Input the following message to the named pipe quote_pipe.

1. Mistakes are the portals of discovery.

• Show evidence of your work with screenshot(s).

Task 5

The questions are directly from lab activity 6: BUFFER

1. Brief description of the Buffer Activity [Brief description here]
2. Commented Buffer. C code [Commented code here]
3. After running code what is in argo.txt [Description of what is in argo.txt here
4. Updated buffer. C code to show how many characters read to buffer and how many times buffer filled [Commented updated code here to count characters and to read how many times buffer filed]
5. Impact of changing the buffer size [Description of impact of altering buffer size here]
6. Updated buffer. C code to compare if two files are the same [Commented updated code here to compare two files]

• Comparison of review.txt and argo.txt

[Output from running program comparing the two files]

• Comparison of argo.txt and review_observer.txt

[Output from running program comparing the two files]