Algorithms

What if the formula for finding the most possible Line segments in a Graph

(n(n-1))/2

What is the definition of a Geometric Algorithm

An Algorithm that deals with geometric objects such as points, lines, and polygons.

Algorithms that do not give an exact answer are called

Approximate Algorithms

In which notation does f(n) grow at least as fast as g(n)

Big O

What are four desirable characteristic of an Algorithm

Efficiency Correctness Simplicity Generality

Algorithms that do not approximate an answer are called

Exact Algorithms

What is the definition of Big O efficiency

F(n) = O(g(n)) if the lim (f(n))/(G(n)) equals the following Zero or any constant < infinity.

What is the definition of Omega Ω efficiency

F(n) = Ω(g(n)) if the lim (f(n))/(G(n)) equals the following Infinity or any constant > infinity.

What is the definition of Theta ϴ efficiency

F(n) = ϴ(g(n)) if the lim (f(n))/(G(n)) equals the following 0 < C < infinity

What Sorting Algorithms are considers naturally stable

Insertion sort Merge Sort Bubble Sort

What are the two most important types of Data Structures

Linked list Arrays

Does a Sorting Algorithm rearrange items in descreasing or non descreasing order

Non-decreasing

In which notation does f(n) grow at least no faster than g(n)

Omega Ω

Algorithms that run on computers with more than one CPU are called

Parallel Algorithms

In which notation does f(n) grows roughly the same as fast as g(n)

Theta ϴ

What are the two types of Algorithm efficiency

Time efficiency and Space of efficiency

What is the definition of a Complete Graph

When all vertices are connected to each other

When is a Sorting Algorithm considered stable

When it preserves the relative order of any two equal elements in its input.

When is a Sorting Algorithm considered In-Place

When the Algorithm does not require extra memory, except, possibly, for a few memory units.

Which output from a Sorting Algorithm would show that Algorithm is stable and why These terms are sorted by length "Pink", "Apple", "Tree" apple, tree, pink tree, apple pink, pink, tree apple

pink tree apple Because the relative order of pink and apple is maintained after the sort

What is the definition of a Graph

A collection of points called vertices, some of which are connected by line segments called edges

What is the definition of Pseudocode

A mixture of a natural language and programming languagelike constructs

What is the definition of an Algorithm

A sequence of unambiguous instructions for solving a problem,

What is the definition of Combinatorial problem

Problems that ask, explicitly or implicitly, to find a combinatorial object—such as a permutation, a combination, or a subset—that satisfies certain constraints.

What does a Sorting Algorithm do

Rearranges the items of a given list in non-decreasing order.

What does a Searching Algorithm use to find the desired value

Search Key

Algorithms that run one in sequences one after another are called what

Sequential Algorithms

What are two types of Geometric Algorithm

The Closest Pair The Convex Hull