Syllabus CS/TE 6385.0I1 (online course) Summer 2013, 11-week session Purpose and content of the course: The purpose of the course is to make students familiar with fundamental methods in the design and analysis of telecommunication networks. The main emphasis is on the methodology that remains valid on the long term and does not depend strongly on frequently changing applications. Outline of topics to be addressed: introduction to the network planning problem; mathematical programming for planning; basics of linear programming and integer programming as fundamental mathematical tools for network design; network algorithms for planning; optimization for network design; elements of network reliability. Instructor Name: Dr. Andras Farago Title: Professor Department: Computer Science Office: ECS 4.204 Phone: 972-883-6885 E-Mail: [email protected] Mail Station: EC31 WWW: www.utdallas.edu/~farago Teaching Assistant: Yibo Guo. His contact information and office hours are posted under Announcements at the course website in eLearning. Online material The course website is in eLearning. All registered students should be able to access it from the first day of the semester (Thursday, May 30). You are provided with the course material in online lecture notes, no textbook is required. Please follow the link “Learning Modules” at the course website. There are 5 learning modules, and within each one you find a number of lecture notes.. (There are altogether about 40 of them.) Some of the notes are marked optional; they only serve as optional reading material for outlook, but not required. E-mail: The instructor will sometimes send e-mail announcements or reminders, using the group mailing option in eLearning. It is yourresponsibility to make sure that your mailbox does not run over quota, so that the messages do not bounce. Programming projects There are 3 programming projects in the course. You can find all of them under the “Projects” link. You will need to submit them through eLearning by the posted deadlines (see below). If you click on a particular project, you will see how to upload and submit the file. Do not send it via e-mail! Each project is meant to be fully individual work; group work and/or collaboration are not acceptable. Due dates of projects: Project 1: June 21, by midnight Project 2: July 15, by midnight Project 3: August 4, by midnight Exam There will be only one exam (a final exam) in this summer course. Exam date: Saturday, August 10. It will be an online multiple choice exam, so you do not have to come to the campus, you can do it anywhere with Internet access. More details and sample questions will be posted later. Note: Such an online exam is naturally open notes, but you are expected to do individual work. HOW DOES THIS ONLINE COURSE WORK? • Since this is an online course, there are no class meetings. You do not have to be physically present on campus; you only need reliable Internet access. This refers not only to the studying and projects, but also to the exam. • You need to study the posted lecture notes that contain the material. This is done on your own, similarly to an independent study. You may proceed according to your own pace during the semester; there is nopre-set weekly schedule. There are milestones, however. These are the posted deadlines for the programming projects (see the due dates under Programming Projects above), and then the final exam on Saturday, August 10. The projects need to be submitted by the deadlines; late submissions will result in reduced marks. If you run into some difficulty in doing a project, you are welcome to ask questions. As a general rule, please discuss it with the TA first. If it cannot be resolved with the TA, then contact me. Grades Each item (the 3 projects and the exam) will be marked on a scale of 0…100%. A final overall score will be computed from the obtained marks, with weights to be determined later, on the basis of class statistics. The resulting overall score will be mapped to a letter grade. The exact rules and cutoff values will be announced later. Prerequisites Generally, as this is a graduate course in Computer Science, it is therefore assumed that the students have been already exposed to the fundamentals of calculus, probability, discrete mathematics, algorithms, and networks during their undergraduate studies. Catalog prerequisites: CS 5343, CS 5348, and TE 3341 or equivalents. University Policy on Scholastic Dishonesty Students who engage in scholastic dishonesty are subject to serious academic penalties, including the possibility of failure in the course and dismissal from the University. "Scholastic dishonesty includes but is not limited to cheating, plagiarism, collusion, the submission for credit of any work or materials that are attributable in whole or in part to another person, taking an examination for another person, any act designed to give unfair advantage to a student or the attempt to commit such acts." Regents' Rules and Regulations, Part One, Chapter VI, Section 3, Subsection 3.2, Subdivision 3.22. Have a useful and enjoyable
View Full Document
Unlocking...