Course Description;

Design and implementation of larger projects using object-oriented software engineering principles with emphasis on definition and use of data structures including: arrays, stacks, queues, linked lists, trees, hash tables, dictionaries, sets and graphs. Standard methods are used for sorting, searching and analyzing the relative efficiency of algorithms (Big-O notation). This course conforms to the ACM CS2 standards.

Transfer Credit: CSU , UC

Prerequisite;

COMP 250 with a grade of C or better

Required Text;

Malik, D.S., C++ Programming: Program Design Including Data Structures, 7^th ed., Cengage Learning, 2015

Recommended Text;

Savitch, W., Absolute C++, 5^th ed., Pearson, 2012

Stroustrup, B., Programming: Principles and Practice Using C++, Addison, 2014

Student Learning Outcome;

Upon successful completion of COMP 252, a student will meet the following outcomes:

1. Apply object-oriented programming techniques to the implementation of the following data structures: arrays, records, strings, linked lists, stacks, queues, and hash tables
2. Implement, test, and debug simple recursive functions and procedures
3. Evaluate tradeoffs in lifetime management (reference counting vs. garbage collection)
4. Explain how abstraction mechanisms support the creation of reusable software components, and compare and contrast object-oriented analysis and design with structured analysis and design

Course Requirements;

Content Delivery;

Content will be delivered in a mix of traditional lecture format, out of class reading assignments, online resources, and some pre-recorded instructional videos. Videos are to be watched prior to class and group work will be given to practice the concepts covered in the video. Video/classwork schedules will be announced ahead of time.

Outside Work;

There will be plenty of outside hours required to succeed in this course. Work on the homework and projects will require you to spend time problem solving and programming outside of class. Identify a computer you can install some of the tools on and work from. Contact department chair if you need to make arrangements to use a computer lab to do work.

Homework;

Homework sets will be assigned roughly weekly or every two or three weeks depending on the length of the assignment.

Extra Credit;

There is no extra credit available in this course.

Projects;

There will be one or two projects over the semester. Some of these will be done individually while some of them will be group projects. All projects will require submission of source code, program output, and a short write-up reflecting on the process and outcomes. Details of each project and associated requirements will be given later.

Attendance Policy;

Students are required to attend all class sessions. A roll call attendance will happen about mid-time into the class meeting and will register students attendance.

Students are required to actively participate in class discussions, lecture feedbacks, and activities. attendance without participation will bot grant students any points.

Students who miss more than 2 consecutive sessions will be dropped from the class.

Exams;

Two exams will be given during the semester, exams will be taken in person on campus on a class meeting session . If you cannot make the in-person exam you may have the exam proctored by the learning center at an alternate time. You must make arrangements with me on which testing center it is, I will make the approval. Make-up tests will not be given unless prior arrangements have been made. The Final Examination (30% of the semester grade) will be taken in person (or proctored as listed above) and is comprehensive.

Grading Methods

Every module (week) comes with the following graded activities:

1. Practice codes, home-works (5-20 points each)
2. Module quiz (15-30 points each)
3. Participation (5 points)

Students earn those points as they go through the course.

Final exam carries 250 points.

Office Hours

Instructor's office hour are "1 hour before the scheduled start time of the class within the same room as the class meeting happens".

Academic Integrity;

The work you submit/present must be your own. However, you will be encouraged to work together on HW assignments and especially collaborative team-based projects. That being said, any work you submit you should be able to completely explain to me or another colleague. Said another way, you are responsible for gaining an understanding of all work you submit including any work your partner is in charge of on collaborative projects. Exams are to be taken individually; DO NOT COPY the work of another student on an exam under any circumstances. I WILL FIND OUT. The College Student Handbook has a complete statement defining cheating and plagiarism, available online. If you are caught cheating or plagiarizing another person’s work, you will be disciplined in one or more of the following ways:

1. You will be given a score of 0 on the assignment;
2. You may be referred to the College Disciplinarian for further sanctions which range from a warning to expulsion from Skyline College.

Please note, if you have any questions about appropriate ways to cite sources or if you are unsure how to incorporate your own ideas with ideas you read, please ask.

Extra Credit;

There will be NO standalone extra credit work offered in this course. However, if one submits an outstanding project or work that shows deep understanding of the subject and hard work of the student, up to 25% of the extra credit may be assigned to that very same work.

Means of communication;

To avoid missing important messages from your instructors and from the college/District, please activate your student email account by logging in at http://my.smccd.edu/ if you have not already done so. Messages regarding your registration status, as well as other necessary information, will be sent to you through this means of communication. I will use your school email address via CANVAS to communicate with you. You should send me your messages via canvas messaging system. note that DIRECT EMAILS WILL NOT BE RESPONDED.

Accommodation;

If you have a disability that may affect your academic experience and are seeking accommodations, it is your responsibility to inform Disability Resource Center (DRC) as soon as possible. Please contact the Disability Resource Center office; reasonable accommodation will be provided for eligible students with disabilities. In coordination with the Disability Resource Center office, reasonable accommodation will be provided for eligible students with disabilities. For more assistance, please contact the DRC Bldg 5, Room 5132 or call 650-738-4228.

Content Schedule

Every single week includes: Lecture, Practice code, Quiz, Homework that are related to that single module. Final Examination will be comprehensively covering all the material covered in course. Instructor reserves the right to change the schedule at any time without prior notice.

• Week 1
  • Classes and Abstraction
• Week 2
  • Inheritance and Composition
• Week 3
  • Pointers, Classes, Virtual Functions, Abstract Classes, and Lists
• Week 4
  • Overloading and Templates
• Week 5
  • Exception handling
• Week 6
  • Software Development Project Management
• Week 7
  • Linked Lists - Introduction and Basics
• Week 8
  • Linked Lists - Advances
• Week 9
  • Staks
• Week 10
  • Queues
• Week 11
  • Search algorithms: linear, binary, performance metrics, Big-O notation
• Week 12
  • Sort algorithms: bubble, list, quick, merge, performance metrics
• Week 13
  • Sort algorithms: quick, merge, performance metrics
• Week 14
  • Binary Trees
• Week 15
  • Advanced Search Algorithm
• Week 16
  • Graphs and Algorithm
• Week 17
  • Final Exam