Data Communication and Networks - PowerPoint PPT Presentation

1 / 12
About This Presentation
Title:

Data Communication and Networks

Description:

Office hours: Thursdays 6:00 6:50 (please make an appointment!) Class Mailing List. All students should register themselves with the class list, which is used for ... – PowerPoint PPT presentation

Number of Views:30
Avg rating:3.0/5.0
Slides: 13
Provided by: jcon8
Learn more at: https://cs.nyu.edu
Category:

less

Transcript and Presenter's Notes

Title: Data Communication and Networks


1
Data Communication and Networks
  • Lecture 0
  • Administrivia
  • September 9, 2004
  • Joseph Conron
  • Computer Science Department
  • New York University
  • jconron_at_cs.nyu.edu

2
Adminstrivia
  • You must be registered in G22-2262-001 to receive
    a grade
  • How to reach me jconron_at_cs.nyu.edu
  • Office hours Thursdays 600 650 (please make
    an appointment!)

3
Class Mailing List
  • All students should register themselves with the
    class list, which is used for all technical
    discussions concerning the course. To register,
    go to the following web page, and follow the
    instructions cs.nyu.edu/mailman/listinfo/g22_226
    2_001_fa04
  • You will be notified in return that you are a
    list participant. Please send all of your
    questions to this list (not to the instructor) so
    that everyone can participate.  

4
Computer Accounts
  • Students that do not already have a CIMS Sun
    network account should apply for one as follows
  • Send email to petagna_at_cs.nyu.edu with CIMS
    Account Request as the subject. In the body of
    the message, type
  • Name
  • Student ID number
  • Department
  • Degree Program
  • Course numbers of courses you have already
    registered for.

5
Grading
  • Four homework assignments (15 each)
  • Final project (40)
  • Assignments due every three weeks (except
    assignment 1)

6
Grading Schedule
Grades will be given according to the following
schedule A 93 - 100 A- 90 - 92.9 B 87 -
89.9 B 83 - 86.9 B- 80 - 82.9 C 75 -
79.9 C 70 - 74.9 C- 60 - 69.9
7
Rules for Working on Assignments
  • All assignments must be done individually (see
    Cheating below).
  • Unless stated otherwise in the assignment, all
    writing and coding must be original.
  • All assignments must be emailed to the
    appropriate grader. To avoid problems with
    "lost emails" ("the Internet ate my homework")
    you should save a copy of your EMAIL (not simply
    the assignment itself).

8
Cheating Policy
  • You should NOT
  • Copy any part of another student's homework
    answers.
  • Allow another student to copy your homework.
  • Copy any part of code found in a book, magazine,
    the Internet, or other resource.
  • Present the work of another as your own. If you
    use the idea of another in your work, you MUST
    provide appropriate attribution (that is, cite
    the work and the author).
  • The penalty for cheating will be a grade of F
    for the course.

9
How to hand in AssignmentsLate Assignments
  • Homework problems must be submitted by email to
    the designated grader. Please include
  • Your name
  • Your SID
  • Assignment number (1, 2, )
  • Homework may be submitted up to one week late,
    but will receive a 10 penalty.
  • NO credit will be given for ANY assignment
    submitted later than one week from the due date.

10
Books
  • Required texts
  • James Kurose and Keith Ross, Computer Networking
    A Top-Down Approach Featuring the Internet, 3rd
    Edition, Addison Wesley, 2004, ISBN 0321227352
  • Recommended texts
  • William Stallings, Data Computer Communications
    Seventh Edition, Prentice Hall, 2003, ISBN
    0131006819
  • Douglas Comer, Computer Networks And Internets
    with Internet Applications, 3rd Edition, Prentice
    Hall, ISBN 0130914495
  • Comer, D.E. and Stevens, D.L. Internetworking
    with TCP/IP Volume III Client-Server
    Programming and Applications, BSD socket version,
    Second Edition, Prentice Hall, ISBN
    0-13-260969-X, 1996.

11
What We Will Cover
  • Application Protocols
  • Socket Programming (in JAVA)
  • Data Structures (FSM, Queues, Ring Buffers)
  • Data Encoding and Transmission, Error Detection
  • Data Link Control
  • Packet switched and circuit switched networks
  • Congestion Control and Flow Control Methods
  • Internet Protocols (IP, ARP, UDP, TCP)
  • Network (packet) Routing Algorithms (OSPF,
    Distance Vector)
  • Multimedia Networking

12
Questions?
Write a Comment
User Comments (0)
About PowerShow.com