CIS 23 -- Analysis of Algorithms

[ General information ] [ Syllabus and Calendar ] [ Homework Assignments ]

Announcements

11/21/09	Our final exam for CIS 23 MW11 is Monday, December 21, 10:30am-12:30pm.
11/10/09	Homework 6 has been posted and it is due on Wednesday, November 18.
11/10/09	EXAM 2 is scheduled for MONDAY, NOVEMBER 23. The following topics will be on the exam: Chapter 4: Quicksort, Heapsort, Chapter 5: Selection (min-max, second largest, kth largest), Chapter 7: Graphs (definitions and implementations, Graph Traversals:DFS and BFS), Chapter 8: PRIM's Minimum Spanning Tree Algorithm, and Dijkstra's Shortest Path Algorithm. For each of the above algorithms, you must know the theoretical descripton and complexity analysis, as well as how to practically apply the techniques.
10/06/09	Assignment #4 (on quicksort and heapsort) has been posted. It is due on Wednesday, Oct 21.
10/06/09	Our first exam has been scheduled for Monday, Ocotober 19th. Topics include: [Chapter 1:] Analysis of time complexity, space complexity, asymptotic order, lower bounds and optimality. [Chapter 3:] Recursion Trees and Master Thm for solving recurrence equations. [Chapter 4:] Insertion Sort, Mergesort and lower bounds for sorting. [quicksort and heapsort are NOT on the exam.]
09/24/09	The third homework assignment has been posted. It is due on October 7, 2009.
08/04/09	Welcome to CIS 23! Our first day of class is Monday, August 31. You may follow the links above for information about this course.

If you are interested in internships or other kinds of employment (relating to computer science), please check out the CUNY Institute for Software Design and Development's new Career Center on the web at http://career.cisdd.org. This is a free service that matches current CUNY students with potential employers. To participate, you simply upload your resume information and go through a 10-15 minute interview at the Institute (at the CUNY Graduate Center in midtown). They very much want to have a lot of CUNY students participating, and they're also very eager to help you out with resume-writing and interviewing skills.