Information Package
baskent.edu.tr

Program of Computer Engineering (English)

CSE231

DISCRETE STRUCTURES

Course Code
CSE231
Semester
Third Term (Fall)
Theory+Practice
3 + 1
ECTS
6
Course TypeCompulsory Course
Course LevelBachelor's Degree
Year of Study2
SemesterThird Term (Fall)
ECTS6
Name of Lecturer(s)
Learning Outcomes

At the end of this course, the students;

  1. Represent the propositions using logical connectives and interpret symbolic expressions.
  2. Determine is a mathematical argument correct or not.
  3. Develop the knowledge on recursively-defined structures
  4. Gain the ability to think algorithmically.
  5. Have theoretical knowledge on Equivalence relations and Partial orders; solve related application problems.
  6. Learn the basic principles of counting and advanced counting techniques.
  7. Obtain information about basic concepts, methods and applications of graph theory.
  8. Apply discrete structures and related methods to solve problems in Computer Engineering.
Mode of DeliveryFace to face
PrerequisitesNo
Recommended Optional Programme ComponentsNone
Course DescriptionLogic. Logical operations and laws of logic, quantifiers and proofs of theorems. Sets. Subsets and operations on sets. Principles of counting. Inclusion-exclusion and pigeon-hole principles. Integers, mathematical induction. Relations and functions. Operations on relations. Partially ordered sets. Lattices. Boolean algebras. Graphs. Euler and Hamiltonian paths and circuits. Trees. Binary trees, spanning trees. Tree searching. Elements of coding theory.
Course Contents
WEEK TOPICS
1st Week Logic. Propositions. Logical operations.
2nd Week Logical equivalence rules.
3rd Week Logical inference and its rules. Methods of proving theorems.
4th Week Propositional functions. Quantifiers. Mathematical induction.
5th Week Sets. Subsets. Operations on sets. Recursively defined sets.
6th Week Sequences. Recurrence relations.
7th Week Recursively defined structures and algorithms.
8th Week Midterm Exam
9th Week Relations, functions and their properties.
10th Week Operations on relations. Equivalence relations.
11th Week Partial orderings. Hasse diagrams. Lattice theory.
12th Week Counting principles. Permutations. Combinations.
13th Week Advanced counting techniques. Pigeonhole principle.
14th Week Introduction to graph theory. Directed and undirected graphs. Definitions.
15th Week Euler circuits and paths. Hamilton circuits and paths.
Recommended or Required Reading1. Rosen K.H., Discrete Mathematics and Its Applications, 6/E, McGraw-Hill, 2007
2. Kolman B., Busby R.C., Ross S., Discrete Mathematical Structures, 5/E, Prentice Hall, 2004
3. Grimaldi R.P., Discrete and Combinatorial Mathematics, 5/E, Addison Wesley, 2003
Planned Learning Activities and Teaching Methods
  • Lecture
  • Questions/Answers
  • Presentation
  • Report Preparation
  • Project
  • Experiment
  • Practice
Assessment Methods and Criteria
Quantity Percentage (%)
Mid-term 1 30
Assignment 8 15
Quiz 4 15
Total(%) 60
Contribution of In-term Studies to Overall Grade(%) 60
Contribution of Final Examination to Overall Grade(%) 40
Total(%) 100
Language of Instruction-
Work Placement(s)No

Programme Qualifications / Learning Outcomes

LO1 LO2 LO3 LO4 LO5 LO6 LO7 LO8
K1 X X X X X X
K2 X X X X X
K3 X
K4 X
K5
K6
K7
K8
K9
K10
K11