Contemp Math Final

In a weighted voting system, any set of players who might join forces and vote the same way is called a ——

coalition

The player is a dummy if ——

the player does not have any power in the outcome of voting

The —— method finds the winner by considering the candidate with the most number of 1st choice votes

Plurality

Borda Count Method

Assign points to each position of the ballot and tally each candidates points

The process of distributing or allocating proportionately is called ——

Apportionment

To find the majority of votes you should ——

divide by 2 and add 1(or round up)

An acceptable efficiency gap is ——

lower than 8%

the Present method of apportionment used is ——

Huntington-Hill Method

The ceiling of a number means ——

to round the number up

The Jefferson method of apportionment used ——

a MODIFIED divisor and the LOWER quotas

The Hamilton method of apportionment used ——

the SURPLUS seats and the LOWER quota

The Adams method of apportionment used ——

a MODIFIED divisor and UPPER quotas

The practice of drawing voting districts to give one political party an unfair advantage

gerrymandering

What are processors in scheduling?

teams, humans, workers, macines

A Euler Path ——

starts at one point and ends at another

A Euler Circuit —-

starts and stops at the same place

A network is traversable if it can be ——

traced in one sweep

TSP

traveling salesman problem

Which method is exhaustive in the Hamiltonian cycle?

Brute force method

—— are used in Hamilton circuits

Peterson graphs

Tasks that must be completed before other tasks are ——

Precedent tasks

If you are a traveling salesperson, what type of circuit would you want to follow?

Hamiltonian

A statement of equality between two fractions (a/b = c/d) is called a ——

proportion

In a percent problem, W stands for ——

the whole amount

The odds of an event NOT occuring can be expressed as —-

f:s (failures:successes)

Which formula demonstrates complementary probablities if S stanfs for the probablity of success and F stands for the probability of failure?

S+F= 1

The probability of combinations of events involving the word “AND” involves —— the probability of each of the events

adding

simple interest formula

i = Prt, A = P + i

compound interest formula

A = P (1 + r/n) ^nt

credit card interest with adjusted balance

i = Pr/12, where P is the previous balance - credits

credit card interest with previous balance

i = Pr/12, where p is previous balance

credit card interest with average daily balance

i = Pr (days/365), where P is the average daily balance

a network with NO odd vertices is —

traversable with an Euler Circuit

a network with ONE odd vertex is ——

not traversable

a network with EXACTLY TWO odd vertices is ——

traversable with an Euler Path

A network with TWO or MORE odd vertices is ——

not traversable