Sum of Numbers Program Plan: • Define the “main()” function: ○ Initialize the variable “number” as “0”. ○ Check the value of “number”. ■ If it is less than or equal to “0”, then get the input from the user and store it to the variable “number”. ○ Call the function “sumNumbers()” and pass the argument “num”. ○ Display the result on the output screen. • Define the “sumNumbers(num)” function: ○ Check the value of “num”. ■ If it is equal to “0”, then return “num” ■ Otherwise, call the function “sumNumbers()” to recursively perform the addition operation. • Call the “main()” function.

Question

6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]

Answer 1

Question

Chapter 12, Problem 6PE

Program Plan Intro

Sum of Numbers

Program Plan:

• Define the “main()” function:

○ Initialize the variable “number” as “0”.

○ Check the value of “number”.

■ If it is less than or equal to “0”, then get the input from the user and store it to the variable “number”.

○ Call the function “sumNumbers()” and pass the argument “num”.

○ Display the result on the output screen.

• Define the “sumNumbers(num)” function:

○ Check the value of “num”.

■ If it is equal to “0”, then return “num”

■ Otherwise, call the function “sumNumbers()” to recursively perform the addition operation.

• Call the “main()” function.

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

6. What is Race condition? How to prevent it? [2 marks] 7. How many synchronization methods do you know and compare the differences. [2 marks] 8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with the traffic intersection as an example like dinning philosophy. [2 marks] 9. For memory allocation, what are the difference between internal fragmentation and external fragmentation. Explain with an example. [2 marks] 10. How can the virtual memory map to the physical memory. Explain with an example. [2 marks]

Your answers normally have 50 words. Less than 50 words will not get marks. 1. What is context switch between multiple processes? [2 marks] 2. Draw the memory layout for a C program. [2 marks] 3. How many states does a process has? [2 marks] 4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks] 5. Given 4 process and their arrival times and next CPU burst times, what are the average times and average Turnaround time, for different scheduling algorithms including: a. First Come, First-Served (FCFS) Scheduling [2 marks] b. Shortest-Job-First (SJF) Scheduling [2 marks] c. Shortest-remaining-time-first [2 marks] d. Priority Scheduling [2 marks] e. Round Robin (RR) [2 marks] Process Arrival Time Burst Time P1 0 8 P2 1 9 P3 3 2 P4 5 4

a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]