VILLAMOR, Maureen M.

This course introduces the foundations of discrete mathematics as they apply to computer science focusing on providing a solid theoretical foundation for further work. Topics include sets, functions, relations, propositional and predicate logic, basic of counting, and introduction to graphs and trees.

 Discrete mathematics involves the study of objects, which are separated or spaced apart from each other. For example, finite sets and the set of integers are discrete sets, while the set of real numbers would be considered to be a continuous, or non-discrete, set of objects.

 Through this course, students will be expected to develop mathematical experience and maturity in dealing with mathematical concepts as they will be prepared for higher level mathematics and more complex concepts in computer science

This course covers the fundamental concepts of automata theory, which refers to the mathematical study of computing machines and their capabilities, under which we have the finite automata, deterministic and nondeterministic finite automata and pushdown automata.  It also covers formal languages covering regular grammars and expressions and  context-free grammars.

The expectation to write well is inevitable, whether it will be for writing a paper for a course requirement, conceptualizing your research proposal, generating your thesis chapters, and a lot more where a student expects to write. Publishing a paper is a long and difficult process because it takes a lot of research work and documenting.  In this course, computer science students will be taught how to write a publishable paper.  It is the goal of this course to demystify the process of writing for publication so that our computer science graduates will not only excel in the practical side of computer science but will also possibly have a flourishing career in research and publication.