| Lecture |
Section 1: KEC
1001 TR
11:00 - 12:20 |
Instructor
(contact info) | Paul D. Paulson |
Office Hours
(in KEC 2061) | MW
10:00 am - 12:00 noon
TR 1:00 pm - 3:00 pm
other times by appointment |
TAs
Office/lab hours in Dearborn
205 | Matt
Hillier (email)
Rick Edgecombe (email) |
| Prerequisites |
CS261, C programming and Unix familiarity |
| Textbook and Lab Manual | Required: Comer, Douglas E., Computer Networks and Internets with Internet Applications (4th edition), Pearson Prentice-Hall, 2004. ISBN 0-13-143351-2 Comer, Douglas E., Hands-on Networking with Internet Technologies (2nd edition), Pearson Prentice-Hall, 2004. ISBN 0-13-144310-0 (free with textbook) Recommended (and free):
Hall, Brian, Beej's
Guide to Network Programming: Using Internet Sockets
|
Course
Learning
Objectives | On completion of the course, students will be able to: - describe the hardware devices used to create a network
- give examples of networking technologies, and examine the associated standards
- describe the essential features of a networking protocol
- describe various congestion control, error detection, and error correction schemes
- create a local area network and a model intranet by configuring networking hardware and software in a controlled laboratory environment
- create low-level client-server application programs using the socket API
- demonstrate (simulate) the processes of packet construction, packet switching, and packet deconstruction
- apply a route discovery algorithm to determine the shortest path in an internet represented as a weighted graph
- compare/contrast cable networking and wireless networking
- use a variety of networking services, such as DNS, NAT and ARP
- associate networking functions with the appropriate layers of the ISO/OSI networking layering model, and associate internetworking functions with the appropriate layers of the TCP/IP layering model
- describe network security issues and some of the methods for managing those issues
|
| Academic Honesty Policy |
See the university,
college,
department,
and course policies.
Obviously, compliance is expected. |
| Schedule
|
Check here every week; the schedule is subject to "adjustments" |
| Grades | 5 labs / reports @ 5%
3 homeworks @ 0%
2 programming assignments @ 10%
2 quizzes @ 10%
1 midterm exam
Final exam (Thursday, June 14, 12:00)
Final grades are based on the accumulated percentage.
See the evaluation criteria and
grading scale. Quiz, exam, and
final grades may be adjusted linearly if it seems appropriate. | |
