Csis 385 analysis of algorithms
1 / 19

CSIS-385: Analysis of Algorithms - PowerPoint PPT Presentation

  • Uploaded on

CSIS-385: Analysis of Algorithms. Dr. Eric Breimer. Course Info. CSIS-385: Analysis of Algorithms (Spring 2006) Lecture: Monday, Wednesday and Friday, 9:20AM - 10:15PM, RB302 Website: http://www.cs.siena.edu/~ebreimer/courses/csis-385-s06/ OR use Google  “Dr. Eric Breimer”. Instructor.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

PowerPoint Slideshow about ' CSIS-385: Analysis of Algorithms' - gabriel-kinney

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

Course info
Course Info

  • CSIS-385: Analysis of Algorithms (Spring 2006)

  • Lecture: Monday, Wednesday and Friday, 9:20AM - 10:15PM, RB302

  • Website: http://www.cs.siena.edu/~ebreimer/courses/csis-385-s06/

  • OR use Google  “Dr. Eric Breimer”


Dr. Eric Breimer

  • [email protected]

  • 786-5084

  • RB 311

  • Office Hours

    • Monday 1:00 - 3:00 PM

    • Wednesday 1:00 - 3:00 PM

    • Thursday 10:30 - 11:30 AM


  • Algorithms, 1/e

    • Richard Johnsonbaugh and

    • Marcus Schaefe


  • CSIS-210

  • MATH-250


  • Mathematics for Algorithms: Order Notation, Mathematic Induction, Recurrence Relations, Graph and Tree Notation

  • Data Structures: Stacks & Queues, Linked Lists, Binary Trees, Priority Queues, Heaps, and Heapsort

  • Searching Techniques: Binary Search, DFS & BFS, Topological Sort, Backtracking


  • Divide and Conquer Algorithms: Mergesort, Closest Pair Problem, Matrix Multiplication

  • Sorting and Selection Algorithms: Insertions Sort, Quicksort, Radix Sort

  • Greedy Algorithms: Kruskal's and Prim's Algorithms, Dijkstra's Algorithm, Huffman Codes, Knapsack Problem


  • Dynamic Programming: Matrix Multiplication, Longest Common Subsequence Problem, Floyd and Warshall Algorithms

  • Text Searching: KMP Algorithm, Boyer-Moore-Horspool Algorithms, Approximate Pattern Matching

  • P and NP Problems: Graph Coloring, Hamiltonian Cycles, TSP, Satisfiability, Independent Set, and Cliques


  • Your final numeric average will be based on the following weights:

  • 40% Exams & Quizzes

  • 30% Homework & Projects

  • 20% Final Exam

  • 10% Lecture Attendance & Participation

Letter grades

A 93.0 or higher avg. 90.0 or higher on the final exam

A- 90.0 or higher

B+ 87.0 or higher

B 83.0 or higher

B- 80.0 or higher

C+ 77.0 or higher

C 73.0 or higher

C- 70.0 or higher

D+ 67.0 or higher

D 63.0 or higher

D- 60.0 or higher

F less than 60.0

Letter grades

Exams quizzes 40
Exams & Quizzes (40%)

  • 2 exams (15% each)

  • 4 pop quizzes (10% total)

  • Exams will be in the evening 6:30-10PM

    • more than 1 hour to complete them.

    • Wed. Mar 1

    • Wed Apr 19

    • 2 days off in return

  • If you miss a pop-quiz, you get a zero.

Homework projects 30
Homework & Projects (30%)

  • 4-5 homework assignments (20% total)

    • programming involved

  • one homework will be an extensive group project (10%)

No late homeworks
No Late Homeworks

  • Homework must be submitted at the beginning of lecture on the due date

    • or you can submit it before the due date.

  • If you are absent or late for lecture when an assignment is due, you will recieve a grade of zero.

  • I highly recommend that students plan ahead to start assignments as soon as possible.

Final exam 20
Final Exam (20%)

  • A cumulative final exam will be given during finals week.

  • To receive an A in this course, you must score a 90 or higher (after curving) on the final exam.

Attendance and participation 10
Attendance and Participation (10%)

  • Everyone starts with a grade of 93.

  • I will lower your grade if I you are absent or late for lecture.

  • I will increase your grade if you frequently ask or answer questions during lecture.

  • I will not lower your grade if I only notice one absence.

  • If I notice that you are absent more than 4 times, your attendance grade will be 60 or lower.

Attendance policy
Attendance Policy

  • You are expected to attend every class.

  • Be aware of the following penalties:

    • You can receive up to a 10% penalty toward you final average for excessive absence and/or lateness.

    • In addition:

      • An unexcused absence on the day of a pop-quiz will result in a grade of zero on the quiz.

      • An unexcused absence from an out-of-class exam will result in a grade of zero.

Excused absences
Excused Absences

  • You can be excused (not penalize) and allowed to makeup missed work for serious issues.

  • For illness or medical emergencies, show documentation (a doctor's note).

  • For family emergencies or other serious commitments, contact academic affairs or the counseling center.

  • If you are concerned that an absence will not be excused, you should contact the instructor as soon as possible.

Academic integrity
Academic Integrity

  • Cheating on a homework, a project, a quiz, or an exam will result in

    • an automatic grade of zero

    • a letter grade reduction on your final grade.

  • Second offense

    • automatically fail the course

    • formal letter send to the academic affairs

Academic integrity1
Academic Integrity

  • For individual work:

    • You can discuss the problems and general ideas for how to approach a problem

    • But, your solution should be your own work and you should guard it from plagiarism.

    • Never compose your answers with the help of other students or tutors.

    • Excessive similarity in homework answers will be consider plagiarism.

    • If you can not adequately explain your solution to a problem, you will receive a zero for that problem.