21. Placing data on a stack is called popping the stack. Select one: True False
ID: 3693031 • Letter: 2
Question
21.
Placing data on a stack is called popping the stack.
Select one:
True
False
24.
A stack is a first-in-first-out data structure.
Select one:
True
False
25.
f you need to insert an element in the front of a list with N nodes (and move the other elements back one place), how many nodes do you have to move?
Select one:
a. 0
b. 1
c. N-1
d. N
26.
A stack exhibits ________ behavior.
Select one:
a. last-in/ first-out
b. last-in/last-out
c. first-in/first-out
d. None of these
27.
There is no need for error checking when pushing a stack.
Select one:
True
False
28.
When would you use a linked list over an array or a dynamic array?
Select one:
a. when you know the maximum size at compile time
b. when you know the maximum size at run-time
c. when you do not know the maximum size
d. when you need to access any item quickly
29.
If you write a linked list class, then you should implement the destructor, copy constructor, and the assignment operator.
Select one:
True
False
Explanation / Answer
21.
Answer :- false
24.
Answer :- false
25.
Answer :- c . N-1
26.
Answer :- a. Last in first out
27.
Answer :- false
28.
Answer :- c. when you do not know the maximum size
29.
Answer :- true
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.