[Math 3033] Intro to Task Processor Problems

(13:22)

[Math 3033] The Priority List Model

(4:22)

[Math 3033] Intro to Simple and Compound Interest

(21:41)

[Math 3033] Creating and Understanding Digraphs

(18:50)

[Math 3033] Reading a Preference Schedule

(5:6)

[Math 3033] Example of Simple Interest

(7:26)

[Math 3033] The Nearest Neighbor Algorithm

(9:1econd)

[Math 3033] Intro to Percentages

(5:14)

[Math 3033] Intro to Chapter 1 - Basic Elements of an Election

(22:22)

[Math 3033] Compound Interest (example 1 - annual)

(7:38)

[Math 3033] Example of Brute Force Algorithm

(7:9)

[Math 3033] The Repetitive Nearest Neighbor Algorithm

(14:16)

[Math 3033] Scheduling Tasks using the Priority List Model (example 2)

(8:50)

[Math 3033] Scheduling Tasks using the Priority List Model (example 1)

(14:35)

[Math 3033] Compound Interest (example 3 - continuous)

(9:36)

[Math 3033] Compound Interest (example 2 - monthly)

(6:49)

[Math 3033] The Borda Count Method (example 1)

(10:48)

[Math 3033] Mental Percentages and Various Tips

(10:53)

[Math 3033] The Plurality Method

(9:14)

[Math 3033] The Cheapest Link Algorithm (example 2)

(4:4)