CS365 Computer Networking

for F1B 2007

Printer Friendly

Mission Statement: The mission of Park University, an entrepreneurial institution of learning, is to provide access to academic excellence, which will prepare learners to think critically, communicate effectively and engage in lifelong learning while serving a global community.

Vision Statement: Park University will be a renowned international leader in providing innovative educational opportunities for learners within the global society.


CS 365 Computer Networking


F1B 2007 BL


Gonzalez, Arturo


Adjunct Faculty


M.A. Computer Resources Management
M.A. Management
B.S. Management Information Systems

Office Hours

By Appointment

Daytime Phone


Other Phone





Semester Dates

07 Aug. 2007 to 27 Sept. 2007

Class Days


Class Time

7:40 - 10:10 PM

Credit Hours



Fitzgerald, Jerry and Dennis, Alan  Business Data Communications and Networking, Hermitage Publishing Services, Ninth Edition

Textbooks can be purchased through the MBS bookstore

Additional Resources:

McAfee Memorial Library - Online information, links, electronic databases and the Online catalog. Contact the library for further assistance via email or at 800-270-4347.
Career Counseling - The Career Development Center (CDC) provides services for all stages of career development.  The mission of the CDC is to provide the career planning tools to ensure a lifetime of career success.
Park Helpdesk - If you have forgotten your OPEN ID or Password, or need assistance with your PirateMail account, please email helpdesk@park.edu or call 800-927-3024
Resources for Current Students - A great place to look for all kinds of information http://www.park.edu/Current/.

Course Description:
This course provides an overview of computer networking concepts. Course topics include (but are not limited to): protocol layer stack, circuit switching vs.packet switching, connectionless vs. connection-oriented services, routing, Ethernet, LAN topologies, transmission media. Optionally, the course may provide hands-on projects. For example, students may be asked to install and configure a LAN, install and use Linus network applications, or write network programs. Prerequisite: CS208 and CS219. 3:0:3

Learning Outcomes:
  Core Learning Outcomes

  1. Explain and apply basic computer networking concepts including (but not limited to): *Circuit-switching vs. packet-switching. *Residential access networks - point to point, dialup modem, ISDN, ADSL, cable modem. *Physical media - twisted pair, coaxial cable, fiber optic cable, unguided media. *Protocol layer stack. *Client-server paradigm. *Calculating delay in packet-switched networks.
  2. Explain and apply several common application-layer applications in depth. For example, explain several of these applications in depth: *Telnet. *FTP. *DNS name server. *DNS name server. *HTTP web server. *SMTP mail server.
  3. Explain and apply these transport-layer concepts: *UDP protocol. *TCP protocol. *Reliable data transfer. *Flow control. *Congestion control.
  4. Explain and apply these network-layer concepts: *IP protocol. *Routing algorithms - link state algorithm, distance vector algorithm. *IPv4 addressing.
  5. Explain and apply these link-layer and local area network concepts: *Network topologies - bus, star, ring. *Error detection and correction. *ARP *Ethernet *Token ring *Hubs, switches, and bridges.
  6. Optional - upon completion of this course, the student should be able to do one or two of the following:
  7. Use and explain Linux commands and Linux networking applications.
  8. Install and configure specified Linux network applications. Note that teachers should cover this objective only if their site has spare computers that can be wiped clean and converted to Linux computers.
  9. Write specified networking programs.
  10. Use and explain Windows server administration.
  11. Design a LAN or WAN.
  12. If any of the above optional objectives are met, then some of the earlier objectives will probably have to be omitted because there will be less time to teach them. If that's the case, it is up to individual instructors to decide which of the earlier objectives to omit.

Core Assessment:

For this course, the assessment is based on a final exam. There will be 4 questions in each of the 8 categories, i.e. Synthesis, Analysis,… etc. Thus, there will be 32 questions total in the final exam. Furthermore, all 4 questions for each category should cover all 4 learning outcomes.

Class Assessment:

This course will require the following:
2 Projects 100 points each
3 Exams   100 points each


Total Points      Percent         Grade
450 - 500         90 - 100          A
400 - 449         80 - 89            B
350 - 399         70 - 79            C
300 - 349         60 - 69            D
000 - 299         00 - 59            F

Late Submission of Course Materials:

The instructor does not accept late assignments.

Course Topic/Dates/Assignments:


Assignment Project/Exam
01 - 07 Aug Chapters 1 and 2
02 - 14 Aug Chapters 3 and 4 Project 1 Assigned
03 - 21 Aug Chapter 5 and 6

Project 1 Due

Exam I (Chapters 1 to 5)

04 - 28 Aug Chapter 7 and 8
05 - 04 Sept Chapters 9 and 10 Project 2 Assigned
06 - 11 Sept Chapter 11 

Project 2 Due

Exam II (Chapters 6 to 10)

07 - 18 Sept Chapter 12
08 - 25 Sept Chapter 13 Final

Academic Honesty:
Academic integrity is the foundation of the academic community. Because each student has the primary responsibility for being academically honest, students are advised to read and understand all sections of this policy relating to standards of conduct and academic life.   Park University 2006-2007 Undergraduate Catalog Page 87-89

Plagiarism involves the use of quotations without quotation marks, the use of quotations without indication of the source, the use of another's idea without acknowledging the source, the submission of a paper, laboratory report, project, or class assignment (any portion of such) prepared by another person, or incorrect paraphrasing. Park University 2006-2007 Undergraduate Catalog Page 87

Attendance Policy:
Instructors are required to maintain attendance records and to report absences via the online attendance reporting system.

  1. The instructor may excuse absences for valid reasons, but missed work must be made up within the semester/term of enrollment.
  2. Work missed through unexcused absences must also be made up within the semester/term of enrollment, but unexcused absences may carry further penalties.
  3. In the event of two consecutive weeks of unexcused absences in a semester/term of enrollment, the student will be administratively withdrawn, resulting in a grade of "W".
  4. A "Contract for Incomplete" will not be issued to a student who has unexcused or excessive absences recorded for a course.
  5. Students receiving Military Tuition Assistance or Veterans Administration educational benefits must not exceed three unexcused absences in the semester/term of enrollment. Excessive absences will be reported to the appropriate agency and may result in a monetary penalty to the student.
  6. Report of a "F" grade (attendance or academic) resulting from excessive absence for those students who are receiving financial assistance from agencies not mentioned in item 5 above will be reported to the appropriate agency.

Park University 2006-2007 Undergraduate Catalog Page 89-90

Disability Guidelines:
Park University is committed to meeting the needs of all students that meet the criteria for special assistance. These guidelines are designed to supply directions to students concerning the information necessary to accomplish this goal. It is Park University's policy to comply fully with federal and state law, including Section 504 of the Rehabilitation Act of 1973 and the Americans with Disabilities Act of 1990, regarding students with disabilities. In the case of any inconsistency between these guidelines and federal and/or state law, the provisions of the law will apply. Additional information concerning Park University's policies and procedures related to disability can be found on the Park University web page: http://www.park.edu/disability .


This material is protected by copyright and can not be reused without author permission.

Last Updated:6/19/2007 12:37:10 AM