1. FIRST CYCLE - BACHELOR'S DEGREE
  2. FACULTY OF ENGINEERING
  3. COMPUTER ENGINEERING DEPARTMENT
  4. 253 Computer Engineering
Course Information Course Learning Outcomes Course's Contribution To Program ECTS Workload Course Details
Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
CENG 114DISCRETE STRUCTURES FOR COMPUTER SCIENCE3 + 02nd Semester4

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Compulsory
Course Objective The aim of this course, to provide students understand the basic mathematical structure of computers and to teach mathematical, logical and discrete structures which are basis of computer sciences.
Course Content Basic mathematical concepts and structures: Logic, Proposition Equivalences, Predicates, Quantifiers, Mathematical Logic Execution: Proof Methods, Induction, Sets and Functions in Computer Science, Recursive Functionsand Algorithms, Growth of Functions, Algorithm Complexity and Complexity Classes(P, NP, NP-Complete ve NP-Hard), Boolean Functions and Representations, Counting: Basics of Counting, Permutations and Combinations, Discrete Probability. Graph Terminology, Graph Representation and Isomorphism in Graphs, Connected graphs, Euler and Hamiltonian Paths, Trees in Computer Science.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Expresses the basic mathematical systems used in digital computers.
2Makes mathematical inferences.
3Compares and uses different discrete structures.
4Solves the problems by using the recursive functions.
6Solves basic combinational and counting problems.
5Expresses algorithm complexity and complexity classes.
7Solves the solutions of certain problems with graphs which are the basic data structures.

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 001            
LO 002            
LO 003            
LO 004            
LO 005            
LO 006            
LO 007            
Sub Total            
Contribution000000000000

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14228
Assignments4312
Mid-terms188
Final examination11414
Total Work Load

ECTS Credit of the Course





104

4
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2023-2024 Spring1TUFAN TURACI
Details 2023-2024 Spring2TUFAN TURACI
Details 2022-2023 Spring1TUFAN TURACI
Details 2021-2022 Spring1TUFAN TURACI
Details 2021-2022 Spring2TUFAN TURACI
Details 2021-2022 Spring3TUFAN TURACI


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
CENG 114 DISCRETE STRUCTURES FOR COMPUTER SCIENCE 3 + 0 1 Turkish 2023-2024 Spring
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Prof. Dr. TUFAN TURACI tturaci@pau.edu.tr İİBF BB104 %70
Goals The aim of this course, to provide students understand the basic mathematical structure of computers and to teach mathematical, logical and discrete structures which are basis of computer sciences.
Content Basic mathematical concepts and structures: Logic, Proposition Equivalences, Predicates, Quantifiers, Mathematical Logic Execution: Proof Methods, Induction, Sets and Functions in Computer Science, Recursive Functionsand Algorithms, Growth of Functions, Algorithm Complexity and Complexity Classes(P, NP, NP-Complete ve NP-Hard), Boolean Functions and Representations, Counting: Basics of Counting, Permutations and Combinations, Discrete Probability. Graph Terminology, Graph Representation and Isomorphism in Graphs, Connected graphs, Euler and Hamiltonian Paths, Trees in Computer Science.
Topics
WeeksTopics
1 Logic, propositional equations, predicates and quantifiers.
2 Mathematical logic execution.
3 Proof methods and Induction.
4 Sets in computer science.
5 Functions, Iterative functions, Boolean functions.
6 Growth of functions, Algorithm complexity and complexity classes.
7 Counting Methods.
8 Probability.
9 Introduction to number theory and Cryptology.
10 Introduction to number theory and Cryptology.
11 Graph theory and its applications.
12 Graph theory and its applications.
13 Graph theory and its applications.
14 Trees in computer science.
Materials
Materials are not specified.
Resources
ResourcesResources Language
Discrete Mathematics and Its Applications, Kennet H. Rosen English
Ayrık Matematik ve Uygulamaları, Kennet H. Rosen (Türkçe çeviri), Palme yayıncılıkTürkçe
Introduction to Algorithms, T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, 2009.  English
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam60Final Exam
Midterm Exam40Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes