Data Structures 5

Question 1

Aggregate Data Types

Answer 1

Any type of data that can be referenced as a single entity, and yet consists of more than one piece of data, like strings, arrays, classes, and other complex structures.

Question 2

1D Array

Answer 2

A linear collection of data items in a program, all of the same type, such as an array of integers or an array of strings, stored in contiguous memory, and easily accessed using a process called indexing.

Question 3

Contiguous Memory

Answer 3

“Memory that is ““side-by-side”” in a computer, typical of an array structure.”

Question 4

Data Structure

Answer 4

A way of organizing data in a computer so that it can be used efficiently, such as an array, linked list, stack, queue, or binary tree.

Question 5

Linear Data Structure

Answer 5

A programming data structure that occupies contiguous memory, such as an array of values.

Question 6

2D Array

Answer 6

An array of an arrays, characterized by rows and columns, arranged in a grid format, but still stored in contiguous, or side-by-side memory, accessed using two index values.

Question 7

Peek

Answer 7

A process used in stack and queue processing where a copy of the top or front value is acquired, without removing that item.

Question 8

Pop

Answer 8

A process used in stack and queue processing where a copy of the top or front value is acquired, and then removed from the stack or queue (Dequeue).

Question 9

Push

Answer 9

A process used in stack and queue processing where a new value is inserted onto the top of the stack OR into the back of the queue (Enqueue).

Question 10

Stack

Answer 10

An abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the last element that was added. LIFO - Last In First Out

Question 11

Queue

Answer 11

A FIFO (First In First Out) data structure, where the first element added will be the first to be removed, and where a new element is added to the back, much like a waiting line.

Question 12

Linked List

Answer 12

A linear data structure, much like an array, that consists of nodes, where each node contains data as well as a link to the next node, but that does not use contiguous memory.

Question 13

Dynamic Memory

Answer 13

Memory that is allocated as needed, and NOT contiguous (side-by-side), specifically during the implementation of a linked list style data structure, which also includes binary trees and graphs.

Question 14

Node

Answer 14

An object linked to other objects, representing some entity in that data structure.

Question 15

Non-Linear Data Structure

Answer 15

A data structure that does not occupy contiguous memory, such as a linked list, graph, or tree.

Question 16

Parent Node

Answer 16

A node, including the root, which has one or more child nodes connected to it.

Question 17

Binary Tree

Answer 17

A data structure that consists of nodes, with one root node at the base of the tree, and two nodes (left child and right child) extending from the root, and from each child node.

Question 18

Children

Answer 18

The term used in trees to indicate a node that extends from another node, such as left child and right child in a binary tree.

Question 19

Complete Tree

Answer 19

A tree in which there are no missing nodes when looking at each level of the tree. The lowest level of tree may not be completely full, but may not have any missing nodes. All other levels are full.

Question 20

Depth

Answer 20

In tree data structure, expressed as the number of steps from the root of the tree to the farthest outlying node in the tree. Height is also used to mean the same thing.

Question 21

External Node

Answer 21

A potential node in a tree, where currently either the left or right child pointer of a node is pointing to null, but potentially could reference another node.

Question 22

Binary Search Tree

Answer 22

A tree in which nodes are inserted systematically in natural order, with the final property of each left child being less than or equal to its parent, and each right child being greater than its parent. (Does not preserve the order in which nodes were added.

Question 23

Minimum Heap Tree

Answer 23

A tree in which every parent is lesser in value than both its children, which means that the root of the tree is least value in the tree.

Question 24

Maximum Heap Tree

Answer 24

A tree in which every parent is greater in value than both its children, which means that the root of the tree is greatest value in the tree.

Question 25

Full Tree

Answer 25

A tree in which every level of the tree is completely full, with no missing nodes.

Question 26

Binary Tree Traversal

Answer 26

The process of systematically visiting every node in a tree once. The three most common traversals are: pre-order, in-order, and post-order.

Question 27

Full Tree Traversal

Answer 27

A non-executable, visual approach to help determine the pre-order, in-order, or post-order traversal of a tree.

Question 28

Pre-Order Traversal

Answer 28

“The process of systematically visiting every node in a tree once, starting with the root node, proceeding to the left along the tree and accessing the node when the ““left”” side of the node is encountered.”

Question 29

In-Order Traversal

Answer 29

“The process of systematically visiting every node in a tree once, starting at the root and proceeding left down the tree, accessing the first node encountered at its ““center””, proceeding likewise along the tree, accessing each node as encountered at the ““center””.”

Question 30

Post-Order Traversal

Answer 30

“The process of systematically visiting every node in a tree once, starting at the root and proceeding left down the tree, accessing the first node encountered at its ““right”” side, proceeding likewise along the tree, accessing each node as encountered at its ““right”” side.”

Question 31

Internal Node

Answer 31

An existing node in a tree, either the root or any one of the children in the tree.

Question 32

Internal Path Length

Answer 32

In tree processing, this is the sum of all the lengths from the root to the external nodes in a tree.

Question 33

Leaf

Answer 33

A node in a tree data structure that has no children, and is at the end of a branch in a tree.

Question 34

Tree Topology

Answer 34

A tree is widely used abstract data type (ADT) or data structure implementing this ADT that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.

Question 35

Complete Graph

Answer 35

A simple undirected graph in which every pair of distinct vertices is connected by a unique edge, in other words, every vertex is directly connected to every other vertex in the graph

Question 36

Connected Graph

Answer 36

“A graph where there exists a simple path from any vertex in the graph to any other vertex in the graph, even if it takes several ““hops”” to get there.”

Question 37

Directed Graph

Answer 37

A graph where an edge has a direction associated with it, for example, a plane flight that takes off in one location and arrives in another. The return flight would be considered a separate edge.

Question 38

Edge

Answer 38

The connection in a graph between two vertices.

Question 39

Graph

Answer 39

A data structure in programming which consists of a set of vertices (nodes) and edges (connections).

Question 40

Undirected Graph

Answer 40

A graph that contains edges between vertices with no specific direction associated with any edge.

Question 41

Array length

Answer 41

A value that represents the number of elements contained in an array. Often there is a process associated with an array that provides this value, such as list.length, or len(list).

Question 42

Array Index

Answer 42

A value that indicates the position in the array of a particular value. The last element in a zero-indexed array would be the length of the array, minus 1.

Question 43

Static Memory

Answer 43

Memory allocated to an array, which cannot grow or shrink once declared.

Question 44

Row Major

Answer 44

An array where the two index values for any element are the row first, then the column.

Question 45

Ragged Array

Answer 45

An array where the number of columns in each row may be different.

Question 46

Head

Answer 46

“A typical object variable identifier name used to reference, or point to, the first object in a linked list. The number one rule for processing linked lists is, ‘Never let go of the head of the list!””, otherwise all of the list is lost in memory. The number two rule when managing linked lists is, ‘Always connect before you disconnect!’.”

Question 47

Root

Answer 47

The base level node in a tree; the node that has no parent.

Question 48

Heapify

Answer 48

A process in Minimum Heap Trees where the new node is switched up until min heap state is achieved.

Question 49

Vertex

Answer 49

An object in a graph.