can do c++ and javascript but I might be able to help
send me a message
Answer:
B.O(1)
Explanation:
When we are implementing ADT stack using linked chain we can pop an entry from the stack having O(1) time complexity because in linked chain we have the head or top pointer in linked chain only.Popping and pushing in stack happens on only one end that is top.So we have move to move top in linked chain to the next and delete prev node.
<span>An organization that sets standards for computer networking and wireless communications.</span>
Answer:
#include <iostream>
using namespace std;
void PrintPopcornTime (int bagOunces){
if (bagOunces < 2){
cout << "Too small"<<endl;
}
else if (bagOunces > 10){
cout << "Too large"<<endl;
}
else{
cout << bagOunces*6 <<" seconds"<<endl;
}
}
int main(){
PrintPopcornTime(7);
return 0;
}
Explanation:
Create a function called PrintPopcornTime that takes one parameter, bagOunces
Check the bagOunces using if-else structure. If it is smaller than 2, print "Too small". If it is greater than 10, print "Too large". Otherwise, calculate and print 6*bagOunces followed by " seconds".
Call the function in the main function with parameter 7. Since 7 is not smaller than 2 or not greater than 10, "42 seconds" will be printed.