QUIZ 2 | PRELIM EXAM Flashcards
These are high-level data structures that are defined by their behavior and the operations that can be performed on them, rather than by their implementation details.
ABSTRACT DATA TYPES
It is a fundamental data structure used to store a fixed-size, ordered collection of elements, all of which must be of the same data type.
ARRAYS
It is a linear collection of elements of the same data type
ONE-DIMENSIONAL ARRAY
The most common form of multi-dimensional arrays.
Two-DImensional Array
An array that used to represent grids, matrices, tables, and more complex data structures.
MULTI-DIMENSIONAL ARRAY
A linear data structure in which elements, called nodes, are connected sequentially via references or links.
LINKED LIST
It contains a data element and a reference (or link) to the next node in the sequence.
NODE
each node contains two links - one points to the next node, and the other points to the previous node
DOUBLY LINKED LIST
The first and last nodes of the list are linked together.
CIRCULAR LINKED LIST
Often used to implement linked structures like singly linked lists, doubly linked lists, and trees.
POINTERS
often used to describe the connection between nodes in a linked list, whether it’s a singly linked list (where each node has a link/reference to the next node) or a doubly linked list (where each node has links/references to both the next and previous nodes).
LINK
A data structure containing zero or more nodes that are linked together in a hierarchical fashion.
TREES (ROOTED TREE GRAPH)
Also called a last-in first-out (LIFO) system, is a linear list in which insertions and deletions can take place only at one end, called the top.
STACK
Also called a first-in first-out (FIFO) system, is a linear list in which deletions can take place only at one end of the list the “rear” of the list.
QUEUE
A data structure operation that accessing each record exactly once so that certain items in the record may be processed.
TRAVERSING
