Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
3BBM205DISCRETE STRUCTURES3+0+03506.09.2024

 
Course Details
Language of Instruction English
Level of Course Unit Bachelor's Degree
Department / Program COMPUTER ENGINEERING
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course The aim of the course is to provide the students with basic knowledge and skills in discrete mathematics needed in the IT field.
Course Content Logic and Proofs, Relations, Functions, Counting Rules, Algorithms, Recurrence Relations, Graphs, Discrete Probability, Modular Arithmetic
Course Methods and Techniques Lecture, Discussion, Questions and Answer, Drill and Practice, Problem Solving
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Associate Prof.Dr. Lale Özkahya
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources ? Discrete Mathematics and Its Applications, 7th Edition, Kenneth H. Rosen. ? Mathematics for Computer Science, Eric Lehman and Tom Leighton, 2004
Course Notes Discrete Mathematics and Its Applications, 7th Edition, Kenneth H. Rosen.
Mathematics for Computer Science, Eric Lehman and Tom Leighton, 2004


Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Midterm Exam 2 % 60
Final examination 1 % 40
Total
3
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Hours for off-the-c.r.stud 14 2 28
Assignments 14 2 28
Field Work 15 1 15
Preparation for Midterm Exam 2 11 22
General Exam Preparation 1 15 15
Total Work Load   Number of ECTS Credits 5 150

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Use logical methods and desribe proof techniques
2 Describe recurrence relations and use recurrence relations with algorithms
3 Classify graphs and describe main concepts related to structures of graphs
4 Apply the rules of modular arithmetic and number theory
5 Apply probabilistic rules on discrete structures
6
7
8

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Logic: Propositional logic, predicates and quantifiers, logical reasoning
2 Proof techniques
3 Method of induction
4 Recursion: Definition, solving recursive equations
5 Counting: Basic rules
6 Counting: Pigeonhole principle, permutations and combinations
7 Midterm Exam
8 Arithmetic modulo m, primes and greatest common divisors
9 Introduction to discrete probability, events, conditional probability, Bayes? rule
10 Random variables, expectation and important distributions
11 Graph terminology and graph isomorphism
12 Connectivity, Euler and Hamilton paths, planar graphs, graph coloring
13 Matchings and maximum matchings in graphs
14 Special Topics
15 Final Exam Preparation
16 Final Exam

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12
All 5 4 3 3 2 3 3 3 2 2 2
C1
C2
C3
C4
C5
C6
C7
C8

  Contribution: 1: Very Slight 2:Slight 3:Moderate 4:Significant 5:Very Significant

  
  https://bilsis.hacettepe.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=2687409&lang=en