Please enable JavaScript.
Coggle requires JavaScript to display documents.
(M5) CHAPTER 1 AND 4 - Coggle Diagram
(M5) CHAPTER 1 AND 4
LIST
ARRAY-BASED
FIXED SIZE
FINITE
KNOWS APPROXIMATELY HOW LARGE THE LIST WILL BE
FASTER WHEN ACCESSING THE LIST BY POSITION
LINKED LIST
DYNAMIC MEMORY ALLOCATION BY POINTERS
USE OF NODES
HEADER NODE
CURR POINTING TO THE ELEMENT PRECENDING THE CURRENT ELEMENT
USES FREELIST TO MINIMIZE THE USE OF GARBAGE COLLECTION
INFINITE
LISTS THAT SIZE CAN CHANGE FREQUENTLY
USE MORE SPACE TO KEEP POINTERS
EACH ELEMENT HAS A POSITION
ARRAY-BASED IS MORE EFFICIENT WHENEVER THE ARRAY IS MORE THAN HALF FULL
ABSTRACT DATA TYPE (ADT)
DATA TYPE AS A SOFTWARE COMPONENT
DOES NOT SPECIFY HOW DATA IS IMPLEMENTED
USES ENCAPSULATION
TYPE
COLLECTION OF VALUES
DATA ITEM
A PIECE OF INFORMATION, MEMBER OF A TYPE
DATA TYPE
A TYPE WITH A COLLECTION OF OPERATIONS TO MANIPULATE THE TYPE
DATA STRUCTURE
IMPLEMENTATION FOR AN ADT
CLASS
ADT + IMPLEMENTATION
OBJECT
INSTANCE OF A CLASS