Answer:
let cookieNumber = Math.floor(Math.random() * 10)
switch (cookieNumber) {
case 1:
document.write('Fortune 1')
break;
case 2:
document.write('Fortune 2')
break;
case 3:
document.write('Fortune 3')
break;
case 4:
document.write('Fortune 4')
break;
case 5:
document.write('Fortune 5')
break;
case 6:
document.write('Fortune 6')
break;
case 7:
document.write('Fortune 7')
break;
case 8:
document.write('Fortune 8')
break;
case 9:
document.write('Fortune 9')
break;
case 10:
document.write('Fortune 10')
Explanation:
The cookieNumber is generated using Math.random(), which is rounded to a whole number using Math.floor(). Then, a switch block is used to display a different fortune depending on the value of cookieNumber.
Answer:
// program in Python to check perfect number
#function to find number is perfect or not
def is_Perfect_Number(n):
#total variable
tot = 1
i = 2
#sum of all divisor of number
while i*i<=n:
if n%i==0:
tot = tot + i + n/i
if tot == n and n != 1:
return 1
i = i+1
return 0
#read until user enter a perfect number
while True:
#read integer
num = int(input("Input an integer: "))
#call the function
if(is_Perfect_Number(num)):
print(num,"is perfect number")
#if perfect number break
break
else:
print(num,"is not a perfect number")
#ask again
print("try again.")
Explanation:
Read number from user and then call the function is_Perfect_Number() with parameter "num".This will find the sum of all divisor of number.If sum is equal to number then it will return 1 else return 0.If the number is not perfect then it will again ask to enter a number until user enter a perfect number.
Output:
Input an integer: 24
24 is not a perfect number
try again.
Input an integer: 28
28 is perfect number
Motherboard, CPU, RAM, PSU, HDDs, GPU, and a Sound card.
Answer and explanation :
the three control problems associated with competing process are
- MUTUAL EXCLUSION : We know that some resources are shareable and some are not shareable. which means only one process can access the resource at a time this type of resources are called critical resources this code can be access at only one process at a time. the other process if required to access should not be allowed
- DEADLOCK: this hold the process without complete for example suppose there are two resources R1 and R2 and two process P1 and P2 and P1 use R1 and P2 use R2 but after some time when P1 needs R2 but R2 is not available as it is used by P2 so the all process will be on hold
- STARVATION : when priorities are given to the process as high priorities and low priorities. And high priorities process always competing then low priorities process have to wait for very long time this is called starvation
You are finally at the stage of the software life cycle where you begin programming. What is this stage called?
development