Discrete Structures for IT

Bulacan State University
Bustos Campus

Illustration of graphs, trees, and overlapping sets in blue and gold

Hi, I am RJ Nieto, and I will be your instructor for this module.

The Course

I will use this page to share course information, lecture notes, examples, exercises and supplementary material for our Discrete Structures for IT module at Bulacan State University’s Bustos Campus.

To be clear, this is a demanding first-year course in discrete mathematics. I expect everyone to engage deeply with the material. The keys to mastering mathematics are:

  1. Practice, constant practice. Work through problems yourself and revisit the ones you find difficult.
  2. Curiosity. Ask questions, even when they sound silly to you.
  3. Diligence. Keep up with the material and work through your mistakes.

We will not be tackling Olympiad-level problems, and you do not need exceptional mathematical aptitude to do well. Think of this module as functional mathematical literacy for future IT specialists. We will work with logic, sets, functions, relations, counting, integers, induction, recursion, graphs and trees, connecting these ideas to organising records, expressing access rules and modelling networks.

This course prioritises depth over breadth. We will focus on selected topics and spend enough time on explanation, practice and feedback for you to become confident in using them. The aim is to develop lasting mathematical skills, rather than rush through a long list of topics that you only partly understand.

If you want to learn how to wrangle information, mathematics will give you the tools to do it precisely and systematically.

BulSU aims to be a globally competitive university, and I want you to take pride in your studies. Drawing on my experience at Bristol, I will expect the same independent study, careful reasoning and active participation that I encountered as a student there.

Primary textbook

Oscar Levin’s Discrete Mathematics: An Open Introduction, fourth edition, is our primary textbook. You can read it online or download the PDF for free. We will use selected sections, with supplementary examples where needed.

Open Levin’s textbook — fourth edition

Tentative course outline

The thirteen teaching weeks follow Levin’s progression through logic and proofs, graphs, counting, sequences, and sets and functions. Each chapter in our lecture notes corresponds to one teaching week; these chapter numbers are separate from Levin’s. We will study selected material within the sections listed below.

Ch. Topics Levin, fourth edition
1 Mathematical statements, predicates and quantifiers §1.1; definitions from §0.2 as needed
2 Implications, logical equivalence and valid arguments §§1.2–1.3
3 Direct proof, contrapositive and contradiction §1.4
4 Proofs about sets, functions and relations §§1.5.2–1.5.4
5 Graphs and trees §§2.1–2.2
6 Relations, their properties, equivalence classes and partitions §2.6
7 Counting outcomes: sum and product rules, inclusion–exclusion §§3.1–3.3
8 Combinations, permutations and combinatorial proofs §§3.4 and 3.6
9 Sequences: explicit and recursive descriptions, initial conditions, arithmetic and geometric sequences §§4.1–4.2
10 Ordinary (weak) mathematical induction §4.5
11 Strong induction §4.6
12 Sets and functions revisited: operations, function properties and recursive definitions §§5.1–5.2
13 Structural induction on recursively defined objects, including expressions and rooted trees Supplementary material drawing on earlier topics

There will be no coding assignments, but pseudocode may be used to explain mathematical ideas and algorithms. Recursive functions will be studied through their domains, initial values, defining rules and mathematical evaluation. Structural induction will receive a supplementary explanation and exercises.

Class format

I expect you to read ahead on the topic we will cover. You do not need to have mastered it before class, but you should come prepared to participate. I will guide you through questions rather than put you on the spot; expecting you to produce a polished answer without support would be unfair. Recitation is graded at every class meeting. Students who participate very actively will receive extra credit towards other coursework.

Each regular three-hour session is divided as follows:

Time from the start of class Activity
0:00–0:50 Problem class: we work through problems covering the previous week’s topics
0:50–1:00 Break
1:00–1:50 Lecture
1:50–2:00 Break
2:00–2:50 Lecture
2:50–3:00 Dismissal and consultations for students who wish to stay

After dismissal, I will remain in the room for questions and consultations. If nobody approaches within five minutes, I will leave. I strongly encourage you to ask questions. If a question occurs to you later, you can email me at rj [at] rjnieto [dot] com.

Assessment

Component Weight
Midterm examination 20%
Final examination 20%
Long Test 1 10%
Long Test 2 10%
Problem sets: best three of four, at 5% each 15%
Participation and recitation 20%
Promptness and attendance 5%
Total 100%

There will be four problem sets. Your three highest percentage scores will each contribute 5% of your course mark; the lowest score will be excluded.

Final examination exemption: In this course, students with a pre-final grade of 1.50 or better who have completed all subject requirements may choose not to take the final examination. This exemption is offered in accordance with the BulSU Undergraduate Student Manual, Part II, Section J.5.

Logistics

Course title: Discrete Structures for IT
Course number: IT 107
Programme: BS Information Technology, Year 1
Term: Second Semester, A.Y. 2026–2027
Last day to drop subjects: 22 January 2027
Class meetings: Saturdays, one three-hour session per week
Instructor: Rey Joseph Nieto
Email: rj [at] rjnieto [dot] com (for course-related enquiries)

Saturday Teaching Week / status Assessment
21 November 2026 Teaching Week: Chapter 1 —
28 November 2026 Teaching Week: Chapter 2 —
5 December 2026 Teaching Week: Chapter 3 Problem Set 1 due
12 December 2026 Teaching Week: Chapter 4 —
19 December 2026 Teaching Week: Chapter 5 Problem Set 2 due
26 December 2026 No classes — Christmas break —
2 January 2027 No classes — Christmas break —
9 January 2027 Teaching Week: Chapter 6 —
16 January 2027 Teaching Week: Chapter 7 Long Test 1
23 January 2027 No classes — First Philippine Republic anniversary, assumed holiday —
30 January 2027 No regular classes — midterm examination Midterm examination
6 February 2027 No classes — Chinese New Year —
13 February 2027 Teaching Week: Chapter 8 —
20 February 2027 Teaching Week: Chapter 9 Problem Set 3 due
27 February 2027 Teaching Week: Chapter 10 —
6 March 2027 Teaching Week: Chapter 11 Problem Set 4 due
13 March 2027 Teaching Week: Chapter 12 —
20 March 2027 Teaching Week: Chapter 13 Long Test 2
27 March 2027 No classes — Black Saturday —
3 April 2027 No regular classes — final examination Final examination

Printable lecture notes

Lecture notes are in preparation. They will draw primarily on Levin’s textbook, with worked examples and exercises suited to this class and supplementary explanations where needed. PDFs will be added here as they become available.

Problem sets

Problem sets and supplementary exercises will be added here as they become available.

Course policies

These class arrangements should be read alongside the BulSU Undergraduate Student Manual (Part II, Sections F–G and J–L) and the Enhanced Guidelines on Student Conduct, Discipline, and Grievance Intervention, which BulSU identifies as approved under BOR Resolution No. 34, series of 2022. The approved syllabus and applicable university policies take precedence over these class arrangements.

NoteRespect for learning

There is room for humour in this class—you can even joke about me, and I will happily laugh along. But please take the subject seriously. Making a mistake or struggling to understand is part of learning; treating a lack of understanding as something to celebrate is another matter. Take pride in your studies, respect the effort your classmates put into learning, and give the course content the attention it deserves.

  1. Electronic devices: Phones and other personal electronic devices must be switched off and put away during class. Approved accessibility arrangements and university-required exceptions take precedence.

    Bring a notebook, paper and a pen or pencil to every class. Use your eyes to follow the mathematics, your ears to listen to the explanation, and your hand to work through it. The lecture notes will provide a skeleton; add your own explanations, worked solutions and observations during class.

  2. Photo: Please bring a recent 1×1 photo to our first class so I can identify you when recording attendance.

  3. Seating: We will use a fixed seating plan to help me record attendance and class recitation.

  4. Attention and classroom conduct: We meet only once a week for three hours, so each session can be more demanding than shorter classes spread across the week. I expect everyone to listen carefully and stay focused, even when the material gets difficult. If you are struggling to follow, please interrupt me and ask, or raise your questions during consultations. Disruptive chatting, excessive noise, and other misbehaviour are unacceptable and will be addressed through the university’s prescribed disciplinary procedures. Participation marks follow the approved assessment criteria. I am preparing you for life beyond university, where discipline matters.

  5. Coursework and deadlines: Submit coursework by the stated deadline. Work not submitted by the deadline receives zero marks, unless an excused absence or another university-approved arrangement applies. An unexcused absence does not extend a deadline or entitle you to a make-up assessment. Work submitted on time is assessed under the published criteria.

  6. Attendance and punctuality: Attend regularly and arrive on time. Under the handbook, arrival 15 minutes after the scheduled start is recorded as tardy, and arrival 20 minutes after the start is recorded as absent. Being marked absent does not prevent you from attending the lesson. Unexcused absences exceeding 20% of required class time before midterms trigger automatic dropping, recorded as FDA (failure due to absences) or UD (unofficially dropped). My course policy allows a maximum of three unexcused absences, subject to university attendance rules. Given the pace of this course, I strongly recommend perfect attendance. The official attendance calculation uses the required semester contact hours, and the count does not reset after midterms. Attendance classifications and grades follow university rules; FDA/UD and a numerical grade of 5.0 are distinct classifications.

  7. Missed examinations: If you miss an examination for an excused reason, contact me promptly with supporting documentation. Special examinations require the instructor’s recommendation and the unit head’s approval under Part II, Section J. Your final examination is not automatically double-weighted. An unexcused missed examination receives zero marks under the course assessment arrangements, subject to applicable university policies.

  8. Excused absences: The handbook recognises official university representation, medically certified sickness, and force majeure as excused reasons. Notify me promptly and provide the relevant documentation. An excused absence does not waive coursework requirements; arrange to complete any missed work. The handbook also sets a 30% limit on excused absences.

  9. Assessment and concerns: Assessment components, weights, and marking criteria follow the approved syllabus. You may ask how your marks were calculated and request a review of your class standing. Raise concerns with me or use the university’s student grievance procedure.

  10. Borderline marks: I may extend consideration to students with borderline failing marks who have perfect attendance, where permitted by the approved assessment rules. This is discretionary and does not guarantee a passing grade or waive academic requirements.

  11. Use of AI: I strongly encourage you to use AI for revision, but not to solve your problem sets. If AI does the work for you, you are likely to fail the midterm and final examinations, which use zero-based grading.

Course-specific arrangements and updates will be communicated through official class channels.

About me

I graduated with a BSc in Mathematics with first-class honours from the University of Bristol in the United Kingdom. My interests lie in applying probability, topological data analysis, artificial intelligence and machine learning, network science, and combinatorics to problems in healthcare, industry, and public policy.

In the previous semester, I taught Mathematics in the Modern World and Living in the IT Era at Bulacan State University’s San Rafael Campus. Before that, I was a teaching assistant for Mathematical Programming at the University of Bristol.

During weekdays, I serve as an Assistant Secretary at the Office of the Cabinet Secretary in the Office of the President, Government of the Philippines. My work includes policy analytics, where I use mathematical methods, among other tools, to assess the feasibility and reasonableness of proposed and existing government policies. On Saturdays, I teach you. In what little spare time I have, I catch Pokémon.

Pikachu smiling and winking

You can call me RJ, Kuya RJ, or Sir—though “Sir” sounds a little icky because I have not been knighted by King Charles. Call me Tito RJ or Daddy RJ and I will automatically fail you. But seriously, just call me RJ (no honorifics), and that’s totally fine.

Back to top