CSC 344 - Algorithms and Complexity

Dr. R. M. Siegfried

Science 407      (516)877-4482      siegfrie@adelphi.edu

For assignment submission: siegfriedHW@gmail.com

Office hours: Tu 12:00 Noon - 2:00PM; W 10:00-11:00AM; F 1:00-2:00PM

Below you will find links to the assignments assigned so far this term:

• Assignment #1 - Some basic mathematical induction practice
• Assignment #2 - Working with Asymptotic Notation
• Assignment #3 - Analyzing the efficiency of sorts
• Assignment #4 - Tracing a Polyphase merge of 34 runs
• Assignment #5 - Creating an AVL Tree, a 2-3 tree and a B-tree
• Assignment #6 - Using Kruskal's and Prim's Algorithm To Find the Minimum Spanning Tree
• Assignment #7 - Deriving the Finite State Machines for the Knuth-Morri-Pratt Algortihm
• Assignment #8 - Fun with Random Numbers
• Assignment #9 - Turning a Recursive Method into an iterative method.
• Assignment #10 - Solving simple, linear recurrence relations
• Assignment #11 - Calculating sin x efficiently using the Taylor series