Run a compatibility check on your computer to check it or ask a tech professional what os they think would be compatible
Answer:
1st Option: Inkjet
2nd Option: Laser
Explanation:
Got it right on Edge 2020
Answer:
def countdown(n):
if n <= 0:
print('Blastoff!')
else:
print(n)
countdown(n-1)
def countup(n):
if n >= 0:
print('Blastoff!')
else:
print(n)
countup(n+1)
number = int(input("Enter a number: "))
if number >= 0:
countdown(number)
elif number < 0:
countup(number)
<u>Outputs:</u>
Enter a number: 3
3
2
1
Blastoff!
Enter a number: -3
-3
-2
-1
Blastoff!
Enter a number: 0
Blastoff!
For the input of zero, the countdown function is called.
Explanation:
Copy the countdown function
Create a function called countup that takes one parameter, n. The function counts up from n to 0. It will print the numbers from n to -1 and when it reaches 0, it will print "Blastoff!".
Ask the user to enter a number
Check if the number is greater than or equal to 0. If it is, call the countdown function. Otherwise, call the countup function.
The statement that best explains the way that similar applications are used in different devices is option b: Although the systems are different, the apps are still designed to work the same way.
<h3>How does an app work?</h3>
An app is known to be a kind of a software that gives room for a person to be able to carry out some specific tasks.
Note that Applications for desktop or laptop computers are said to be called desktop applications and those apps that are used in mobile devices are known to be called mobile apps.
Hence, The statement that best explains the way that similar apps are used in different devices is option b: Although the systems are different, the apps are still designed to work the same way.
Learn more about Software applications from
brainly.com/question/22442533
#SPJ1
Answer:
bool identicaltrees(Node* root1,Node* root2)//function of type boolean true if idenctical false if not.
{
if(root1==NULL&&root2==NULL)//both trees are null means identical.
return true;
if(roo1 && root2)
{
if(root1->data==root2->data)//condition for recursive call..
{
return (identicaltrees(root1->left,root2->right)&&identicaltrees(root1->right&&root2->right);
}
}
else
return false;
}
Explanation:
In this function it of type boolean returns true if both the trees are identical return false if not.First we are checking root node of both the trees if both are null then they are identical returning true.
If both root nodes are not null then checking their data.If data is same then recursively traversing on both trees and checking both trees.
else returning false.
