Answer:
the recycle bin?
Explanation:
usually when you overwrite something or delete it, it doesn't get entirely deleted rather stored in the recycle bin on your desktop i believe, and so you could retrieve applications through there
Def countUppercase(s):
count=0
for i in s:
if i.isupper():
count+=1
s=s.replace(i, "")
else:
s=s.replace(i, "")
countUppercase(s)
return count
element=input("Enter the string: ")
string=countUppercase(element)
print("\nNumber of upper letter in the string: ",string)
Answer:
a:(allows the different parts of a computer to communicate)
Explanation:
The motherboard is the main command center for the whole pc which recieves your inputs and responds by sending outputs...
Answer:
Some hardware requirement: Monitor, keyboard, mouse, sound card, memory, processor, graphics display card. Some software requirement: Windows XP/Vista, Video for Windows, Quicktime.
Explanation:
BRAINLEST
Answer:
The algorithm to this question as follows:
Algorithm:
finding_small_element(element,Key xa) //defining method that accepts parameter
{
if (element.value>= xa) //check value
{
//skiping node
return;
}
print(element.value);//print value
if (element.left != NULL) //check left node value
{
finding_small_element(element.left,xa); //using method
}
if (element.right != NULL) //check right node value
{
finding_small_element(element.right,xa); //using method
}
}
Explanation:
In the above pre-order traversing algorithm a method "finding_small_element" is defined, that accepts two parameter, that is "element and ax', in which "element" is node value and ax is its "key".
- Inside this if block is used that check element variable value is greater then equal to 0.
- In the next step, two if block is defined, that check element left and the right value is not equal to null, if both conditions are true, it will check its right and left value. In this algorithm, there is no extra need for traversing items.
