We propose introducing algorithm time efficiency analysis by utilizing a set of template examples that illustrate the following seven basic time performance complexity categories: log n, n, n log n, n 2 , n 3 , a n , and n!. The complexity category of some function f(n) is the set of all functions that have the same asymptotic growth as f(n), which is… (More)
Publications include monograph on automated theorem proving, two books on recursion (in Pascal and in Java), and number of papers published in refereed journals and conf. proceedings.
TARA is web based application for learning and practicing time efficiency analysis of recursive algorithms. The application is intended to be used both by instructors and students. Students can practice this traditionally difficult topic through a sequence of sessions. Depending on their background, available time, and expertise, they can work on one or… (More)
In February, the Computer Science department moved into new digs on the third floor of Maria Sanford Hall. The new suite houses nine faculty offices, a reception area and a student work area; all very elegant , spacious, and private! We acknowledge this major institutional investment in the department and wish to express our gratitude and appreciation to… (More)