Exam 13: Dynamic Data Structures
Exam 1: Introduction to Computer Programming44 Questions
Exam 2: Getting Started in C Programming46 Questions
Exam 3: Processing and Interactive Input48 Questions
Exam 4: Selection44 Questions
Exam 5: Repetition47 Questions
Exam 6: Modularity Using Functions: Part I51 Questions
Exam 7: Modularity Using Functions: Part II49 Questions
Exam 8: Arrays48 Questions
Exam 9: Character Strings51 Questions
Exam 10: Data Files50 Questions
Exam 11: Arrays, Addresses, and Pointers49 Questions
Exam 12: Structures48 Questions
Exam 13: Dynamic Data Structures49 Questions
Exam 14: Additional Capabilities55 Questions
Exam 15: A Brief Introduction to C++49 Questions
Select questions type
The addresses in a linked list of structures can be used to loop through the complete list.
(True/False)
4.7/5
(40)
Using an array of structures to insert and delete ordered structures is an efficient use of memory.
(True/False)
5.0/5
(39)
The precedence of the member operator and the structure pointer operator are equal.
(True/False)
4.9/5
(31)
Removal of a structure from an ordered linked list is the reverse process of adding a structure.
(True/False)
4.9/5
(32)
In C, the special NULL pointer value that acts as a sentinel or flag to indicate when the last structure has been processed has a numerical value of ____.
(Multiple Choice)
4.9/5
(40)
The functions isempty() and isfull()are required in any queue implementation.
(True/False)
4.8/5
(32)
Stacks and queues are two special forms of a more general data object called a(n) ____.
(Multiple Choice)
4.8/5
(41)
The following pseudocode describes a stack's ____ function.
Move the structure contents pointed to by the top-of-stack pointer into a work area
Free the structure pointed to by the top-of-stack pointer
Move the address in the work area address field into the top-of-stack pointer
(Multiple Choice)
4.9/5
(40)
Showing 41 - 49 of 49
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)