## Chapter 2 Videos Business Efficiency and Lecture Notes

Videos and lecture notes are based on the 9th ed. textbook. The 9th or 10th edition of the textbook can be used for this course. All material covered is the same and independent of textbook editions.
Textbook
Video
9th ed.
Lecture Notes
9th ed.
 2.1 Hamiltonian Circuits 9th ed. pages 36 - 42 10th ed. pages 40 - 46
Section 2.1
Video
Section 2.1
Lecture notes
 2.2 Traveling Salesman Problem 9th ed. pages 42 - 43 10th ed. pages 47 - 48
Section 2.2 and
Section 2.3
Video
Section 2.2 and
Section 2.3
Lecture notes
 2.3 Helping Traveling Salesman 9th ed. pages 43 - 47 10th ed. pages 48 - 52
 2.4 Minimum-Cost Spanning Trees 9th ed. pages 47 - 52 10th ed. pages 52 - 57
Section 2.4
Video
Section 2.4
Lecture notes
 2.5 Critical Path Analysis 9th ed. pages 53 - 57 10th ed. pages 58 - 62
Section 2.5
Video
Section 2.5
Lecture notes

## Chapter 2 Objectives (Skills)

• Write in your own words the definition of a Hamiltonian circuit.
• Explain the difference between an Euler circuit and a Hamiltonian circuit.
• Identify a given application as being an Euler circuit problem or a Hamiltonian circuit problem.
• Calculate n! for a given value of n.
• Apply the formula (n −1)/2! to calculate the number of distinct Hamiltonian circuits in a complete graph with a given number of vertices.
• Define the term algorithm.
• Explain the term heuristic algorithm and list both an advantage and a disadvantage of using this algorithm.
• Discuss the difficulties inherent in the application of the brute force method for finding the shortest-route Hamiltonian circuit.
• Describe the steps in the nearest-neighbor algorithm.
• Find an approximate solution to the traveling salesman problem by applying the nearest-neighbor algorithm.
• Describe the steps in the sorted-edges algorithm.
• Find an approximate solution to the traveling salesman problem by applying the sorted-edges algorithm.
• Explain the difference between a graph and a tree.
• Determine from a weighted-edges graph a minimum-cost spanning tree.
• Identify the critical path on an order-requirement digraph.
• Find the earliest possible completion time for a collection of tasks by analyzing its critical path.
• Explain the difference between a graph and a directed graph.

## Quiz 2 Chapter 2 (Sakai-> Tests & Quizzes)

• The quiz for Chapter 2 will be available from 11:00am Jan. 5 - 11:00am Jan. 19.
• The quiz will consist of 10 multiple choice questions.
• You will have a maximum of two hours to complete the quiz.
• You will be allow two tries. The computer will accept the best score.
• Failure to take the quiz by 11:00am Jan. 19 will be given a zero. No exceptions!

## Homework Assignments

The 9th or 10th edition of the textbook can be used for this course. All material covered is the same and independent of textbook editions. Homework problems between editions are the same. The homework assignments must be neatly prepared and handed in by 11:00am in class on the due date. We will spend class time doing homework problems. I will provide helpful suggestions, do similar problems, and give hints on all homework. Please do not ask to submit late homework. I will not accept them! I will not accept homework without worked out problems. Homework assignments with answers only will be given a zero. You must show the work for credit. You should do a similar odd problem to make sure you understand the homework. Each homework problem (or answer) is worth 1. Problems with multiple parts (or require multiple answers), will have each part (or answer) worth 1. Each homework assignment is worth 10 points. For example, if an assignments has 18 problems (counting multiple parts e.g. 3a, 3b, 3c 3d would count as 4 problems or if a problem requires 2 answers that would count as 2) and you miss 2 problems, your homework score is 16/18 = 8.9 points.

• Due by 11:00 am Monday Jan. 8 Wednesday Jan. 10

 9th ed. 4, 7, 10, 26, 27, 43, 44, 48, 55, 74 pages 62 - 71 10th ed. 1, 9, 12, 28, 29, 45, 46, 50, 57, 76 pages 66 - 77

## Chapter worksheets (In-class)

The worksheets are designed to help you understand material and are aligned with the Learning Outcomes to provide practice and feedback. All students are expected to watch and take notes on the videos of the chapters before class. This is a flipped classroom (i.e. part online and part in classroom). There will be NO in class lectures! In class, we will work on homework problems, briefly discuss topics, interact with each other, and do the in class worksheets. Each worksheet will have 15 questions each worth 1 point (partial credit is possible). Worksheets with answers only will be given a zero. You must show the work for credit. Failure to watch the chapter videos and take notes, will make the worksheets very difficult for you. No make-ups allowed. Do not ask to submit late worksheets.

• Due by 11:00 am Friday Jan. 5 Monday Jan. 8

## James Baglama

Email: jbaglama(AT)uri.edu
Office hours: By appointment
Office: Lippitt Hall 200D
Phone: (401) 874-2709

## For All Practical Purposes

The textbook for the course can be either 9th or 10th edition.

Videos and lecture notes are based on the 9th ed. textbook. The 9th or 10th edition of the textbook can be used for this course. All material covered is the same and independent of textbook editions. The course does NOT use any material/resources form the Publisher's online system LaunchPad.

## Student Resources (Publisher)

Math Applets and suggested websites are very helpful resources.

## URI General Education Course

General Education program 2016 (GE): This course fully satisfies both the general education Knowledge area A1: Scientific, Technology, Engineering, and Mathematical Disciplines (STEM) and Competency area B3: Mathematical, Statistical, or Computational Strategies (MSC).
General education program 2001 - 2015 (MQ): This course satisfies the general education requirement for Mathematical and Quantitative Reasoning.

## Course Description

LEC: (3 crs.) Introduces students to the spirit of mathematics and its applications. Emphasis is on development of reasoning ability as well as manipulative techniques. (Lec. 3/Online) Not open to students with credit in MTH 106 or MTH 109 and not for major credit in mathematics. (MQ)/(GE)

## Course Goals

The goal of this course is to prepare you for the mathematical and analytical aspects of the world around you, and to help you develop a stronger, deeper mathematical knowledge. This course is intended for students majoring in the liberal arts or other fields that do not have a specific mathematical requirement.

## Special Needs

Any student with a documented disability should contact your instructor early in the semester so that he or she may work out reasonable accommodations with you to support your success in this course. Students should also contact Disability Services for Students: Onlinece of Student Life, 330 Memorial Union, 874-2098. They will determine with you what accommodations are necessary and appropriate. All information and documentation is confidential.

University of Rhode Island regulations concerning incomplete grades will be followed. See University Manual sections 8.53.20 and 8.53.21 for details.

## Religious holidays

It is the policy of the University of Rhode Island to accord students, on an individual basis, the opportunity to observe their traditional religious holidays. Students desiring to observe a holiday of special importance must provide written notification to each instructor.

## Makeup Policy

Assignments and quizzes are available for multiple days. Deadlines are given on all assignments. Missed deadlines will require documentation and the University Manual sections 8.51.10 to 8.51.14 will be followed.