Exam 4: Linked Structures - Stacks
Exam 1: Introduction36 Questions
Exam 2: Analysis of Algorithms31 Questions
Exam 3: Introduction to Collections - Stacks49 Questions
Exam 4: Linked Structures - Stacks51 Questions
Exam 5: Queues28 Questions
Exam 6: Lists42 Questions
Exam 7: Iterators32 Questions
Exam 8: Recursion57 Questions
Exam 9: Searching and Sorting54 Questions
Exam 10: Trees47 Questions
Exam 11: Binary Search Trees50 Questions
Exam 12: Heaps and Priority Queues29 Questions
Exam 13: Sets and Maps47 Questions
Exam 14: Multi-Way Search Trees47 Questions
Exam 15: Graphs29 Questions
Exam 16: UML16 Questions
Exam 17: Object-Oriented Design54 Questions
Select questions type
Any implementation of a ______ can be used to solve a problem as long as it validly implements the appropriate operations.
(Short Answer)
4.8/5
(39)
A collection is an ______ where the details of the implementation are hidden.
(Short Answer)
4.8/5
(39)
Implementing a list with a sentinel node or dummy node as the first node eliminates the special cases dealing with the first node.
(True/False)
4.8/5
(24)
A ______ is an object that gathers and organizes other objects.If you were to place elements on a collection and then wanted to reverse the order, would it be better to use a Stack or a Queue?
(Short Answer)
4.8/5
(45)
A linked list has no set capacity limitations other than the size of the computers memory.
(True/False)
4.8/5
(37)
What is the difference between a doubly linked list and a singly linked list?
(Essay)
4.8/5
(42)
Object reference variables can be used to create ___________.
(Multiple Choice)
4.8/5
(36)
What are the advantages to using a linked implementation as opposed to an array implementation?
(Essay)
4.8/5
(39)
Showing 41 - 51 of 51
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)