CSCE310: Data Structures and Algorithms

Prereq:         CSCE156 (Intro. to CS II) and CSCE235 (Intro. to Discrete Structures).

Course description:  In this course you will learn the basis of the design and analysis of algorithms.  The following topics will be addressed, time permitting:   asymptotic analysis, greedy,  divide and conquer,  search, sort, algorithms on trees, graphs, dynamic programming, NP-completeness, etc.

Time:           Monday, Wednesday, Friday, from 2:30 p.m. to 3:20 p.m.

Place:           Room 217, Ferguson Hall

Instructor:   Prof.  Berthe Y. Choueiry
                      Room 104, Ferguson Hall,
            , tel: (402)472-5444.
                      Office hours:  Mon/Fri from 3:30 p.m. to 4:30 p.m., or by appointment.


Class schedule: the page will be regularly updated. Check it out often for reference to required and recommended reading material, homework texts, and announcements.

Required textbook (check the bookstore): Introduction to Algorithms, Cormen, Leiserson, and Rivest. Love library: QA76.6 .C662 1990 pt.1  and pt.2

Protocol of the course:

Grading policy: Grade conversion:
>94% A+
90--94 A
 85--89 B+
80--84 B
70--79 C+
60--69 C
55--59 D+
50--54 D
<=50 F

Acknowledgement:  Much of the material is borrowed from Fall2000/CSCE310, courtesy of Dr. Chuck Cusack, and other similar courses on the Web.

Berthe Y. Choueiry

Last modified: