0 CPE105 ORIENTATION.ppsx

1. CPE Orientation

2. Malayan Colleges Laguna
shall be a global steeple
of excellence in
professional education
and research.
MCL Vision

3. MCL MISSION
1. To provide the learning environment
that would transform our students into
globally competitive professionals
2. To produce social wealth from the
generation of new knowledge;
3.To contribute to the solution of
industry’s and society’s problems by the
expert application of knowledge

4. 1. Graduates of computer engineering program
will have the technical skills and professional
qualifications to become competent engineers
who can support the industry, academe, or
government.
2 .Graduates of computer engineering program
will be collaborators and innovators in the field,
leading or participating in efforts to address social,
technical, ethical and business challenges.
3. Graduates of computer engineering program
will be engaged in life-long learning and
professional development.
Program Educational Objectives

5. The Bachelor of Science in Computer Engineering
program provides students with the required skills
and competencies needed in the field of computer,
communication and information technology. The
program will help develop fundamental
understanding of computer engineering, its
applications and its underlying concepts.
Graduates are expected to understand computer
hardware and software and their interdependencies
as computer engineering focuses on the areas of
digital systems, computer architecture,
microprocessors, computer programming using
machine level and high level languages, data
communications, computer networks and operating
systems, among others.
COMPUTER ENGINEERING

6. STUDENT OUTCOMES (S0)
Graduates of the Bachelor of Science in Computer
Engineering program are expected to demonstrate:
a) Ability to apply knowledge of mathematics and science to
solve engineering problems
b) Ability to design and conduct experiments, as well as to
analyze and interpret data
c) 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
d) Ability to function on multidisciplinary teams
e) Ability to identify, formulate, and solve engineering
problems

7. STUDENT OUTCOMES (S0)
f) Understanding of professional and ethical responsibility
g) Ability to communicate effectively
h) Broad education to understand the impact of engineering
solutions in a global, economic, environmental, and
societal context
i) Recognition of the need for, and an ability to engage in life-
long learning
j) Knowledge of contemporary issues
k) Ability to use techniques, skills, and modern engineering
tools necessary for engineering practice
l) Knowledge and understanding of engineering and
management principles as a member and leader in a team,
to manage projects and in multidisciplinary environments

8. This course deals with discrete
elements that uses algebra and
arithmetic involving concepts and
applications of logic, sets, proofs,
functions, sequences, integers, sums,
matrices, and algorithms, number
theory, cryptography, counting
techniques, induction, recursion,
discrete probability, relations, group
theory, trees, boolean algebra and
introduction to modeling computations.
COURSE DESCRIPTION

9. At the minimum, a student completing this
course should be able to:
1. Explain the basic concepts, fundamentals
and terminologies of discrete elements.
[SOa, SOg, SOi]
2. Apply discrete mathematical theories and
principles as a tool in improving reasoning
and problem solving capability. [SOa,
SOe,SOg,SOi, SOj, SOk]
COURSE OUTCOMES

10. COURSE OUTLINE
WEEK
NO.*
TOPIC LEARNING OBJECTIVES
1
MCL MISSION / VISION
COURSE ORIENTATION
 State the MCL mission/vision and the central
objectives of the course.
 State the requirements, policies, and grading
system of the course.
 Explain the relevance of the course to the
students’ future career
Logic, Sets, Proofs and
Functions
Discuss logic, set, proof and function terminologies and
its corresponding applications. (CO1, CO2)
2 Sequences, Integers, Sums,
Matrices, and Algorithms
Solve problems by applying principles of sequences,
integers, sums, matrices, and algorithms. (CO1, CO2)
3
Number Theory and
Cryptography
Illustrate number theory and cryptography concepts
and applications. (CO1, CO2)
4 PRELIMINARY COURSE ASSESSMENT

11. COURSE OUTLINE
WEEK
NO.*
TOPIC LEARNING OBJECTIVES
5
Counting Techniques ,
Induction, Recursion and
Discrete Probability
Employ counting techniques, induction, recursion and
discrete probability principles. (CO1, CO2)
6 Relations Explain relations types and closure, partial orderings
and equivalence classes. (CO1, CO2)
7
Group Theory Relate group theory and axioms, closure and
associativity, subgroups, identity and inverse existence,
burnside theorem, cyclic and permutation groups.
(CO1, CO2)
8 MIDTERM COURSE ASSESSMENT

12. COURSE OUTLINE
WEEK
NO.*
TOPIC LEARNING OBJECTIVES
9
Graph theory Summarize graph theory covering diagraph, hasse
diagrams, lattices, bipartite graphs, graph properties,
connected graphs, planarity, graph coloring, different
path in graph and graph matrices. (CO1, CO2)
Trees
Illustrate tree properties, cycles, tree traversal,
spanning trees, prefix, postfix and infix notations. (CO1,
CO2)
10
Boolean Algebra and
Introduction to Modeling
Computations
Explain boolean algebra and functions, karnaugh maps,
gates interconversion, prime implicants and essentials,
minimization of boolean functions and finite state
automation. (CO1,CO2)
11
Graph theory Summarize graph theory covering diagraph, hasse
diagrams, lattices, bipartite graphs, graph properties,
connected graphs, planarity, graph coloring, different
path in graph and graph matrices. (CO1, CO2)
12 FINAL COURSE ASSESSMENT

13. COURSE EVALUATION
PRELIMINARY COURSE ASSESSMENT 20%
MIDTERM COURSE ASSESSMENT 20%
FINAL COURSE ASSESSMENT 20%
LEARNING TASKS 10%
QUIZZES 30%

14. COURSE REFERENCES
Velleman, Daniel J. (2006). How to prove it: a structured approach,2nd,
Cambridge University Press
Ensley, Douglas E.; Crawley, J. Winston(2006). Discrete mathematics:
mathematical reasoning and proof with puzzles, patterns, and games, John
Wiley
Cupillari, Antonella (2005).The nuts and bolts of proofs, 3rd, Elsevier
Dossey, John A. [et. al.] (2006).Discrete mathematics, 5th, Pearson Addison-
Wesley
Goodaire, Edgar G.; Parmenter, Michael M.(2006).Discrete mathematics with
graph theory, 3rd, Pearson Prentice Hall
Rosen, Kenneth H.(2007).Discrete mathematics and its applications, 6th,
McGraw-Hill
Haggard, Gary ;Schlipf, John ; Whitesides, Sue (2006).Discrete mathematics
for computer science, Thomson Brooks/Cole
Haggard, Gary ;Schlipf, John ; Whitesides, Sue (2006).Student solutions
manual for Discrete mathematics for computer science, Thomson Brooks/Cole
Staff of Research and Education Association (2007).The finite & discrete math
problem solver : a complete solution guide to any textbook, Research and
Education Association

15. COURSE REFERENCES
Das, M.K. (2007).Discrete mathematical structures : for computer scientists and
engineers, Alpha Science International
Veerarajan, T. (2007). Discrete mathematics : with graph theory and
combinatorics, Tata McGraw-Hill
Brown, James Ward; Churchill, Ruel V. (2009). Complex variables and
applications, 8th, McGraw-Hill Higher Education
Chu, Eleanor (2008). Discrete and continuous fourier transforms : analysis,
applications and fast algorithms, CRC Press
Belcastro, Sarah-Marie (2012).Discrete mathematics with ducks , CRC
Press
Rosen, Kenneth H. (2013). Discrete mathematics and its applications, 7th,
McGraw-Hill
Haggard, Gary ;Schlipf, John ; Whitesides, Sue (2011). Discrete mathematics
for engineers and scientists, Cengage Learning Asia Pte Ltd.