It is checking if the response is not yet yes
Answer:
Se explaination
Explanation:
/Declaring variables
integer currentPrice
integer lastMonthPrice
integer changeLastMonth
float mortagage
//Reading input
currentPrice = Get next input
lastMonthPrice = Get next input
//Calculating price change
changeLastMonth = currentPrice - lastMonthPrice
//Calculating mortagage
mortagage = (currentPrice * 0.051) / 12
//Printing output
Put "This house is $" to output
Put currentPrice to output
Put "\nThe change is $" to output
Put changeLastMonth to output
Put " since last month." to output
Put "\nThe estimated monthly mortgage is $" to output
Put mortagage to output
Answer:
NFS configuration
Explanation:
The Linux server runs the Linus open source operating system that provides a stable, secure and more flexible environment to carry out more challenging jobs like network and system administration, database management and web hosting.
The NFS or Network file system configured on the Linux server only supports Linux servers communication. It mounts the storage of the server on the network for central access.
To avoid privacy these copyright is been implemented. If copyright is not implemented software company such as Microsoft, Google cannot run the organization so that software has copyright and licenses and they protect from software privacy.
<u>Explanation:</u>
Since the world is digital world all software are available in internet for download and end user will not pay for software and use the software without purchasing from software development industries.
Even software are protected with key, hacker write the tool to brakes the key, so end user easily use these tools and generate the key and user it.
So that software company use Digital millennium copyright act, so that end user can arrested for missing the software’s.
Answer:
The solution code is written in Python 3:
- def modifyList(listNumber):
- posCount = 0
- negCount = 0
-
- for x in listNumber:
- if x > 0:
- posCount += 1
- else:
- negCount += 1
-
- if(posCount == len(listNumber)):
- listNumber.append(max(listNumber))
-
- if(negCount == len(listNumber)):
- listNumber.append(min(listNumber))
-
- print(listNumber)
-
- modifyList([-1,-99,-81])
- modifyList([1,99,8])
- modifyList([-1,99,-81])
Explanation:
The key step to solve this problem is to define two variables, posCount and negCount, to track the number of positive value and negative value from the input list (Line 2 - 3).
To track the posCount and negCount, we can traverse through the for-loop and create if else statement to check if the current number x is bigger than 0 then increment posCount by 1 otherwise increment negCount (Line 5- 9).
If all number in the list are positive, the posCount should be equal to the length of the input list and the same rule is applied to negCount. If one of them happens, the listNumber will append either the maximum number (Line 11 -12) or append the minimum number (Line 14-15).
If both posCount and negCount are not equal to the list length, the block of code Line 11 -15 will be skipped.
At last we can print the listNumber (Line 17).
If we test our function using the three sets of input list, we shall get the following results:
[-1, -99, -81, -99]
[1, 99, 8, 99]
[-1, 99, -81]
