Greife auf kostenlose Karteikarten, Zusammenfassungen, Übungsaufgaben und Altklausuren für deinen C949 Data Structures & Algorithms Kurs an der Western Governors University zu.
9167
Karteikarten
324
Studierende
0
Lernmaterialien
This is a data structure that stores subitems, also called fields, with a name associated with each item.
Record
ADT that associates (or maps) keys with values.
Common underlying data structures:
Hash Table, Binary Search Tree
Dictionary (Map)
This is a data structure that stores an ordered list of items in nodes, where each node stores data and has a pointer to the next node.
Linked List
This is a data structure in which each node stores data and has up to two children, known as a left child and a right child.
Binary Tree
ADT in which items are inserted at the end of the queue and removed from the front of the queue. FIFO (first in, first out)
Common underlying data structure:
Linked List
Queue
ADT for storing items in which the order does not matter and duplicate items are allowed.
Common underlying data structure:
Array, Linked List
Bag
This data structure is a tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys.
Min-heap
This is a data structure for representing connections among items and consists of vertices connected by edges.
Graph
A _______ represents an item in a graph. An ______ represents a connection between two vertices in a graph.
A vertex represents an item in a graph. An edge represents a connection between two vertices in a graph.
ADT for holding ordered data.
Common underlying data structure: Array, Linked List
List
ADT in which items are only inserted on or removed from the top. LIFO (last in, first out)
Common underlying data structure:
Linked List
Stack
What does this operation do to a list ADT?
Remove(list, x)
Removes x
Original list:
99, 77
Operation:
Remove(list, 77)
New list:
list: 99
Greife kostenlos auf tausende geteilte Karteikarten, Zusammenfassungen, Altklausuren und mehr zu.
Jetzt loslegen
