of College Technology and Applied Sciences Department of Electronics and Computer Engineering Technology
CET 458
Digital Computer Networks SYLLABUS
Fall 2000
Instructor:
B. R. Millard Office: TECH 159 Phone: [phone] Office Hours: Monday & Wednesday 12 Noon to 1PM Tuesday & Thursday 11 AM to 12 Noon
Teaching Assistant: unknown Office: Phone: Office Hours: Lecture: Monday & Wednesday 10:30 - 11:45 AM in CNTR 140 Schedule Line Number: 65382 Catalog Description: Network technology, topologies, protocols, control techniques, reliability, and security. Prerequisite: CET354. Overrides: No capacity overrides will be given. The instructor may give prerequisite overrides to qualified students. Required Texts: Peterson, Larry L and Bruce S. Davie, Computer Networks: A Systems Approach, Morgan Kaufmann Publishers, 2nd edition, 2000, ISBN 1558605142. Grading: Homework Projects Midterm 1 Midterm 2 Final Exam 5 20 20 20 35 100
Sept 25 Nov 6 Dec 11
Comprehensive
See the class web page or page 3 of the syllabus on grading appeals and cheating for information on those topics.
Course Grade: >= 90 >= 80, < 90 >= 70, < 80 >= 60, < 70 < 60
(absolute, fixed, no curve) A B C D E
Page 1 of 3
College of Technology and Applied Sciences Department of Electronics and Computer Engineering Technology
CET 458
Digital Computer Networks Weekly Schedule
Topic
Fall 2000
Introduction Medium Access/Data Link Concepts Packet Switching Midterm1 review Midterm 1 IP, Addressing, Routing UDP & TCP Congestion & QoS Midterm 2 Review Midterm 2 Security Applications Middleware Final review Final
Dates Aug 21, 23 Aug 28, 30, Sept 6, 11 Sept 13, 18 Sept 20 Sept 25 Sept 27, Oct 2, 4, 9 Oct 11,16, 18 Oct 23, 25, 30 Nov 1 Nov 6 Nov 8, 13 Nov 15, 20, 22, 27 Nov 29 Dec 4 Dec 11, 12:20 - 2:10 PM
Reading* Ch 1 Parts of Ch 2 + handout Ch 3 (CH 1-3) (CH 1-3) Ch 4 Ch 5 Ch 6 (CH 4-6) (CH 4-6) Ch 8 Ch 9
Handout (comprehensive) (comprehensive)
Dates are approximate because of need for project discussions. * Reading includes any class handouts that may appear because of limitations in the text and information necessary for programming project. Dates of note: Unrestricted Withdrawal Deadline Midterm Grades Due Restricted Course Withdrawal Deadline Restricted Complete Withdrawal Deadline
Sept 15 Oct 13 Oct 27 Nov 30
Projects: TBD in both number and scope. In part will depend on number and capabilities of students. Homework is collected at the beginning of the class period following the last lecture on the chapter that the homework covers. No late assignments (homework or project) will be accepted without prior approval from the instructor. No make-up exams will be given without written documentation of illness or prior approval from instructor.
Page 2 of 3
College of Technology and Applied Sciences Department of Electronics and Computer Engineering Technology
CET 458
CET 458 Objectives
Digital Computer Networks Supplementary Information
Fall 2000
CET 458, Digital Computer Networks, introduces the principles and technology underlying modern computer networks. Emphasis is on the upper layers covering topics from network control, routing and congestion to control security and application protocols. Recent technological advances (E.G. ATM, IPv6, QoS) will be introduced where appropriate. Several programming projects are used to solidify the concepts. Student will gain essential background that will enhance their capabilities as network administrators, network programmers or application programmers Class Cheating Policy While discussions between students are encouraged, cheating in this course will not be tolerated. Any student found cheating on an exam or assignment may be given a failing grade for the course and flagrant violations can result in additional consequences. You are cheating if you represent someone else's work as your own or if someone else represents your work as theirs. All graded work (exams, programming assignments, as well as any written exercises or quizzes) in this class must represent your own individual work only. Students may discuss the conceptual aspects of an assignment, but in solving programming and other assignments, students must turn in their own, independently developed solutions. Grading may include executing software on your solutions that compares the structure and content of your solution files with that of other students. Any cases of suspected cheating will be referred directly to the College of Technology and Applied Sciences according to established policy. By your registration in this class, you are assumed to have read, understand and agreed to this policy, as well as to the procedures conveyed at the web sites below.
?? ??
Studentlife's Student Academic Integrity Policy http://www.asu.edu/studentlife/judicial/integrity.html ASU's policy on Academic Dishonesty in the Student Code of Conduct: http://www.asu.edu/aad/manuals/sta/sta104-01.html
One ramification of this policy is that every student must assure that neither an electronic nor hard copy of their work gets into the hands of another...