Computing and Communications Technology

Course description

The course offers a comprehensive coverage of the basic concepts of computing and data technologies.  The first part of the course is devoted to the computer organization and design. This part discusses the main components of computers and the basic principles of their operation. It demonstrates the relationship between the software and hardware and focuses on the foundational concepts that are the basis for current computer design. The second part of the course discusses the architecture of the distributed computer systems. The main emphasis here is on data distribution, as the way data are generated, stored and used is naturally distributed. This part discusses various levels of transmitting, storing and using information, data and knowledge and surveys important areas as Information Theory, Switching, Databases, Data classification, Distributed memory and data retrieval, World Wide Web and Data Mining. 3 Cr.

Logistics

Instructor

Dmitri A. Gusev

Office

Maria Sanford Hall, Room 303-009

Phone

(860) 832-2719

Fax

(860) 832-2712

E-mail

gusevdma@ccsu.edu

Office hours

MW, 4:30-5 p.m. and 8:15-8:45 p.m.

TR, 4-5 p.m. and 8:15-8:45 p.m.

Class meetings

MW, 6:45-8:00 p.m., MS 310

Textbook

• David A. Patterson and John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, Third Edition, Morgan Kaufmann Publishers, 2004, ISBN: 1-55860-604-1

Course objectives

Upon successful completion of the course the student will be able to:

• Understand the basics of the von Neumann computing architecture;
• Understand the basics of the MIPS instruction set architecture and write simple assembly language programs;
• Design simple ALU and CPU at an abstract logical level;
• Understand the principles of distributed systems;
• Understand the basics of important related areas as Information Theory, Switching, Databases, Information retrieval, World Wide Web and Data Mining.

Tentative schedule

Reference: P – David A. Patterson and John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, Third Edition, Morgan Kaufmann Publishers, 2004

Week 1:

• 09/05 Lecture 1: Introduction and Course Overview
  Reading: P 1

Week 2:

• 09/10 Lecture 2: Instruction Set Architecture I
  Reading: P 2.1-2.6
• 09/12 Lecture 3: Instruction Set Architecture II
  Reading: P 2.8, 2.9, 2.16

Week 3:

• 09/17 Lecture 4: Computer Arithmetic & ALU Design I
  Reading: P 3.1-3.4
• 09/19 Lecture 5: Computer Arithmetic & ALU Design II
  Reading: P 3.6, B.5 (CD)

Week 4:

• 09/24 Lecture 6: CPU Datapath and Control I
  Reading: P 5.1-5.3
• 09/26 Programming assignment due; Lecture 7: CPU Datapath and Control II
  Reading: P 5.4, 5.5

Week 5:

• 10/01 Lecture 8: Pipelining I
  Reading: P 6.1, 6.2
• 10/03 Lecture 9: Pipelining II
  Reading: P 6.4-6.6

Week 6:

• 10/08 Lecture 10: Memory Hierarchies
  Reading: P 7.1-7.3
• 10/10 Lecture 11: Virtual Memory
  Reading: P 7.4

Week 7:

• 10/15 Midterm project due; Lecture 12: Interfacing Peripherals
  Reading: P 8
• 10/17 Lecture 13: Multiprocessors, review
  Reading: P 9 (CD)

Week 8:

• 10/22 Midterm exam
• 10/24 Lecture 14: Fundamentals of Distributed Systems I

Week 9:

• 10/29 Lecture 15: Fundamentals of Distributed Systems II
• 10/31 Lecture 16: Fundamentals of Probability

Week 10:

• 11/05 Lecture 17: Fundamentals of Information Theory I
• 11/07 Lecture 18: Fundamentals of Information Theory II

Week 11:

• 11/12 Lecture 19: Switching I
• 11/14 Lecture 20: Switching II

Week 12:

• 11/19 Lecture 21: Database Management Concepts I
  
• 11/21 No class, Thanksgiving recess

Week 13:

• 11/26 Lecture 22: Database Management Concepts II
• 11/28 Lecture 23: Distributed Memory & Data Retrieval

Week 14:

• 12/03 Quiz due; Lecture 24: World-Wide Web
• 12/05 Lecture 25: Java Applets, etc.

Week 15:

• 12/10 Lecture 26: Introduction to Data Mining I
• 12/12 Lecture 27: Introduction to Data Mining II

Week 16:

• Term paper due

Midterm project

Designing a mini MIPS machine.

Midterm exam

The midterm is designed as an elemental evaluation device and to prompt the student to stay abreast of assigned topics. The test will take 75 minutes.

 Questions on a test may include:

• True/false questions,
• Multiple choice questions,
• Short answer questions,
• Problem questions.

Term paper

A distributed system analysis.

Honesty policy

It is expected that all students will conduct themselves in an honest manner (see the CCSU Student Handbook), and never turn in any work which is not their own. Violating this policy will result in a substantial grade penalty, and could result in expulsion from the University.

Attendance

Students are responsible for attending all scheduled classes and labs. Students who are unable to attend class or meet deadlines for assignments due to religious beliefs or other valid excuses must contact the instructor ahead of time so that we might work out arrangements. No make-up exam will be given unless the student's absence is approved by the instructor BEFORE the exam is given. All students are responsible for material covered during their absence regardless of the reason.

Late Assignments

Assignments are due at the beginning of class on their respective due dates. Late assignments, projects, and quizzes are accepted, at 10% penalty per work day (Saturdays and Sundays don’t count), but no later than one week after the due date. For example, if an assignment is turned in one week late, you may get up to 50% credit for it.

Students with disabilities

Any student who feels s/he may need an accommodation based on the impact of a disability should contact me privately to discuss your specific needs. I will need a copy of the accommodation letter from Student Disability Services in order to arrange your class accommodations. Contact Student Disability Services, Room 241, Copernicus Hall, if you are not already registered with them. Student Disability Services maintains the confidential documentation of your disability and assists you in coordinating reasonable accommodations with your faculty.

Grades and evaluation

The final course grade will be calculated according to the following table:

Course letter grade will be determined as follows:

A	A-	B+	B	B-	C+	C	C-	D+	D	D-	F
95-100	90-94	87-89	84-86	80-83	77-79	74-76	70-73	67-69	64-66	60-63	0-59