Exam 13: Dynamic Data Structures

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

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)

C does not allow pointers to be members of structures.

(True/False)
4.7/5
(41)

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
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)