📄 http:^^vip.cs.utsa.edu^classes^cs3343f96^syllabus.html
字号:
Date: Tue, 14 Jan 1997 22:52:18 GMT
Server: NCSA/1.5.1
Last-modified: Wed, 09 Oct 1996 13:04:34 GMT
Content-type: text/html
Content-length: 2285
<HEAD><TITLE>CS 3343 Analysis of Algorithms</TITLE><BASE HREF="http://vip.cs.utsa.edu/classes/cs3343f96/syllabus.html"></HEAD><BODY></H2><hr><H3><b>Preliminary Information Sheet for CS 3343 Analysis of Algorithms Fall 1996</b></H3><b>Instructor:</b> Dr. Steven Robbins<br><b>Office:</b> 3.02.01A SB<br><b>Phone:</b> 458-5544<br><b>Address:</b> srobbins@runner.utsa.edu<br><p><b>Course Homepage:</b> http://vip.cs.utsa.edu/cs3343<br><p><b>Course Newsgroup:</b> utsa.cs.3343<br><p><b>Office Hours:</b> TTH 11:00 a.m. - 12:15 p.m. and by appointment<p><b>Class Times:</b> TTH 2:00 - 3:15 p.m. in room 3.02.36 HSS<p><b>Text:</b><br> <LI> Required: Data Structures and Algotithms by Aho, Hopcraft, and Ullman<br><LI> Recommended: Introduction to Algorithms by Corman, Leiserson, and Rivest<p><b>Prerequisites: CS 2413, CS 3233, MAT 2213</b><br><p><b> Course Content:</b><br> We will be covering parts of Chapters 1, 6, 7, 8, 9, and 10 from Aho and small sections from Corman. <p><b> Grading</b><br><LI> 30% Two exams <LI> 35% Assignments (programs and problem sets)<LI> 35% Final Exam (Thursday, December 12, 10:30am - 1:15pm)<p><b> Course Policy:</b><br> Friday, October 25, is the last day to drop this course. No make-up exams will be given except for university sanctioned excused absences. Homework assignments will not be accepted after the due date. Hand in whatever you have finished on an assignment on the due date for partial credit. If you must miss an exam (for a good reason), it is your responsibility to contact me before the exam. Leave a message at the above number or send me email. <p> You are to do the assignments without collaboration. You can ask me questions about any aspect of an assignment. General discussion with others on the system or on an approach to a problem is constructive and is okay. However, since your grade is based on your assignments, they must be your own work. Students who hand in programs or written assignments which are identical or nearly identical are cheating. This type of scholastic dishonesty usually results in immediate failure in the course and can lead to additional disciplinary action.<p><hr>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -