College of Engineering: Manuel S. Enverga University Foundation An Autonomous University Lucena City

Document Code: CENG-F-CS
Document Title: Object-Oriented Programming 2– CPAS 221L

MANUEL S. ENVERGA UNIVERSITY FOUNDATION Page No. : Page 1 of 9
An Autonomous University Revision No.: 5
Lucena City Effectivity Date: 30 JULY 2019
Prepared by:
Ronaldo C. Maaño MT, CpE
COLLEGE OF ENGINEERING Instructor
Reviewed by:
Evangeline L. Constantino, MMEM, RCE
Department Chair
QUALITY FORM Approved by:
Guillermo M. Rago Jr. Ed.D. CE
Dean
UNIVERSITY VISION
In 2030, the Manuel S. Enverga University Foundation is a globally competitive university with high concentrations of talent, excellent teaching environment, rigorous program quality, sufficient resources, and
a culture of collaboration.
UNIVERSITY MISSION
The Manuel S. Enverga University Foundation is a private, non-stock, non-profit, non-sectarian educational foundation with a three-fold function – instruction, research and community service – offering
responsive and alternative programs supportive of national development goals and standards of global excellence.
GOAL
The Manuel S. Enverga University Foundation shall produce graduates who have research-based knowledge, leadership and managerial skills, and professionalism.
COLLEGE OF ENGINEERING VISION
The MSEUF College of Engineering shall be a globally competitive engineering institution.
COLLEGE OF ENGINEERING MISSION
The MSEUF College of Engineering shall produce competent engineers adequately prepared in the practice of their profession supportive of national development goals and standards of global excellence.
PROGRAM EDUCATIONAL OBJECTIVES MISSION

The graduates of an Engineering program shall: Instruction Research Community
Prepared by:
Reviewed by:
Department Chair
Dean
Service
1. Be effective in engineering design and the practical application of engineering theory in accordance with high standards of ethics   
2. Be effective in communication skills and exhibit teamwork.   
3. Be successfully employed or accepted into graduate programs and serve their communities, whether locally, nationally or globally.   
4. Be successful designer, manager, planner and or entrepreneur in the practice of engineering profession serving local international or global communities   
COURSE SPECIFICATION
Course Code: CPAS 221L

Object-Oriented Programming 2
Course Title:
Examines more advanced topics in object-oriented programming and demonstrate the implementation of various data structures, such as linked lists, stacks, queues
Course Description: and trees.
Prerequisite: Object-Oriented Programming 1 Co-requisite: Microprocessor System Lab

Lecture Contact/Hours per
Course Credits: 3 units 3 hours Laboratory Contact/Hours per Week: N/A
Week:
Total Contact Hours (for 18 weeks): 54 Hours
Prepared by:
Reviewed by:
Department Chair
Dean
Student Outcomes and Relationship to Program Educational Objectives:
Program Educational
Student Outcomes Objectives
1 2 3 4
a. Ability to design a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social,    
political, ethical, health and safety, manufacturability, and sustainability, in accordance with standards.
b. Ability to use techniques, skills, and modern engineering tools necessary for engineering practice.    
Course Outcomes and Relationship to Student Outcomes:
Course Outcomes
a b
After completing the course, the student must have the ability to:
1. Introduce the concepts and techniques in creating a link list. E I
2. Create and use static and dynamic stacks and queues. E I
3. Apply and use recursion in solving repetitive problems. E I
4. Explain the binary tree ADT and demonstrates many binary tree operations. E I
Level: I – Introductory Course E – Enabling Course D – Demonstrating Course

Prepared by:
Reviewed by:
Department Chair
Dean
COURSE LEARNING PLAN
EQUIPMENT, MATERIALS AND METHODS/ ASSESSMENT/ INDICATIVE

LEARNING OUTCOMES TOPICS
REFERENCES STRATEGIES EVALUATION HOURS
LO: Enhanced awareness about the Discussion of VMG and PEO Multimedia equipment Interactive discussion Q and A 1 hour
VMG and PEO as well as course
requirements Presentation of the Syllabus and Course Paper and pen Open forum
Requirements
Multimedia projector, white screen Lecture-Discussion Assignment 12 hours
LO 1.1 Enhanced ability to PART I: LINKED LISTS and speakers,
demonstrate the concepts of link list. Rubric Library Research: Quiz
 Introduction to the Linked List ADT
LO 1.2 Enhanced ability to use and  Linked List Operations Gaddis, T. (2015). Starting out with Think-Pair-Share Research Report
apply the concepts of linked list in  A Linked List Template C++: from control structures through
object-oriented programming. Hands On Activities
 Variations of the Linked List objects. 8/E. Addison-Wesley
 The STL list Container
Assignment/Research
Answer the review question

in chapter 17 from the
textbook (Gaddis)
Course Assessment: Preliminary Examination

CO1: Introduce the concepts and techniques in creating a link list.
Assessment Tools: Rubric
Lecture-Discussion
LO 2.1 Enhanced ability to PART II: STACKS AND QUEUES Multimedia projector Assignment 13 hours
demonstrate how stacks and queues Library Research:
Prepared by:
Reviewed by:
Department Chair
Dean
operates.  Introduction to the Stack and Queue ADT Gaddis, T. (2015). Starting out with Quiz
 Dynamic Stacks and Queues C++: from control structures Think-Pair-Share
LO 2.2 Enhanced ability to use and  The STL stack, deque and queue Container through objects. 8/E. Addison- Research Report
apply the operations in object-oriented Wesley Hands On Activities
programming.
Assignment/Research:
textbook (Gaddis)
Course Assessment: Midterm Examination
CO2: Create and use static and dynamic stacks and queues.
LO 3.1 Enhanced ability to describe  PART III: RECURSION Multimedia projector Lecture-Discussion 13 hours
the operation of recursion. Assignment
 Introduction to Recursion Gaddis, T. (2015). Starting out with Library Research:
LO 3.2 Strengthened ability to use and C++: from control structures through Quiz
 Solving Problems with Recursion
apply the concepts of recursion for objects. 8/E. Addison-Wesley Think-Pair-Share
solving simple arithmetic problems. Research Report
Hands On Activities
textbook (Gaddis)
CO3: Apply and use recursion in solving repetitive problems. Course Assessment: Semi-Final Examination
LEARNING OUTCOMES TOPICS EQUIPMENT, MATERIALS AND METHODS/ ASSESSMENT/ INDICATIVE
Prepared by:
Reviewed by:
Department Chair
Dean

PART IV: BINARY TREES Multimedia projector Lecture-Discussion 12 hours
LO 4.1 Enhanced ability to Assignment
describe the operations of binary trees.  Definition and Applications of Binary Trees Gaddis, T. (2015). Starting out with Library Research:
 Binary Search Tree Operations Quiz
C++: from control structures through
LO 4.2 Enhanced ability to use and  Template Considerations for Binary Think-Pair-Share
Search Trees objects. 8/E. Addison-Wesley
apply binary tree operations in object- Research Report
oriented programming. Hands On Activities
Integration of Learning
Management System
textbook (Gaddis)
CO4: Explain the binary tree ADT and demonstrates many binary tree operations. Course Assessment: Final Examination
Resit / Re-exam and submission of portfolio 1 hour
COURSE EVALUATION
Student performance will be rated based on the following:
Assessment Tasks Weight Minimum Average for
Satisfactory Performance
CO1 Assignment, Internet research, quiz, seatwork 40%
CO2 Preliminary Examination 30%
Midterm Examination 30%
100% 30%
Previous (Midterm) Grade = 100% x 40%
Prepared by:
Reviewed by:
Department Chair
Dean
CO3 Assignment, Internet research, quiz, seatwork 40%

CO4 Semi-Final Examination 30%
Final Examination 30%
45%
100% 75%
Present (Final) Grade = 100% x 60%
40% Previous Grade + 60% Present Grade = Final Grade
The following table will be used in giving the final grades:

Percentage Equivalent 74 and below 75-77 78 - 80 81-83 84-86 87-88 89-91 92-94 95-97 98-100
Final Grade 5.00 3.00 2.75 2.50 2.25 2.00 1.75 1.50 1.25 1.00
ASSESSMENT & EVALUATION OF PROGRAM/STUDENT OUTCOMES
PERFORMANCE INDICATOR: ASSESSMENT TOOL TARGETS AND STANDARDS
1. Introduce the concepts and techniques in creating a link list. ASSESSMENT RUBRIC 80% of the students shall have a rating
(75% & above – Passed)(Below 75% - Failed) of at least 75%
2. Create and use static and dynamic stacks and queues. ASSESSMENT RUBRIC 80% of the students shall have a rating
3. Apply and use recursion in solving repetitive problems. ASSESSMENT RUBRIC 80% of the students shall have a rating
4. Explain the binary tree ADT and demonstrates many binary tree operations. ASSESSMENT RUBRIC 80% of the students shall have a rating
Rubrics will be used for assessment & evaluation of program/student outcomes and other types of assessment such as return demonstration, simulation, case analysis, experiments, oral presentation, etc.
1 2 3 4 5
BEGINNING DEVELOPING APPRAISING PROFICIENCY PROFICIENT ADVANCE
(Minimal and Limited Evidence of (Some evidence of Achievement) (Adequate Evidence of Achievement) (Commendable Achievement) (Exceptional Achievement)
Achievement)
75 - 77 78 - 80 81 – 83 84 - 86 87 – 88 89 - 91 92 - 94 95 - 97 98 – 100
Aside from academic deficiency, other grounds for a failing grade are:
Prepared by:
Reviewed by:
Department Chair
Dean
1. Failing academic standing and failure to take the final examination

2. Grave misconduct other than cheating
3. Excessive absences (in excess of 20% of the total class hours)
COURSE POLICIES
a. Attendance
Attendance shall be monitored in accordance with CHED policy and the provisions of the Student Handbook.
b. Submission of Assessment Tasks

Late submission of learning activities is not allowed
c. Written Examination
There will be four major examinations – Preliminary. Mid-Term, Semi-Final, and Final Examinations – covering the intended COs. The final examination is the summative assessment of the three COs and
will have to demonstrate understanding of the course. Test booklet will be used as answer sheet in all written examinations.
d. Issuance of Mid-Term Grade

The mid-term grade is issued to students so that formal consultation where students are apprised of their class standing is done to afford them the opportunity to make up and to cope with the rigors of the
course.
e. Course Portfolio
Selected assessment tools are to be compiled and collected before the end of the semester. The selection is based on statistical data gathering (lowest, median, and highest). Learning tasks and examinations
with marks lowest, median and highest must be photocopied and returned to the Instructor/professor for course portfolio keeping.
f. Language of Instruction
Lectures, discussions and documentation will be in English. Written and spoken work may receive a lower mark if the student is deficient in English.
g. Classroom Discipline
The instructor/professor may decide on the use of electronic gadget such as cellphone, IPad/tablet, headset/phone, or earphone/pod depending on the need and circumstance. However, students are on
advisement on the use of gadget inside the classroom to avoid disruption of the lesson.
h. Honor, Dress and Grooming Codes

Prepared by:
Reviewed by:
Department Chair
Dean
Students must observe the University Dress and Grooming Code as provided in the Student Decorum of the Collegiate Student Handbook.
For this course, the Honor Code is that there will be no plagiarizing on written work and no cheating on examinations. Proper citation must be given to authors whose works were used in the preparation of
any material for this course. If a student is caught cheating on an examination, they will be given zero mark for the examination. If a student is caught cheating twice, they will be referred to the Prefect of
Discipline and be given a failing grade.
i. Consultation Schedule
Consultation schedules are announced by the Instructor/professor at the beginning of the semester. For this course, students may consult with the Instructor/Professor during the schedule posted at the
Students’ Consultation Room. It is recommended that the student set an appointment first to confirm the Instructor/Professor’s availability.
j. Resit/Re-examination
After the instructor/professor has computed the final grade of the student, and he obtains a failing grade, the student has one chance for a resit/re-examination on the schedule set by the instructor/professor.
Failure to take the resit/re-examination on the announced schedule forfeits the student’s chance.
k. Course Materials Made Available

Syllabus/Learning Guide
Handouts/lecture Notes/e-Files Guidelines, Grading Criteria
REVISION HISTORY
NO. DATE REVISIONS
0 Initial Release
1 June 02, 2014 Revised to OBE format
2 June 08, 2015 Added curriculum mapping in the content
3 December 12, 2016 Added program outcomes, course outcomes, and assessment plan in the format
4 August 1, 2018 Updated the references
5 January 11, 2019 Revised the format and included course learning outcomes for each period

College of Engineering: Manuel S. Enverga University Foundation An Autonomous University Lucena City

Uploaded by

Copyright:

Available Formats

You might also like

College of Engineering: Manuel S. Enverga University Foundation An Autonomous University Lucena City

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

College of Engineering: Manuel S. Enverga University Foundation An Autonomous University Lucena City

Uploaded by

Copyright:

Available Formats

Document Code: CENG-F-CS

Document Title: Object-Oriented Programming 2– CPAS 221L

COLLEGE OF ENGINEERING VISION

The MSEUF College of Engineering shall be a globally competitive engineering institution.

COLLEGE OF ENGINEERING MISSION

PROGRAM EDUCATIONAL OBJECTIVES MISSION

Course Code: CPAS 221L

Prerequisite: Object-Oriented Programming 1 Co-requisite: Microprocessor System Lab

Student Outcomes and Relationship to Program Educational Objectives:

Course Outcomes and Relationship to Student Outcomes:

2. Create and use static and dynamic stacks and queues. E I

3. Apply and use recursion in solving repetitive problems. E I

Level: I – Introductory Course E – Enabling Course D – Demonstrating Course

COURSE LEARNING PLAN

EQUIPMENT, MATERIALS AND METHODS/ ASSESSMENT/ INDICATIVE

Answer the review question

Course Assessment: Preliminary Examination

REFERENCES STRATEGIES EVALUATION HOURS

CO3 Assignment, Internet research, quiz, seatwork 40%

The following table will be used in giving the final grades:

1. Failing academic standing and failure to take the final examination

b. Submission of Assessment Tasks

d. Issuance of Mid-Term Grade

h. Honor, Dress and Grooming Codes

k. Course Materials Made Available

You might also like