A.

Course Specifications

Course Name MS 101 Discrete Mathematics

Course Description
Number of Units for Lecture and
Laboratory
Number of Contact Hours per
Week
Prerequisite
Program Learning Outcome
This course provides an introduction to mathematical structures
on finite sets and the natural numbers. It also provides discussions on
basic concepts of data representations, number systems, number
system conversion, functions, relations and sets, basic logic, proof
techniques, basic counting and introduction to digital logic and digital
systems.
Lecture – 3
3 hours
MATH 1A
Apply knowledge of mathematics, science, technology fundamentals,
and a technology specialization to defined and applied
technology procedures, processes, systems, or
methodologies. In aid of systems design addressing identified
technology problems, conduct the following: identify
problems, conduct researches, investigations and
experiments, and come up with conclusions and solutions;
PLO 2. Select and apply appropriate techniques, resources, and
modern technology and IT tools, including, but not limited to,
prediction and modelling, to broadly defined technology-
related activities, with an understanding of the limitations;
PLO 3. Communicate effectively on broadly defined technology-
related activities with the technology affiliated community and
with the society at large, by being able to comprehend and
write effective reports and design documentation, make
effective presentations, and give and receive clear
instructions;
PLO 4. Demonstrate understanding of the societal, health, safety,
legal, and cultural issues and the consequent responsibilities
relevant to technology practice;
PLO 5. Understand the impact of technology solutions in a societal
and environmental context, and demonstrate knowledge of
and need for sustainable development;
PLO 6. Apply professional ethics and responsibilities and norms of
technology practice;
PLO 7. Function effectively as an individual and as a member of
diverse technical teams
PLO 8. Demonstrate knowledge and understanding of technology
principles and apply these to one's own work, as a member
and leader in a team and to manage projects in
multidisciplinary environments;
PLO 9. Recognize the need for, and have the ability to engage in
independent and lifelong learning in specialized technologies;

Course Outcome 1. To expose students with serious experience thinking about

problem solving, algorithm and writing code.
2. To get students ready several important computer science
concepts such as hashing, recursion and sorting and
searching and basic data structures.
3. Give enough computer science knowledge that students
would be able to know the motivating examples.
Course Outline  Fundamentals
 Data representation
 Number System
 Radix Conversion
  Sets and subsets
 Sequences
 Operation of sets
 Counting, sequences and subsets
 Algorithms and Psuedocode
 Proof by mathematical Induction and recursion
 Matrices
 Relations and Digraphs
 Functions
 Finite Boolean Algebra
 Trees and Languages
 Finite State Machines

Teaching / Learning Strategies  Problem Solving

 Group Discussion
 Collaborative Learning
 Multimedia
 Demonstration
Assessment Strategies  Practical Exam
 Quizzes
 Seatwork
 Problem sets
 Board works
 Final Project

ASCB Diploma in Information Technology

Page 2 of 2