ACADEMICS
Course Details

ELE109 - Discrete Structures and Algorithms

2022-2023 Fall term information
The course is open this term
Supervisor(s)
Name Surname Position Section
Res.Asst.Dr. Gürhan Bulu Supervisor 21
Asst.Prof.Dr. Barış Yüksekkaya Supervisor 22
Weekly Schedule by Sections
Section Day, Hours, Place
21 Wednesday, 13:00 - 15:45, E7
22 Wednesday, 13:00 - 15:45, E3

Timing data are obtained using weekly schedule program tables. To make sure whether the course is cancelled or time-shifted for a specific week one should consult the supervisor and/or follow the announcements.

ELE109 - Discrete Structures and Algorithms
Program Theoretıcal hours Practical hours Local credit ECTS credit
Undergraduate 3 0 3 6
Obligation : Must
Prerequisite courses : -
Concurrent courses : -
Delivery modes : Face to face
Learning and teaching strategies : Lecture; Question and Answer; Problem Solving
Course objective : To give the foundations of mathematical reasoning, combinatorial analysis, discrete structures, and algorithmic thinking necessary for computation in electrical and electronic engineering.
Learning outcomes : A student who completes the course successfully; 1. Understands and uses the basic principles of mathematical logic; 2. Makes proofs in discrete structures; 3. Understands the nature of computational problems, develops solutions and algorithms; 4. Understands and applies basic information about sets, data relations, graphs, and trees used in solving engineering problems.
Course content : 1. Foundations of logic; 2. Foundations of proofs; 3. Sets, Functions, Sequences, Sums, and Matrices; 4. Algorithms and Complexity; 5. Number Theory; 6. Induction and Recursion; 7. Counting; 8. Recurrence Relations, Inclusion-Exclusion; 9. Relations 10. Graphs and graph models; 11. Shortest-path problems on graphs; 12. Trees and applications; 13. Tree traversal, spanning trees
References : Discrete Mathematics and Its Applications, Eighth Edition, Kenneth H. Rosen
Course Outline Weekly
Weeks Topics
1 Foundations of logic
2 Foundations of proofs
3 Sets, Functions, Sequences, Sums, and Matrices
4 Algorithms
5 Number Theory
6 Induction and Recursion
7 Counting
8 Midterm
9 Inclusion-Exclusion
10 Relations
11 Graphs and graph models
12 Shortest-path problems on graphs
13 Trees and applications
14 Tree traversal, spanning trees
15 Preparation for the final exam
16 Final exam
Assessment Methods
Course activities Number Percentage
Attendance 0 0
Laboratory 0 0
Application 0 0
Field activities 0 0
Specific practical training 0 0
Assignments 0 0
Presentation 0 0
Project 0 0
Seminar 0 0
Quiz 4 20
Midterms 1 40
Final exam 1 40
Total 100
Percentage of semester activities contributing grade success 60
Percentage of final exam contributing grade success 40
Total 100
Workload and ECTS Calculation
Course activities Number Duration (hours) Total workload
Course Duration 14 3 42
Laboratory 0 0 0
Application 0 0 0
Specific practical training 0 0 0
Field activities 0 0 0
Study Hours Out of Class (Preliminary work, reinforcement, etc.) 14 3 42
Presentation / Seminar Preparation 0 0 0
Project 0 0 0
Homework assignment 0 0 0
Quiz 4 6 24
Midterms (Study Duration) 1 30 30
Final Exam (Study duration) 1 40 40
Total workload 34 82 178
Matrix Of The Course Learning Outcomes Versus Program Outcomes
Key learning outcomes Contribution level
1 2 3 4 5
1. Possesses the theoretical and practical knowledge required in Electrical and Electronics Engineering discipline.
2. Utilizes his/her theoretical and practical knowledge in the fields of mathematics, science and electrical and electronics engineering towards finding engineering solutions.
3. Determines and defines a problem in electrical and electronics engineering, then models and solves it by applying the appropriate analytical or numerical methods.
4. Designs a system under realistic constraints using modern methods and tools.
5. Designs and performs an experiment, analyzes and interprets the results.
6. Possesses the necessary qualifications to carry out interdisciplinary work either individually or as a team member.
7. Accesses information, performs literature search, uses databases and other knowledge sources, follows developments in science and technology.
8. Performs project planning and time management, plans his/her career development.
9. Possesses an advanced level of expertise in computer hardware and software, is proficient in using information and communication technologies.
10. Is competent in oral or written communication; has advanced command of English.
11. Has an awareness of his/her professional, ethical and social responsibilities.
12. Has an awareness of the universal impacts and social consequences of engineering solutions and applications; is well-informed about modern-day problems.
13. Is innovative and inquisitive; has a high level of professional self-esteem.
1: Lowest, 2: Low, 3: Average, 4: High, 5: Highest
General Information | Course & Exam Schedules | Real-time Course & Classroom Status
Undergraduate Curriculum | Open Courses, Sections and Supervisors | Weekly Course Schedule | Examination Schedules | Information for Registration | Prerequisite and Concurrent Courses | Legal Info and Documents for Internship | Academic Advisors for Undergraduate Program | Information for ELE 401-402 Graduation Project | Virtual Exhibitions of Graduation Projects | Program Educational Objectives & Student Outcomes | ECTS Course Catalog | HU Registrar's Office
Graduate Curriculum | Open Courses and Supervisors | Weekly Course Schedule | Final Examinations Schedule | Schedule of Graduate Thesis Defences and Seminars | Information for Registration | ECTS Course Catalog - Master's Degree | ECTS Course Catalog - PhD Degree | HU Graduate School of Science and Engineering