1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
soldier1979 [14.2K]
2 years ago
9

30 POINTS PLS HELLLLPPP WILL GIVE BRAINLIEST What behavior do elements in a stack follow? first in, last out, or FILO behavior l

ast in, first out, or LIFO behavior first in, first out, or FIFO behavior last in, last out, or LILO behavior
Computers and Technology
1 answer:
ArbitrLikvidat [17]2 years ago
6 0

Answer:

Explanation:

A stack item behaves like Last In First Out, which is equivalent to First In Last Out. FIFO and LILO are also equivalent, but they describe a queue.

You might be interested in
Gross Domestic Product (GDP) is the economic report card for any country. What is the report card measuring?
GalinKa [24]
The answer is production.



6 0
4 years ago
Flash drives plug into a(n) _
Alecsey [184]
A flash drive plugs into a USB Port
7 0
3 years ago
Read 2 more answers
What is an I-94?
Ilia_Sergeevich [38]

Answer:In my opinion I think its A

Explanation:

Sorry if wrong

8 0
4 years ago
Write a program that applies the Euclidean algorithm to find the greatest common divisor of two integers. Input should be two in
laila [671]

Answer:

// here is code in c++.

#include <bits/stdc++.h>

using namespace std;

// function that return greatest common divisor

int g_c_d(int num1, int num2)

{

if (num1 == 0)

 return num2;

return g_c_d(num2 % num1, num1);

}

// main function

int main()

{

// variables

int num1,num2;

cout<<"enter two numbers:";

// read two numbers from user

cin>>num1>>num2;

// call the function and print the gcd of both

cout<<"greatest common divisor of "<<num1<<" and "<<num2<<" is "<<g_c_d(num1.num2)<<endl;

}

Explanation:

Read two numbers from user and assign them to variables "num1" and "num2".Call the function g_c_d() with parameter "num1" and "num2".According to Euclidean algorithm, if we subtract smaller number from the larger one the gcd will not change.Keep subtracting the smaller one then we find the gcd of both the numbers.So the function g_c_d() will return the gcd of both the numbers.

Output:

enter two numbers:5 9

greatest common divisor of 5 and 9 is 1

enter two numbers:-25 15

greatest common divisor of -25 and 15 is 5

6 0
4 years ago
• R7.9 Write enhanced for loops for the following tasks.
alexdok [17]

Answer:

a is the correct answer

Explanation:

correct me if I'm wrong hope it's help thanks

3 0
3 years ago
Other questions:
  • It is appropriate to leave sections of an application blank ?<br><br><br><br> True or False
    7·1 answer
  • This is not school related in anyway but. I used to play this videogame on my computer years ago, but i cannot remember the name
    13·2 answers
  • In the CIA Triad, "Confidentiality" means ensuring that data is
    9·1 answer
  • Which question best helps a reader understand a plot’s exposition? What will life be like after the character takes action? How
    14·2 answers
  • QUICK! The commands available from a menu change depending upon what you are doing. True False
    10·2 answers
  • What is the one common feature that ties together different social media technologies
    11·1 answer
  • What are 2 ways to access the vendor credit screen in quickbooks online?
    13·1 answer
  • Information systems cannot solve some business problems. Give three examples and explain why technology cannot help
    11·1 answer
  • How do you code a website?
    10·1 answer
  • Will mark Brainliest!! What is the best hard disk compacity? Why?
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!