Syllabus

CMPS 260: Introduction to Computer Science, Data Structures & Software Design
Spring 2008 - University of Louisiana at Lafayette - Frank Ducrest, instructor
C++ and program design | Class Notes | Syllabus | Textbook | Web site | Category

Syllabus for CMPS 260 Spring 2008

Introduction to Computer Science, Data Structures & Software Design

TA office hours: http://fidelio.cacs.louisiana.edu/260/classinfo/officehours.pdf

Course Description: Integrated software engineering principles, fundamental data structures and algorithm design and development. Focus on requirements, specifications, design and testing. Fundamental data structures will include arrays, linked lists, stacks and queues. Prerequisites: CMPS 150 and MATH 110 with a grade of C or better. Co-requisite for students planning to take CMPS 261: MATH 270.

Course Goals:

• To gain experience programming in C++.
• To gain experience in using Linux and Unix operating systems.
• To gain experience with object oriented development and related design issues.
• To develop a working knowledge of multidimension arrays, abstract data types, lists, stacks, and queues, searching, C++ templates, pointers and dynamic structures.

Textbook: C++ Programming: Program Design Including Data Structures, 3nd Edition; by D. S. Malik, Publisher – Thomsom Course Technology; ISBN13: 9781418836405, ISBN10: 1418836400

• Labs and assignments will have the value of 50 points. Projects (i.e. programming assignments) will have the value of 100 or 200 points. Point grades for labs, assignments and project points will be summed, then averaged on the total possible points in order to calculate the overall labs, assignments, projects grade.

Your overall average must be 70% or above and you must have at least a 65% exam average and a 65% average on other assignments (labs, assignments, projects) to qualify to pass this class with a C or greater.

Attendance:

1. A signin sheet will be used to take roll at each class meeting. It is the student's responsibility to sign the sheet.
2. You are responsible for all missed work, regardless for the reason for an absence. You are responsible for getting any notes or material you may have missed.
3. Absences for University sponsored events will be treated like any other absence.
4. Students missing an excessive number of classes may be dropped from the class role.

Collaboration: Certain types of assistance are inappropriate for assignments and projects in this class. Read the collaboration policy given to you at the beginning of the semester.

Assignments, Projects and Exams:

1. Your projects must compile with the Sun C++ compiler ("CC") as provided through the UCS Solaris hosts on the UCS network. Your projects will be compiled with the “CC” compiler before being graded. I. e., do not rely on the Gnu g++ compiler or MS Visual, etc. when developing your code. The CC compiler on the Linux systems in ACTR 106 and on the Ubuntu Linux virtual machine may be considered equivilent for development, but it is your responsibility to move code developed in Linux to your UCS class account and to insure that is compiles correctly there on the CC compiler. (To acquire a copy of the Ubuntu Linux virtual machine, write your CLID on a DVD+/R disk and give it to your instructor. Note: DVD+/RW are not be acceptable.)
2. Assignments and programming projects will not be accepted late.
3. To submit your projects, the code must be in the class directory. If you have an emergency and cannot finish a project on time, contact the instructor prior to the deadline, not after. You may submit a project as many times as you like before the deadline. Note that each submission overwrites previous submission, so be sure and submit ALL files each time.
4. You have one week in which to question your grade on an assignment, project or exam starting from the date it is returned. After that time there will be no further discussion or review of the grade.
5. Once you submit a project, do not modify files or change the time stamp of the files until you have resolved any questions about the grade you earned for the project.
6. Hard copies of projects must be submitted in a manila folder. Do not staple or clip the sheets together. This folder is due in class or lab the first class day after the due date.
7. In addition to the standard documentation each source file for projects must include the following certification of authenticity comment at the very beginning of the file.

Certification of Authenticity: {Pick one of the following:}

I certify that this assignment is entirely my own work.

{or}

I certify that this solution to the assignment is entirely my own work, 
but I received some assistance from {name}. Description of the type of 
assistance. (For example, if you consulted a book, and your solution 
incorporates ideas found in the book, give appropriate credit; that is, 
include a bibliographical reference.)

Etceteras:

1. Incomplete Grades are given in this course only under unusual / special circumstances.
2. You must have a pictured ID with you in order to take your exams and collect printouts in the main lab in the Conference Center.
3. The UL at Lafayette Computer Science Department Policies regarding attendance, collaboration and auditing classes are in effect.
4. Students are required to read the Academic Honesty section in the UL at Lafayette Undergraduate Bulletin or the UL at Lafayette Graduate Bulletin.
5. Exams at locations other than the lecture room: Students with special needs should report to Services for Students with Disabilities. If you take your exams through that office, your appointments must be made for the same time and day as the class takes their exams.

Tentative Course Outline and Reading Assignments Reading Key:

1. Introduction and Review
   1. syllabus, course coverage, grading policies
   2. assignment #1 – Unix review
   3. review of Chapters 9 and 10
   4. project #1
2. Classes, Object Oriented Programming and Data Abstraction
   1. Reading: Chapter 11
      1. review programming example Candy Machine ***
   2. project #2
   3. Reading: Chapter 12
      1. read about inheritance, pages 668 – 693 ****
      2. read about composition and other object oriented issues pages 693 – 701 **

*** Exam # 1 ***

1. Pointers, Classes, Virtual Functions, Abstract Classes and Lists
   1. Reading: Chapter 13
      1. pages 734 – 757 **
      2. pages 758 – 786 **
      3. pages 786 (dynamic Array-Based Lists) – 804 ****
      4. Project #3
2. Overloading and Templates
   1. Overloading
      1. Reading: Chapter 14, pages 818 – 880 **
   2. Templates
      1. Reading: Chapter 14, pages 881 – 892 **
   3. project #4
3. Exceptions
   1. Reading: Chapter 15
      1. pages 908 – 939 *
4. Recursion
   1. Reading: Chapter 16
      1. pages 946 – 971 *

*** Exam # 2 ***

1. Linked Lists, Stacks and Queues
   1. Linked Lists
      1. Reading: Chapter 17
         1. pages 982 – 1018 ****
         2. programming example Video Store ***
   2. project #5
   3. Stacks
      1. Reading: Chapter 18
         1. pages 1076 – 1112, /*
   4. Queues
      1. Reading: Chapter 18
         1. pages 1131 – 1149, /*
   5. Ordered Lists, Doubly Linked Lists
      1. Reading: Chapter 17
         1. pages 1018 – 1045 **
   6. project #6
2. Design
   1. Reading: Programming Documentation Standard, parts I, II, II.1, II.2, II.3 **
   2. design project
3. Sequential and Binary Search, Asymptotic Notation (Big 0 Notation)
   1. Reading: Chapter 19
      1. pages 1184 1204 **

*** Exam #3 (final – comprehensive) ***

Additional topic: Makefiles and the make utility will be covered only in lab.