New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

Survey of Math - Vocabulary Overview for Final Exam

by: ysu34

Survey of Math - Vocabulary Overview for Final Exam MATH 2623

Marketplace > Youngstown State University > Math > MATH 2623 > Survey of Math Vocabulary Overview for Final Exam
GPA 3.8

Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

Unlock Preview
Unlock Preview

Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

View Preview

About this Document

Vocabulary words and their definitions from each chapter discussed in class. Brief over view of what each term means to refresh before final exam.
Survey of Mathematics
Steven L. Kent
Study Guide
Survey of Math Final Review
50 ?




Popular in Survey of Mathematics

Popular in Math

This 3 page Study Guide was uploaded by ysu34 on Wednesday January 13, 2016. The Study Guide belongs to MATH 2623 at Youngstown State University taught by Steven L. Kent in Fall 2015. Since its upload, it has received 291 views. For similar materials see Survey of Mathematics in Math at Youngstown State University.


Reviews for Survey of Math - Vocabulary Overview for Final Exam


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 01/13/16
Davidson, Hayli  Math 2623  Fall 2015  Final Exam Review    Chapter 1:  ● Leonard Euler­ showed it was impossible to stroll a route visiting the seven bridges of a  German town exactly once, V­E+F=2  ● Chinese Postman Problem­ problem of finding a circuit on a graph that covers every edge  of the graph at least once and has shortest possible length  ● Circuit­ path that starts and ends at the same vertex  ● Connected Graph­ can reach any vertex from another by traversing edges  ● Graph­ finite set of dots and connecting links  ● Vertex­ point in a graph where edges end, dot  ● Edge­ link, joins 2 vertices in a graph  ● Path­ connected sequence showing a route that starts and ends at a vertex  ● Circuit­ path that starts and ends at same vertex  ● Euler circuit­ a circuit that covers each edge of a graph and only once  ● Valence of a Vertex­ number of edges meeting at the vertex  ● Euler Circuit Theorem­ if g has an euler circuit then g must be connected and all valences  are even  ● Eulerizing­ adding edges to existing edges to make even valances  ● Rectangular Street Network­ series of rectangular blocks that form a rectangle  ● Digraph­ each edge has an arrow indicating direct of edge  ● Management Science­ operations research  ● Optimal Solution­ problem has numerical solutions, the best is top ranked  Chapter 2:  ● Hamiltonian Circuit­ tour starts at a vertex and visits each vertex once and only once,  returns where it started  ● Algorithm­ step by step  ● Method of trees­ visual method carrying out principle of counting  ● Tree­ connected graph with no circuits  ● Complete Graph­ exactly one edge between each pair of vertices  ● Fundamental Principle of Counting­ counting outcomes of multistage processes  ● Brute Force­ solves TSP, enumerates all Hamiltonian Circuits and selects minimum cost   ● Nearest Neighbor Algorithm­ starting at home and visiting nearest city and then the next  nearest until no other choices  ● Greedy Algorithm­ doesn’t lead to optimal solution, cheapest action taken  ● Sorted Edges Algorithm­ never uses 3 edges, uses all vertices, distances arranged  numerically and shortest action taken first  ● Spanning Tree­ subgraph of connected graph that is a tree  ● Kruskal’s Algorithm­ add links in order of cheapest cost so every vertex belongs to a link  ● Critical Path­ longest directed path in order requirement graph  ● Order Requirement Digraph­ shows which tasks go first in directed path  ● Weight­ number assigned, such as costs, distances, time  Chapter 3:  ● Heuristic Algorithm­ fast but no optimal solution  ● Independent Task­ no edges connected  ● Priority List­ ordering tasks for purpose of attaining a certain scheduling goal  ● Processor­ person, machine, robot  ● Vertex Coloring­ colors assigned to vertices that aren’t connected by a single edge  Chapter 5:  ● Boxplot­ graph of five number summary  ● Five Number Summary­ smallest observation, Q1, median, Q3, largest observation  ● Histogram­ distribution of outcomes  ● Individuals­ described by data set, people, animals, etc  ● Mean­ average  ● Median­ middle number in set  ● Most­ frequent  ● Range­ lg­sm  ● Normal Distribution­ symmetric bell shaped curve  ● Relative Frequency Distribution­ gives all variables and % they occur  ● 68­95­99.7 Rule­ 68% in one standard deviation, 95% in two standard deviation, 99.7%  in three standard deviation of the mean  ● Standard Deviation­ measure of variability of distribution about its mean as center, its  square root of the average standard deviation of observations from their mean  ● Stemplot­ stem and leaf, display variables, attaches final digits as leaves  ● Variable­ characteristics take on different values for individuals  ● Correlation­ ­1 and 1 with same sign as regression line slopes  ● Explanatory Variable­ X  ● Response Variable­ Y  Chapter 6:  ● Regression Line­ describe response and explanatory variable  ● Scatterplot­ graph of variables as points on plane  ● Linear­ equation of line, y=mx+b  ● Hooke's Law­ F=KX  Chapter 7:  ● Population­ set of objects we want info about  ● Sample­ info we collect from subset of population  ● Sampling­ choosing sample from population  ● Convenience Sample­ you pick samples  ● Voluntary Response­ people chose to respond  ● Simple Random Sample­ SRS, sample chosen by chance, equal  ● Table of Random Digits­ 1/10 likely to be zero, entries on table labeled 0­9  ● Double Blind­ neither subject or persons know who received treatment  ● Margin of Error­ 95% confidence, number to right of +­ signs  ● Nonresponse­ individuals chose not to respond  ● Observational Study­ sample survey  ● Placebo Effect­ dummy treatment, pill  ● Undercoverage­ may leave some groups out  Chapter 9:  ● Agenda­ ordering candidates  ● Approval Voting­ vote however many they want  ● Kenneth J. Arrow­ discovered any voting system can leave undesirable outcomes  ● Borda Count­ points assigned by preferences  ● Hare System­ eliminated based on number of first place votes  ● IIA­ can go from losing one election to winning next by change in votes  ● Manipulation­ submit ballot misrepresenting true preferences  ● Majority Rule­ preferred by more than half  ● May’s Theorem­ majority rule is only one satisfying three properties  ● Monotonicity­ ballot changes favorable to one candidate without hurting another  ● Pareto Condition­ latter candidate  ● Plurality Runoff­ assuming no ties, runoff between two candidate with most first place  votes  ● Plurality Voting­ most first place votes  ● Preference List Ballot­ most preferred to least  Chapter 11:  ● Banzhaf Power Index­ count of all voting combinations  ● Coalition­ set of participants favor a given motion  ● Critical Voter­ can reverse outcome by changing vote  ● Dictator­ all control  ● Dummy voter­ no power or meaning  ● Quota­ minimum votes necessary  ● Veto power­ issue cannot pass without them   


Buy Material

Are you sure you want to buy this material for

50 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Steve Martinelli UC Los Angeles

"There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Amaris Trozzo George Washington University

"I made $350 in just two days after posting my first study guide."

Jim McGreen Ohio University

"Knowing I can count on the Elite Notetaker in my class allows me to focus on what the professor is saying instead of just scribbling notes the whole time and falling behind."

Parker Thompson 500 Startups

"It's a great way for students to improve their educational experience and it seemed like a product that everybody wants, so all the people participating are winning."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.