The description and the code below are provided to help you understand the probl
ID: 3586140 • Letter: T
Question
The description and the code below are provided to help you understand the problem.
If a stack is accessed through the put_in_FIFO and get_from_FIFO only it should behave like a FIFO
queue. For example the client code below would print: 4, 1, 9, 15, 7
int main() {
stack my_queue = newStack(100);
put_in_FIFO(my_queue, 4);
put_in_FIFO(my_queue, 1);
put_in_FIFO(my_queue, 9);
int data = get_from_FIFO(my_queue); // data will be 4
printf("%d, ", data); // prints 4
put_in_FIFO(my_queue, 15);
put_in_FIFO(my_queue, 7);
data = get_from_FIFO(my_queue);
printf("%d, ", data); // prints 1
data = get_from_FIFO(my_queue);
printf("%d, ", data); // prints 9
data = get_from_FIFO(my_queue);
printf("%d, ", data); // prints 15
data = get_from_FIFO(my_queue);
printf("%d ", data); // prints 7
}
(5 points) Give the complexity of your functions in terms of .
Explanation / Answer
There are basically two functions here:
However, these two functions are of order (1).
Since, both are of (1) complexity, the overall complexity of the specified program is also (1).