Algorithm Analysis Quiz 1

Ace your homework & exams now with Quizwiz!

Forest

A acylic graph that that doesn't need to be connected.

Binary Search Tree

A binary tree where each vertex is assigned a number and the left node must be smaller than the parent and the right node must be larger than the parent.

Little O

A class functions that always grows faster than a specific function.

Big Theta

A class functions that grows about the same rate as a specific function.

Big Omega

A class functions that grows the slower than a specific function.

Big O

A class functions that never grows slower than a specific function.

Graph

A collection of vertices where some vertices are connected.

Tree

A connected acyclic graph.

Priority Queue

A data structure for maintaining a set of elements with a key or priority.

Queue

A data structure where the first item inputted is the first item outputted.

Stack

A data structure where the last item inputted is the first item outputted.

Stack

A data structure where the two operations are push and pop.

Acyclic Graph

A graph where no path leads back to its origin.

Digraph

A graph where the edges are only one-way

Singly Linked List

A linked list with only one pointer to the next node.

Doubly Linked List

A linked list with two pointers for the next and previous node.

Cycle

A path where the origin and destination are the same vertex.

Ordered Tree

A rooted tree where all children of vertex are organized.

Path

A sequence of adjacent vertices with a origin and destination.

String

A sequence of characters from an alphabet.

Text String

A sequence of characters where the alphabet contains letters, numbers, and special characters.

Array

A sequence of items where are directly accessible by specifying the index of the data.

Array

A sequence of items where the data is stored contiguously (near each other) in the computer memory.

Algorithm

A sequence of unambiguous instructions for solving a problem.

Linked List

A sequence of zero or more nodes where each contain data and a pointer to other nodes.

Rooted Tree

A tree where one vertex has one simple path to another vertex.

Descendant

All vertices that would be considered ancestors of a specific vertex.

Binary Tree

An ordered tree where each vertex has no more than two children and is located either right or left to its children.

Child

If the 1st vertex connected to a 2nd vertex of a higher depth, the 1st vertex is considered this.

Parent

If the 1st vertex connected to the 2nd vertex of a lower depth, the 1st vertex is considered this.

Leaf

In a tree, this is a vertex without children.

String Matching

Searching for a given word or pattern in a text.

Theta

The Latin letter O with a dash in it.

Omega

The Latin letter that looks like a horseshoe.

Symmetric

The adjacency matrix of an undirected graph is this.

Search Key

The given value in a searching algorithm.

Height

The length of the longest path from the root to a leaf.

Depth

The length of the path from the root to a specfic vertex.

Connected Component

The maximum connected subgraph of a given graph.

Clearly Specified Input

The name of the algorithm requirement where the algorithm has valid inputs are discrete and unstandible

Clearly Specified Expected Output

The name of the algorithm requirement where the algorithm is proven to produce a correct output given a valid input.

Definiteness

The name of the algorithm requirement where the algorithm is rigorously and unambiguously specified. Clear and specific.

Finiteness

The name of the algorithm requirement where the algorithm must terminate after a finite number of steps.

Effectiveness

The name of the algorithm requirement where the step in the algorithm are simple and basic.

Basic Operation

The operation that contributes the most towards the running time of the algorithm.

Enqueue

The operation to add an item in a queue.

Dequeue

The operation to remove an item in a queue.

Finding, Deleting, and Inserting

The operations of a priority queue.

Siblings

The relationship of vertices which contain the same parent.

Edge

The technical term for the lines connecting the vertices of a graph

Vertex

The technical term for the points of a graph

Correctness, Time Efficiency, Space Efficiency

The three important qualities determine the efficiency of of an algorithm.

Ancestor

These all the vertices between the root and as specific vertex.

Finiteness, Definiteness, Clearly Specified Input, Clearly Specified Expected Output, Effectiveness

These five requirements are needed to be considered an algorithm.

Weighted Graphs

These graphs or digraphs have numbers assigned to the edges.

connected graph

This graph contains vertices that are all joined together.


Related study sets

Finance 2000 chapter 1 questions

View Set

CM 2: Introduction à l'éthique en recherche

View Set