CSC301: Data Structures Review Flashcards

These flashcards are designed to help students review key concepts related to data structures, their classifications, properties, and operations.

The logical or mathematical model of a particular organization of data is called __.

data structure

Data that are not able to divide into sub-items are called __ items.

Elementary

A collection of records of the entities in a given entity set is called a __.

File

Each record in a file may contain many field items but the value in a certain field may uniquely determine the record in the file. Such a field is called a __ key.

primary

A data structure is said to be linear if its elements form a __ or a linear list.

sequence

The simplest type of data structure is a linear __.

array

A __ is a non-linear data structure used to represent data containing hierarchical relationships.

tree

A binary tree is defined as a finite set of elements, called __, such that it is either empty or contains a distinguished node called the root.

nodes

The maximum number of nodes in any branch of a tree is defined as the __ of the tree.

depth

A "First-In-First-Out" (FIFO) system is known as a __.

queue

A stack structure is also called a __ system because insertions and deletions occur only at one end called the top.

Last-in-first-out (LIFO)

The representation of graphs can generally be done using __ and linked representation.

sequential representation

Graphs consisting of a set of nodes with an arbitrary number of connections, or edges, between them are called __.

graphs

A node with zero edges connected to it is called an __ node.

isolated

A sequence of edges forming a closed simple path is referred to as a __.

cycle

Weighted graphs have edges assigned a nonnegative numerical value known as the __.

weight

An edge in a directed graph is also referred to as an __.

arc

When a graph is connected, there is a path between any pair of its __.

nodes

In the context of trees, the unique parent of a node is called its __.

predecessor

An example of a non-primitive data structure is __.

array

Data structures can be classified into __ and non-primitive types.

primitive

A data structure that can insert and delete elements at one end and not the other is a __.

stack

The process of accessing or navigating through a binary tree is called __.

traversal

What is a graph in data structures?

Graphs are consisting of a set of nodes with an arbitrary number of connections, or edges, between them.

What is a directed graph?

A directed graph, or digraph, is a graph in which the edges have a direction, indicated by an arrow.

What defines a weighted graph?

A weighted graph has edges assigned a nonnegative numerical value known as the weight.

What is a cycle in a graph?

A cycle is a sequence of edges forming a closed simple path.

What does it mean for a graph to be connected?

A graph is connected if there is a path between any pair of its nodes.