Former University of Illinois at Urbana-Champaign Course Number:
AD 520-Q
The deadline for web registration for this course has passed.
Please call Academic Registration at 1-800-582-9976,
and press option #2 for late registration into this course.
|
Course Description:
Advanced data structures, graph algorithms, arithmetic algorithms, geometric algorithms, string problems, parallel algorithms, NP-completeness.
Course Outline by Topical Areas:
|
Machine models. Randomized computation. Abstract data types. Queues, stacks, trees.
|
|
Selection sort. Heapsort. Quicksort. Mergesort. Distribution sort, double distribution sort. Lower bounds. Selection and median finding. Parallel sorting.
|
|
Tries. Hashing: perfect hashing, universal hashing, extendible hashing. Weighted trees. Balanced trees. Priority queues. Self organizing structures, splay trees. Persistent trees, searching in history. Union-find.
|
|
Representations. Topological sorting. Transitive closure. Depth first search. Strongly connected and biconnected components. Minimum spanning tree, parallel version. Maximum flow, bipartite matching. Planarity. General path problems.
|
|
Satisfiability, traveling salesman, graph problems. Approximation algorithms. Other complexity classes.
|
Course Requirements:
|
Hardware Requirement: To participate in an Illinois computer science course, you will need the following minimum hardware configuration and software applications: Pentium 200 (Pentium II or better class recommended due to the nature of some applications); 16 MB of RAM (32 MB RAM recommended); Windows 95, 98, or NT; 56K modem with Internet connection; Color monitor with 800x600 resolution; 6 bit sound card and speakers; Double speed CD Rom drive. These are the minimum requirements. A faster CPU and more RAM will enable you to utilize more applications simultaneously. A faster Internet connection will provide better audio and video quality.
|
|
Software Requirements: Internet Explorer 4.01 or higher or · Netscape 4.01 or better. Microsoft Media Player(tm). Microsoft Powerpoint(tm) (included with Office Professional) or you can (Instructions will be given during the orientation activity about how you can download the free PowerPoint player if you do not have PowerPoint (2.7 MB file).Adobe Acrobat Reader Microsoft NetMeeting(tm) (video conference card is optional) Internet access through an Internet Service Provider E-mail software (Netscape and Internet Explorer each provide options for free e-mail applications). Please note: If you plan to take a course from a corporate environment behind a firewall: 1. The lecture videos will most likely work behind a corporate firewall. A general rule is that if you can see the videos on the CS demo page, you will be able to see them during the semester. However, if you cannot see the videos, it does not mean that the firewall is the problem. You may not have the Media Player set correctly. If you cannot see the demo videos, send mail to imcs-support@cs.uiuc.edu. 2. The method of homework and machine problems varies by class. Many courses accept submissions via e-mail, while others will require access to the Computer Science network. As a registered student, you will be given access to the UI Computer Science network. Some companies do not allow remote or telnet access through firewalls as a security measure. You should check with your systems administrators about policies in this area. Many students get around this issue by viewing lectures at work, and by using a local ISP to access the UI networks from home. If you have questions about technical requirements, send e-mail to imcs-support@cs.uiuc.edu .
|
|
Homework: Six homework assignments
|
|
Examinations: Two midterms and a final exam
|
Notes:
|
After completion of the enrollment process, please send an email to L-krute@uiuc.edu to obtain logistical information about the online computer science orientation activity.
|
Degree Applicability: |
CE[CD] |
CH[NA] |
CS[CD] |
EE[BE] |
EM[E] |
ESM[NA] |
MAT[NA] |
|
MBA[NA] |
ME[E] |
MES[E] |
MSE[BCE] |
SE[B] |
SY[AA] |
Click here for further information on degree applicability.
NTU Semester Credit Hours:
4
Number of Lecture Hours:
42 lecture hours - Web/Internet
Days Class Meets on Campus:
NA
Contributing Scholar:
Sariel Har-peled
Department of Computer Science
University of Illinois at Urbana-Champaign
2111 Digital Computer Lab
1304 W. Springfield
Urbana, IL
61801
Phone: 217-333-4219
sariel@cs.uiuc.edu
Note: Contributing Scholars are responsible for the design, organization, content, and presentation of NTU courses. Online classroom management, student management, and other matters related to academic administration of courses are the responsibility of support "Faculty". Either person is often called "Instructor". To identify and differentiate between these roles, we use the terms "Contributing Scholar" and "Faculty".
Academic/Administrative Contact:
Dr. Linda D. Krute
Phone: 919-515-5440
Fax: 919-515-8415
Linda_Krute@ncsu.edu
Prerequisites:
Basic course in data structures and software principles and theory of computation or consent of instructor.
Textbooks: (Order Materials)
| 1. |
Introduction to Algorithms, Cormen, Leiserson and Rivest, McGraw-Hill
|
| Tuition for AD 520-Q , Fall Semester 2001 |
| Semester Credit Hours (SCH): | 4 |
| Tuition per 1 SCH, for Credit: | $858.00 |
| Total Tuition 4 SCH, for Credit: | $3432.00 | | |
| Tuition per 1 SCH, Audit: | $858.00 |
| Total Tuition 4 SCH, Audit: | $3432.00 |
| *** Please note that the above tuition amounts do not include any delivery fees, textbook fees, or special fees that may be applicable - see Notes section above. *** |
|
