Instructor:

Office Hours:

Lectures:

Text and Materials:

You should have completed either CSCI 2330 (C++ Programming) or CSCI/CMPE 1370 plus CSCI/CMPE 1170, or CSCI 1380 (Computer Science I in C++). You should have learned procedure-oriented programming, and the basic concepts of object-oriented C++ programming. In the first one or two days, I will give a quick introduction to Object-Oriented Programming in C++.

Please be advised that there are six programming projects. All projects must be coded in C++ classes unless stated otherwise. Our main programming environment is Microsoft Visual Studio.Net (2003, 2005 or 2008). I have arranged lab hours at our computer labs on the second floor of the Academic Services Building. You can also use the Advanced Computer Lab ENGR. 2.228 on the second floor of the Engineering Building to work on your programming assignments. Please check with our system administrator Mr. David Kirtley to open an account to access machines at the Advanced Computer Lab ENGR 2.228. Lab consultants are available for help on the environment, coding and debugging. If you are not very familiar with Microsoft Visual Studio.Net, you should spend a lot of time to play with it. Although I am always ready to help you and so are the lab consultants, yet without your own time investment to the environment you will have difficulties to complete the course. Remember that we do programming homework assignments and a lot of lab programming assignments.

For your convenience, this link gives you a copy of the user menu about how to getting started with Microsoft Visual Studio.Net ==> Click Here!

Prerequisites:

CSCI/CMPE 1370 An introduction to computer science and computer engineering. The fundamentals of a high-level programming language will be introduced. Methods of problem solving, techniques of algorithmic development and concepts of procedural and object-oriented programming will be emphasized... Societal and Social Issues related to Computer Engineering will be introduced. Prerequisites: CSCI 1300 or equivalent experience and grade of C or better in MATH 1340 or placement in a higher level Math course. Co requisite: CMPE 1170. Cannot receive credit for both CSCI1380 and CMPE1370. Will replace a grade received in CSCI 1380. Equivalent course: CMPE 1370 a student may receive credit in only one course.

CSCI/CMPE 1170 The course includes hands-on instruction and laboratory exercises in developing programs written in a high-level object oriented programming language applying the principles taught in the CMPE 1370 lecture course. Co-requisite: CMPE 1370 . Equivalent course: CSCI 1170 A student may receive credit in only one course.

CSCI 1380 An introduction to computer science and computer programming is given, in which the fundamentals of a high-level programming language will be introduced. Methods of problem-solving, techniques of algorithmic development and concepts of structured object oriented programming will be emphasized. Prerequisite: Concurrent Enrollment in MATH 1340.

Course Topics:

Course Objectives:

1. To continue the development of problem solving skills in a context that emphasizes a structured, top-down approach.
2. To demonstrate the application of software engineering principles in designing, coding and testing large programs.
3. To introduce students to essential data structures such as linked lists, stacks, queues, and trees. This introduction emphasizes the specification of each structure as an abstract data type (ADT).
4. To provide a systematic approach to the study of algorithms that focuses first on the understanding of the algorithm and then on analyzing the algorithm from a time/space perspective. In particular searching, sorting, and recursive algorithms are covered.
5. To evaluate the time and space tradeoffs in the design and implementation of ADT's.
6. To make students aware of the importance of object-oriented methods in developing software, particularly in the design and implementation of ADT's.

Learning Outcomes:

1. Design, implement, test, and debug simple programs in an object-oriented programming language.
2. Write programs that use each of the following data structures: arrays, records, strings, linked lists, stacks, queues, and hash tables.
3. Choose the appropriate data structure for modeling a given problem.
4. Identify the base case and the general case of a recursively defined problem.
5. Implement, test, and debug simple recursive functions and procedures.
6. Compare iterative and recursive solutions for simple problems.
7. Demonstrate different traversal methods for trees and graphs.
8. Model problems in computer science using graphs and trees.

Exam, Assignment and Grading:

The letter grade will be determined as follows:

Assignment Policies:

• All assignments must be in the hands of the instructor before class on the due date which will be specified on each assignment. Late assignments will be accepted up to one week with a one time 20% late penalty.
• Assignments will be graded on the basis of correctness, quality of design, documentation, and style.
• Any assignment submitted without documentation or proper format will automatically receive a 20% deduction. Documentation, design, and style guidelines will be discussed as the semester progresses. No assignment will be graded which contains syntax errors.

Computer Project Documentation And Grading Guidelines:

Internal Documentation

• Program description:
• Your name
• Course and section for which your program was required
• Date completed
• Brief description of the problem solved
• Brief description of the global algorithms and data structures and files
• Assumptions or limitations of the solution
• Computer and Compiler used to complete the solution
• Class and Function description:
• An explanation of what each method accomplishes. A statement of preconditions and post conditions for imported and exported parameters. A list of any side effects (Global variables changed or accessed).
• Variable explanations:
  • Each major variable (with the exception of loop control variables) should have a brief explanation of what is being stored in the variable if not obvious from the variable name.
• Internal comments:
• Any major block of code within a procedure or the main program should have a comment identifying that task. These comments should be the major steps you developed for the algorithm in the problem-solving phase. Any algorithm, which is not obvious from the code, should have a natural language explanation of how it works.
• Demonstration of correctness:
• It is the student's responsibility to identify test data to demonstrate that the program runs correctly for the specification of the assignment. The student may also schedule a demonstration appointment with the instructor.

Grading Breakdown (May vary with different projects)

• Documentation. -- 15%
• Program design. -- 65% (breakdown may vary)
• Correctness of solution
• Modularity (proper use of classes and functions)
• Choice of Algorithm (Efficiency, Data design)
• User Interface
• Error Checking
• Demonstration of correctness (tests runs). -- 20%

Important Note on Academic Dishonesty:

Office Hours.

Attendance

Make-up exams and quizzes will not be given except by prior consent of the instructor. You must notify the instructor within 24 hours after the exam/quiz when it is missed for determination of excuse. Examples of acceptable excuses would be death of an immediate family member, or illness, requiring physician's attention. Depending on the excuse, make-up exams/quizzes will result in a loss of points.

Note to Students with Disabilities.