10.4 Installment Buying 10.5 Buying a House with a Mortgage 10.6 Ordinary Annuities, Sinking Funds, and Retirement Investments Chapter 13 - Graph Theory: Study of Euler and Hamiltonian Circuits with emphasis on connection to real-world applications, brute force vs. "quick and dirty” heuristic vs perfect algorithms. Spanning trees with Kruskal’s Algorithm. Choosing the correct “tool” from these three for problem to be solved 13.1 Graphs, Paths, and Circuits 13.2 Euler Paths and Euler Circuits 13.3 Hamilton Paths and Hamilton Circuits 13.4 Trees Chapter 14 – Voting and Apportionment: Study of plurality, majority, Borda Count, Pairwise with Elimination. Arrow’s Impossibility Theorem and the flaws of each system. Importance of deciding the method to be applied BEFORE the ballots are cast. 14.1: Voting Methods 14.2: Flaws of the Voting Methods * Note on optional topics: Sections 1.1, 1.3, 5.7, and 5.8 may be covered if instructor has additional time and should only be covered in addition to the other required topics. Student Responsibilities & Course Policies Homework: ([fill % of overall grade) in or delete if N/A] [fill in or delete if N/A] If you have additional questions from earlier assignments or need extra help, you should: 1. Work together outside of class. 2. Seek tutoring, which is available at the Math Learning Center in B130 (516) 572-7394. 3. [fill in or delete if N/A] Quizzes: ([fill % of overall grade) in or delete if N/A] [fill in or delete if N/A] Tests: ([fill in or delete if N/A] % of overall grade): [fill in or delete if N/A] Semester Project: ([fill % of overall grade) in or delete if N/A] [fill in or delete if N/A] Participation: ([fill % of overall grade) in or delete if N/A] [fill in or delete if N/A] Group work: ([fill % of overall grade) in or delete if N/A] [fill in or delete if N/A]
10.4 Installment Buying 10.5 Buying a House with a Mortgage 10.6 Ordinary Annuities, Sinking Funds, and Retirement Investments Chapter 13 - Graph Theory: Study of Euler and Hamiltonian Circuits with emphasis on connection to real-world applications, brute force vs. "quick and dirty” heuristic vs perfect algorithms. Spanning trees with Kruskal’s Algorithm. Choosing the correct “tool” from these three for problem to be solved 13.1 Graphs, Paths, and Circuits 13.2 Euler Paths and Euler Circuits 13.3 Hamilton Paths and Hamilton Circuits 13.4 Trees Chapter 14 – Voting and Apportionment: Study of plurality, majority, Borda Count, Pairwise with Elimination. Arrow’s Impossibility Theorem and the flaws of each system. Importance of deciding the method to be applied BEFORE the ballots are cast. 14.1: Voting Methods 14.2: Flaws of the Voting Methods * Note on optional topics: Sections 1.1, 1.3, 5.7, and 5.8 may be covered if instructor has additional time and should only be covered in addition to the other required topics. Student Responsibilities & Course Policies Homework: ([fill in or delete if N/A] % of overall grade) [fill in or delete if N/A] If you have additional questions from earlier assignments or need extra help, you should: 1. Work together outside of class. 2. Seek tutoring, which is available at the Math Learning Center in B130 (516) 572-7394. 3. [fill in or delete if N/A] Quizzes: ([fill in or delete if N/A] % of overall grade) [fill in or delete if N/A] Tests: ([fill in or delete if N/A] % of overall grade): [fill in or delete if N/A] Semester Project: ([fill in or delete if N/A] % of overall grade) [fill in or delete if N/A] Participation: ([fill in or delete if N/A] % of overall grade) [fill in or delete if N/A] Group work: ([fill in or delete if N/A] % of overall grade) [fill in or delete if N/A]