0% found this document useful (0 votes)
142 views2 pages

Ceng223 Syllabus

This document provides information about the CENG 223 - Discrete Computational Structures course offered in the Fall 2021 semester at METU Department of Computer Engineering. The course is taught over 3 sections by different instructors and teaching assistants. It covers topics such as propositional and predicate logic, sets and functions, integers, induction and recursion, counting, relations, graphs, and trees. Students will be evaluated based on take-home exams, online quizzes, a midterm exam, and a final exam. All communications will be through the university's online class system. Students must complete individual assignments individually, and cheating will result in failure of all take-home exams and discipline from the university.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
142 views2 pages

Ceng223 Syllabus

This document provides information about the CENG 223 - Discrete Computational Structures course offered in the Fall 2021 semester at METU Department of Computer Engineering. The course is taught over 3 sections by different instructors and teaching assistants. It covers topics such as propositional and predicate logic, sets and functions, integers, induction and recursion, counting, relations, graphs, and trees. Students will be evaluated based on take-home exams, online quizzes, a midterm exam, and a final exam. All communications will be through the university's online class system. Students must complete individual assignments individually, and cheating will result in failure of all take-home exams and discipline from the university.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

METU Department of Computer Engineering Fall 2021

CENG 223 - Discrete Computational Structures / Sections I, II and III

Instructors: Aysenur Birturk (Section I), Ebru Aydın Gol, (Section II), Faruk Polat
(Section III)

Teaching Assistants: M. Ferhat Arslan, M.Tugberk Isyapar, Gunes Sucu

1. Catalog Data: Discrete Computational Structures (3-0) 3


See the Catalog for more descriptive information. Prerequisites: None

2. Textbook(s):
K.H.Rosen, Discrete Mathematics and Its Applications, McGraw-Hill, Seventh Edition,
2013.

3. Goals: To teach the basics of discrete mathematical structures.

4. Course Outline:
Topics

(a) Propositional Logic {1 week }


Logic, Equivalences
(b) Predicate Logic {2 weeks }
Predicates and Quantifiers, Nested Quantifiers, Methods of Proof, Natural Deduction
(additional material)
(c) Sets and Functions {1.5 weeks }
Overview of Sets and Functions, Countability,, Growth of Functions, Complexity of
Algorithms
(d) Integers { 1.5 weeks}
Integers and Division, Integers and Algorithms, Applications of Number Theory
(Reading Assignment)
(e) Induction and Recursion {1 week }
Mathematical Induction, Recursive Definitions and Structural Induction, Recursive
Algorithms
(f) Counting {2.5 week}
Overview of Permutations and Combinations, Recurrence Relations, Solving Recur-
rence Relations, Generating Functions, Inclusion and Exclusion
(g) Relations {1 week }
Relations and Their Properties, Representing Relations, Closure of Relations, Equiv-
alence Relations, Partial Orderings
(h) Graphs{2 weeks}
Introduction to Graphs, Graph Terminology, Representing Graphs, Connectivity, Eu-
ler and Hamiltonian Paths, Shortest Path Problem, Graph Coloring
(i) Trees {1.5 weeks}
Int to Trees, Applications of Trees, Spanning Trees, Min Spanning Trees
Evaluation
(a) Take-home Exams (5) 15%,
• Upload your solutions as vector-based PDF document on due dates.
(b) Online Quizzes (5) 15%,
• Online quizzes will be given through ODTUCLASS and automatically graded.
Fourth lecture hour (Fri 11.40) will be used for the conduct unless otherwise
changed.
• Quiz dates/coverage will be announced beforehand.
(c) Midterm Exam 35% (To be announced).
(d) Final Exam 35% (To be announced).
5. Communication: All announcements including take-home exam assignments, recitations,
etc will be made on ODTUClass (https://odtuclass.metu.edu.tr).
6. Course Conduct
• All students in Sections 1, 2 and 3 must follow “Ceng223 All Sections” on ODTU-
CLASS.
• Fourth lecture hour (Fri 11.40) is reserved for auxiliary teaching activities such as
Latex review, course review, problem solving, quizzes etc.
7. Exam Conduct
• Midterm and Final exams will be face to face (F2F).
• Students who are taking all courses online this semester will be given right to attend
to the online makeup exam that will be given after the F2F exam. In order to attend
to the online makeup exam, students must upload a request letter along with a reprint
of officially registered courses taken from OIBS on ODTUCLASS.
• Online exams will be conducted on ODTUCLASS.
8. Policy:
• The take-home exam assignments that are designated as individual assignments must
be completed individually. Copying from others, either from other students or off the
internet is strictly forbidden and will surely constitute grounds for failure.
• In case of cheating in one of the take-home exams, all of the take-home exams will
be graded as 0 and furthermore the case will be passed to the Student Discipline
Committee.

You might also like