Exam 17: Stacks and Queues
Exam 1: An Overview of Computers and Programming Languages52 Questions
Exam 2: Basic Elements of C++76 Questions
Exam 3: Inputoutput33 Questions
Exam 4: Control Structures I Selection24 Questions
Exam 5: Control Structures II Repetition25 Questions
Exam 6: User-Defined Functions47 Questions
Exam 7: User-Defined Simple Data Types, Namespaces, and the String Type12 Questions
Exam 8: Arrays and Strings33 Questions
Exam 9: Records Structs10 Questions
Exam 10: Classes and Data Abstraction38 Questions
Exam 11: Inheritance and Composition15 Questions
Exam 12: Pointers, Classes, Virtual Functions, Abstract Classes, and Lists40 Questions
Exam 13: Overloading and Templates21 Questions
Exam 14: Exception Handling13 Questions
Exam 15: Recursion18 Questions
Exam 16: Linked Lists17 Questions
Exam 17: Stacks and Queues34 Questions
Exam 18: Searching and Sorting Algorithms28 Questions
Exam 19: Binary Trees26 Questions
Exam 20: Graphs53 Questions
Exam 21: Standard Template Library STL28 Questions
Select questions type
What does these terms refer to:
- Last In First Out (LIFO) data structure:
Free
(Short Answer)
4.9/5
(39)
Correct Answer:
a data structure in which the item that is added last will be removed first
A(n) ____________________ is a system in which a queue of objects is waiting to be served by various servers.
Free
(Short Answer)
4.9/5
(48)
Correct Answer:
queuing system
What is a LIFO data structure?
Free
(Short Answer)
5.0/5
(41)
Correct Answer:
A Last In First Out (LIFO) data structure is a data structure in which the item that is added last will be removed first.
In a linked implementation of a stack, the stack is only full if computer memory runs out.
(True/False)
4.8/5
(44)
What is the position of the top element of a stack in an array-based implementation?
(Short Answer)
4.9/5
(35)
A(n) ____________________ array can be used in an array implementation of a queue to avoid an overflow error at the rear of the queue when the queue is not full.
(Short Answer)
4.9/5
(38)
Removing an element from an empty stack results in ____________________.
(Short Answer)
4.8/5
(39)
What does these terms refer to:
- Postfix (Reverse Polish) notation:
(Short Answer)
4.7/5
(35)
The ____________________ operation of a stack removes and stores the top element of the stack.
(Short Answer)
4.9/5
(28)
A stack element can be accessed either at the top or the bottom of the stack.
(True/False)
4.7/5
(38)
Showing 1 - 20 of 34
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)