<span>If a attachment is not reliable to open, terrible effects can happen, peradventure it may have a virus or even malware that can destroy a computers software.
To avoid this and stay on the safe side, try the following:-
- Open it in protected view
- Do not save the attachment on your computer
- Look at the author and read the message carefully to make sure it is not biased.
- Open it on a flash-drive </span>
True cause sometimes it can delete all ur work
Answer:
B. Computer operating system
Explanation:
the operating system (or OS) manages all of the hardware and software in the computer, and allows hardware and software to communicate.
We can also figure this out by process of elimination: Application software is just a fancy way to say apps, Graphical User Interface (or GUI) are menus that allow a user to use the computer through a visual representation (what you interact with using your mouse), and microcomputer just means a small computer like a laptop or a phone.
Answer:
The program in recursion is:
def find_max(nums):
if len(nums) == 0:
return "None"
elif len(nums) == 1:
return nums[0]
else:
return max(nums[0],find_max(nums[1:]))
Explanation:
This line defines the function
def find_max(nums):
This checks if the list is empty.
if len(nums) == 0:
If yes, it returns "None"
return "None"
If the list has just one element
elif len(nums) == 1:
It returns the only element as the maximum
return nums[0]
If the list has numerous elemente
else:
The maximum is determined recursively
return max(nums[0],find_max(nums[1:]))
To the (b) part:
<em>This program does not necessarily need to be done recursively because the max built-in function can be used to determine the maximum of the list in just one line of code and it is more efficient.</em>
Answer:
Explanation:
( n cards are there initially )
we pick out the first card in random it takes n-1 comparisons to figure out
its Equivalence card - n-1 steps
Two cards have been eliminated ( this leaves us with 2 and n-2 cards)
we pick out the 2nd card in random it takes n-3 comparisons to figure out
its Equivalence card - n-3 steps
we continue to do this.. till all cards are exhausted ( leaves us with 2
and n-4 cards again)
the last comparison will
have
- n-(n-3)
the sum of all these steps - (n-1) + (n-3) + (n-5) + .........+
(n-(n-3))
if you draw this in the form of a tree.
n - n
2
n-2 - n
2
n-4 - n-2
2
n-6 - n-4
2
n-8 - n- 6
the height of the tree will be log n , sum @ each level is at most n
