CS 372 - Advanced Programming and Algorithms: Syllabus

Instructor Information

Refer to Discussion Forum, Facilitator Introduction and Expectations

Course Title

CS 372 - Advanced Programming and Algorithms

Course Description

CS372 – ADVANCED PROGRAMMING AND ALGORITHMS (3). Develops advanced programming skills. Presents advanced features of program design and analysis, group programming, and large projects design and implementation. Introduces analysis of computer algorithms from an efficiency point of view.

Prerequisite Courses

CS208 Computer Science Fundamentals and CS362 Data Structures

In order to successfully participate in this course, students are expected to have completed the course prerequisites. The prerequisites for CS372 are CS208 and CS362, and the prerequisite for CS362 is CS361. Therefore, students must have completed CS208, CS361 and CS362 (or their equivalents) and have a working knowledge of the following topics within each course:

1. Practice with problem definition, solution construction and algorithmic development using top-down design techniques (CS208/CS361/CS362).
2. Ability to implement code with C++ control structures used for decisions and iteration, including: if, while, do-while, for, and switch (CS361).
3. Understanding of modular code design with C++ functions, and proper parameter passing, using both pass-by-value and pass-by-reference (CS361/CS362).
4. Practice with using files to store and access data (CS362).
5. Ability to implement code with C++ data structures, including: enumerated types, arrays, structures/records, and linked lists, and the ability to choose appropriate data structures to store data for a particular programming problem (CS362).

Course Overview

The previous two programming courses (CS361 and CS362) showed how to use various control structures (if-then, while-do, functions, etc) to control the flow of the program and how to use various data structures (enumerated types, arrays, records, linked lists, etc) to store program data.

This course will explore several additional aspects of programming. The new concepts to be covered in CS372 are:

• Further expansion of your programming skills
• An introduction to Algorithm Analysis
• Searching and Sorting methods
• An introduction to Binary Trees
• Team Program Development and Implementation

CS372 is challenging and covers a substantial amount of material at a rapid pace. The only way to succeed in programming is to practice. Programming can require a significant amount of time each week. There will also be team projects in this course, which will demand timeliness. If you are not willing or able to spend the necessary time for programming and team coordination, please reconsider whether this is the correct time to attend this class.

Course Outcomes

Upon completion of this course, learners should be able to:

1. Describe operations on and common applications for linked lists, hash tables, binary search trees, stacks, and queues, and implement them in a high-level programming language.
2. Explain the use of big-O notation to describe the amount of work done by an algorithm and to determine the bounds on time complexity.
3. Compare and contrast various searching methods and their computational efficiencies, and design and implement a hashing function and hash table collision-resolution algorithm appropriate to a specific search application.
4. Describe and implement the most common quadratic and O(N log N) sorting algorithms, including selection, insertion, bubble, shell, merge and quick sorts, and compare their computational efficiencies and relative advantages.
5. Discuss factors other than computational efficiency that influence the choice of algorithms, and be able to evaluate, select and justify the selection of appropriate algorithms for a common programming problem.
6. Describe the divide-and-conquer approach, and implement, test and debug recursive algorithms to solve programming problems.
7. As a team member, work effectively to design and implement a programming solution, and demonstrate the central elements of team building and team management.

Course Materials

Required Texts

Malik, D.S. (2010). Data Structures using C++ ( 2nd edition). Boston, MA: Course Technology; ISBN-13: 978-0-324-78201-1.

Technology Tools

1. A PC-compatible computer system running an MS Windows operating system.

2. A C++ Compiler -- the preferred compiler is the free Dev-C++ compiler The newest version of Dev-C++ (Orwell), can be downloaded from: http://sourceforge.net/projects/orwelldevcpp/files/Setup%20Releases/ Download the most recent version:
Dev-Cpp x.x.x MinGW x.x.x Setup.exe (32-bit version)
OR
Dev-Cpp x.x.x TDM-GCC x64 x.x.x Setup.exe (64-bit version)

WARNING: If you had an older version loaded on your computer from an earlier class, such as the Bloodshed Dev-C++ compiler, you must uninstall it before installing the newer version.

Other ANSI standard C++ compilers can be used, but the facilitator will be most familiar with the Dev-C++ compiler listed above, and will most likely use the Dev-C++ compiler to grade your programs. If a student chooses to use another compiler, it is the student's responsibility to obtain any help needed to use the software, and to insure that all assigned programs compile and run correctly on the Dev-C++ compiler. For team projects, the Dev C++ compiler will be the default, unless all team members agree on using another compiler.

As with most of Regis learning activities, using various software applications to accomplish assignments requires students to exercise a great deal of responsibility for learning how to successfully operate the software applications. This class assumes a working knowledge of the C++ compiler from CS362. There are, however, many quality books on the market that support novice users if a student needs them.

technical specifications

Pre-Assignment

Students will be prepared to ask questions on unclear areas and to respond to questions about information in the assigned reading for week 1 (listed in grid on next page).

Online Format: Sign on to worldclass.regis.edu and become familiar with the course navigation of the Web Curriculum. Complete assignments above.

Classroom-based Format: Complete assignments above by the first night of class.

Course Assignments and Activities

Summary of Assignments and Percentage Weight:

Course Policies and Procedures

Programming Assignments

Each programming assignment will involve designing and writing a program, using the concepts discussed in the book and class, and may also include submission of analyses, teammate evaluations, structure charts, test data and/or test plans. Note: Programs that do not compile, are not modular, or that use any global variables, will NOT be accepted.

One of the goals of this class is to learn how to design and implement a program as part of a programming team. Therefore, some of your assignments will be team-programming assignments. Note that although students will work in teams, the grades will be individual.

CS372 Late policies Due to the requirement to forms teams in this class, there will be a strict adherence to the late policy. Programming assignments will be graded, and then 2% will be deducted for each day the assignment is late, up to the maximum allowed. Programming assignments turned in more than 1 day late (for assns 1-3) or 4 days late (for assns 4-5) will be given a grade of zero, and no feedback will be given.

Exams

There will be a midterm exam and a final exam. Exam questions will be cumulative, taken from reading assignments and course content. Exams will not be accepted late.

Adding this course during the Drop/Add Period

If you added this course during the drop/add period, after class began on Monday, you are responsible for immediately notifying the instructor that you joined the course late. None of the course due dates will be extended for you. Even if a due date already passed when you added the course, late points will still be deducted.

Repeating the course

If you are repeating this course (due to a previous withdraw or low grade), you are responsible for immediately notifying the instructor. Course assignments that you submitted when you last took the course cannot be repeated -- you will be required to complete alternate assignments.

Plagiarism

Plagiarism includes submitting code or anything else that was obtained from any other person, publication, or any internet web source. All individual assignments submitted in CS372 must be your own. And team assignments must be the work of the team member only.

In cases of suspected cheating or plagiarism, the instructor will discuss the matter with the student(s) involved. The instructor reserves the right to question any student orally or in writing about any assignment, and to use the evaluation of the student's understanding of the assignment and of the submitted solution as evidence of cheating. All cheating incidents will be reported to the Computer Science department, and may also be reported to the Academic Integrity Board for further action.

CCIS Policies

Review the CCIS Policies on the Regis University website.

OTHER INFORMATION

NOTE TO LEARNERS: On occasion, the course facilitator may, at his or her discretion, alter the Learning Activities shown in this Syllabus. The alteration of Learning Activities may not, in any way, change the Learner Outcomes or the grading scale for this course as contained in this syllabus. Examples of circumstances that could justify alterations in Learning Activities could include number of learners in the course; compelling current events; special facilitator experience or expertise; or unanticipated disruptions to class session schedule.