Syllabus
|
Document last modified: |
|
Date |
Notes, Readings, Activities |
Homework Due |
Exercise |
Quiz Due |
Test Date |
|
Jan |
Math
Essentials
Similar course at MIT |
Text Solutions |
|||
|
11 |
Chapter 2 |
||||
| 18 |
Analysis Activity
Solution Graphing functions |
1 Answers |
Quiz 1 Math Essentials 7:30P |
||
|
23 |
*Homework 1 Answers |
||||
| 25 |
Activity
Solution Best career choice |
Homework 2 Answers |
2 Answers |
Quiz 2 Chapters 1 & 2 7:30P |
|
|
30 |
|||||
|
Feb 1 |
Big O
Substitution Activity
Solution |
Homework 3 Answers |
3 Answers | ||
|
6 |
Quiz 3 Chapters 3 7:30P |
||||
| 8 |
Master Method Activity
Solution |
4 Answers | |||
| 13 |
Chapter 6
Answers |
*Homework 4 Answers |
|||
| 15 |
Heap Activity
Solution Heap Sort Activity Solution Review |
Quiz 4 Chapter 4 7:30P |
|||
|
20 |
Chapters 1-4 |
Test 1 Review Notes |
|||
|
22 |
Chapter 11
(11.1, 11.2, 11.3-11.3.2) Answers |
||||
| 27 |
Chapter 12 Answers |
Homework 5 Answers |
5 Answers | ||
| 29 |
Chapter 18 Answers |
6 Answers |
Quiz 5 Chapters 6 and 11 7:30P |
||
|
Mar |
|||||
| 7 |
Chapter 8.1
Answers Chapter 21.1-21.2 Answers |
*Homework 7 Answers |
7
Answers |
Quiz 6 Chapters 12 and 18 7:30P |
|
| 12 |
Chapter 22
Answers BFS Activity Solution |
Homework 6 Answers |
8 Answers | ||
| 14 | SCC Activity Solution | ||||
|
19 |
Review |
Homework 8 Answers |
9 Answers |
Quiz 7 Chapters 8 and 21 7:30P |
|
|
21 |
Chapters 6, 8.1, 11, 12, 18, 21.1-21.2, 22 |
Test 2 Review notes |
|||
|
Apr 2 |
Chapter 24 - Single Source
Shortest Paths Answers Single Source Shortest Paths Activity Solution Dykstra's Activity Solution |
Homework 9 Answers |
|
||
|
4 |
Chapter 15 - Dynamic
Programming Answers Dynamic Programming Activity Solution Chapter 16 - Greedy Algorithms Answers Huffman Activity Solution |
||||
| 9 |
Backtracking and
Best-First Answers Backtracking Activity Solution Best-First Activity Solution |
*Homework 10 Answers |
10 Answers |
Quiz 8 Chapters 22 and 24 7:30P |
|
|
11 |
Chapter 27 - Multithreaded Algorithms |
||||
| 16 | Chapter 27 - Multithreaded Algorithms Answers | 11 Answers |
Quiz 9 Chapters 15 and 16 7:30P |
||
| 18 |
Chapter
23 - Minimum Spanning Trees
Answers |
*Homework 11 Answers |
12 Answers | ||
| 23 | Last Class - Review |
Quiz 10 Backtracking, Best-First Chapters 23, 27 and 34 7:30P |
|||
| 25 |
Chapters 15, 16, 23, 24, 27, Backtracking and Best-First |
Test 3 7:00P |
| Some symbols in the notes require Internet Explorer. If you do not have IE on your computer, the files can be converted to PDF by: 0) Copy the URL of the notes (e.g. http://homepages.ius.edu/rwisman/C455/html/syllabus.htm) 1) Open PDFmyURL.com in a browser. 2) Paste the URL for the notes. 3) The PDF should be automatically downloaded, you'll need a PDF reader. |
| Instructor: | Raymond F. Wisman | |||
| Office: | LF122 MW 12:00-1P, 6:30-7:30P and by appointment |
|||
| Class: | CV211 MW 7:30P | |||
| Phone: | 941-2465 | |||
| Email: | ||||
| Web: | www.ius.edu/rwisman/C455 | |||
| Text: | Introduction to Algorithms (3e) by T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein ISBN: 9780262033848 | |||
| Course: | C455 Analysis of Algorithms I (4 cr.) P: C251, C343, Math
M120/M216. Models, algorithms, recurrences, summations, growth rates. Probabilistic tools, upper and lower bounds; worst-case and average-case analysis, amortized analysis, dynamization. Comparison-based algorithms: search, selection, sorting, hashing. Information extraction algorithms (graphs, databases). Graphs algorithms: spanning trees, shortest paths, connectivity, depth-first search, breadth-first search. General methods: dynamic programming, backtracking, best-first, greedy algorithms. |
|||
| Software: | C++ and Java | |||
| Goals: | See C455 Course Goals | |||
| Grade Scale: |
|
|||
|
Course Evaluation: |
Quizzes 20% See Syllabus
for due dates. Class 10% Questions and activities. Homeworks 10% *'ed to be turned in and graded. Exams 60% |
|||
| Ethics: | All work is subject to the Indiana University Code of Student
Ethics. Learning requires a partnership between the instructor, authors, researchers and students; therefore students are encouraged to use any and all resources available to solve homework problems and complete programming assignments. However, students must:
For example, students may work in groups to solve homework problems provided each student creates their own (not copies) solutions and clearly lists all group members or other sources such as authors of texts or on the Internet. Likewise, software that performs assigned functionality may not be directly used but the source code may be consulted provided it is subsequently cited. Changing the spelling of algorithm identifiers does not constitute creating an original solution. It is absolutely essential to note that failure to cite any contributing source will be considered cheating regardless of the reason for the omission. Likewise, verbatim duplication of any source, whether from another student, a text, etc. will always be considered plagiarism. Violation of any aspect of this policy will result in a failing grade for the course. |
|||
| Students with disabilities: | Students who have a disability that requires accommodations in the classroom should contact the Office of Disability Services by phone (941-2243) or email (mtspring@ius.edu) early in the semester so that their learning needs may be appropriately met. The student will need to provide documentation of the disability and if further documentation is needed, recommendations can be provided from the Office of Disability Services. Additional information about the Office of Disability Services may be obtained at: http://www.ius.edu/asc/disabilityservices/ | |||
Disclaimer: |
Although every effort has been made to make the above listing complete and accurate, the instructor reserves the right to make changes on assignment due dates, test & quiz dates; the quantity of assignments, quizzes and tests; and the point totals. The grading scale will remain the same. |