CS 112 Syllabus

Allan Hancock College

CS 112: Fundamentals of Programming 2

Fall 2017 CRN 20554

Basic Information

Course Description

Study of object-oriented principles. Topics include classes, objects, encapsulation, interfaces, inheritance, polymorphism, algorithms (sort, search, recursion), abstract data types (lists, stacks, queues, trees), data structures, dynamic allocation, file I/O, and exceptions.

Goals

1. Understand the core concepts of object-oriented programming.
2. Understand the concepts and principles of user interface design, screen layouts and event handling.
3. Understand the concepts and performance of basic searching and sorting algorithms.
4. Understand data structures including multi-dimensional arrays, linked lists, array based lists, binary trees, and hash tables.
5. Understand and appreciate recursive programming and the difference in designing an algorithm to be recursive or iterative.
6. Understand abstract data types including sets, trees, lists, stacks, queues and maps.

Instructional Objectives (at the end of this course you should be able to)

1. Design and implement solutions to software program requirements by applying the concepts of object-oriented programming.
2. Compare and contrast object-oriented analysis and design with structured analysis and design.
3. Implement and analyze the efficiency of searching and sorting algorithms: linear search, binary search, depth/breadth first search, selection sort, insertion sort, merge sort.
4. Design and implement graphical user interfaces using a variety of class libraries including containers, components, layout managers, and event-handlers.
5. Design and implement recursive algorithms.
6. Design and implement solutions to software program requirements utilizing data structures including multi-dimensional arrays, linked lists, array based lists, binary trees, and hash tables.
7. Design and implement solutions to software program requirements utilizing abstract data types including sets, trees, lists, stacks, queues and maps.

Texts

Course Outline

1. Object-Oriented Programming: classes and objects, constructors, mutators, accessors, destructors.
2. Graphical User Interfaces: overview & design, class libraries, event-driven programming.
3. Recursion: concepts, head and tail, versus iteration, applications.
4. Data Structures: multi-dimensional arrays, linked lists, array based lists, binary trees, and hash tables.
5. Software Re-use: class inheritance, class hierarchies, polymorphism, class interfaces, class libraries.
6. Sorting Algorithms: selection sort, insertion sort, quick-sort, merge-sort.
7. Abstract Data Types: sets, trees, lists, stacks, queues and maps.
8. Problem-Solving Strategies.
9. Design and Analysis of Algorithm.
10. Search and Traversal Algorithms: linear search, binary search, breadth-first, depth-first, pre-order, post-order, in-order.

Evaluation

Point values are approximate.

Assignments

Problem sets vary considerably in terms of task. All assignments with involve programming. As is the nature of coding, each problem set will require the use of skills obtained from the previous problem set. There are no extra credit assignments for this course.

Exams

All tests are cumulative and comprehensive and will cover material from lecture, text, and other resources given in the course. The final and all midterms will be two parts. The first part is closed-note and closed-book and will be a series of true/false, multiple choice, and fill in the blank type questions. The second part will be open note and will be similar to problem sets and labs. All tests will be announced ahead of time. You must take the tests on the date given. Make up tests will only be given in unusual and verified circumstances.

Late Policy

If you feel you cannot complete the assigned task within the given timeframe I encourage you to contact me well in advance so we can come to a solution. Unless there is a compelling and verifiable reason, late work will not be accepted..

Academic Dishonesty

An individual shall not engage in any form of academic dishonesty, including but not limited to cheating, fabrication, facilitating academic dishonesty, copyright infringement, or plagiarism. An individual shall not use or attempt to use the academic work or research of another person (or agency engaged in the selling of academic materials) and represent that it is his or her own or otherwise engage in dishonest academic work. An individual shall not share his or her knowledge or work with another student during an examination, test, quiz or other academic assignment unless specifically approved in advance by the instructor. An individual shall not bring to an examination any materials or notes not approved by the instructor; nor shall the individual receive, or attempt to receive, any test response from another student during an exam or at any time unless expressly authorized by a faculty member.

The following will earn you an automatic F in the course:

• Take homework from a student in a previous semester and submit it as your own.
• Take homework from another student and submit it as your own.
• Submit code that you found online.
• Submit code that you and your friend were working on.
• Hardcoding (i.e. tailoring your program to work only under certain test cases)

All work must be original!

Attendance Policy and Other Advisories

1. It is your responsibility to drop the course if need be. The various drop deadlines can be found in AHC's class schedule.
2. It is possible that the instructor will drop you from the course if your grade is very low and if a drop date is near. Even such, never rely on the instructor to drop you. Again, dropping the course is your responsibility.
3. Assignments must be submitted on or before the date and time specified to receive credit. Late assignments will not be accepted. There are no makeup exams except in emergencies or unusual circumstances.
4. An incomplete course grade is given only for reasons acceptable to the college.
5. Plagiarism will result in all involved students being failed from the course. A report of the incident will be given to the college's Judicial Affairs department. One specific example that is completely unacceptable is copying answers from non-instructor supplied web resources.
6. After consecutive absences totaling 6% of the course hours, but not fewer than two (2) consecutive absences, or after being absent a total of 12% of the course hours, the instructor may drop a student from the course.

Student Learning Outcomes

1. Use Object-Oriented principles to model programming problems.
2. Discuss the tradeoffs of basic data structures.
3. Use recursion to solve programming problems.

Disclaimer

This syllabus is subject to modification. The instructor will communicate with students on any relevant changes.