Answer:
The correct answer is: "b. occurs because an alternative technology could be introduced by competitors".
Explanation:
It is very difficult to assess how technological uncertainty has been developed and maintained throughout the years, although it is possible to state that it may occurs when other alternative technologies are developed and launched, besides other factors. Technology companies and agencies are interested in developing their products as best as possible, therefore, competition increases with marketability and produces uncertainty among all developers, software and hardware engineers, and other Information Technology (IT) workers who are responsible for creating new technological tools which may solve the problem of uncertainty among them all and improve society.
(ps: mark as brainliest, please?!)
Press CTRL + X to cut the file(s) and folder(s) you wish to move from your desktop.
Go to your destination (where you would like to move them to), and press CTRL + V to paste them there.
true a example boolean logic is (and, or, and not)
-scav
The answer to your question is,
C) The number of lawyers will increase, so it may be difficult to find a job.
-Mabel <3
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]
