COURSE UNIT TITLE

: DISCRETE STRUCTURES IN COMPUTER SCIENCE

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CSC 5026 DISCRETE STRUCTURES IN COMPUTER SCIENCE ELECTIVE 3 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASSOCIATE PROFESSOR MURAT ERŞEN BERBERLER

Offered to

Computer Science

Course Objective

To hold the solution procedures for the problems encountered in computer science that use discrete structures, and to give the algorithms that uses these procedures, their design and analysis with applications. To teach the algorithmic approach for the problem literature that uses discrete structures, and to make the student to gain the knowledge and skill levels for solving the encountered new problems by using the literature.

Learning Outcomes of the Course Unit

1   Have a knowledge of basic concepts of discrete structures.
2   Be able to solve problems of discrete structures with algorithms.
3   Be able to solve computer science problems by using discrete structures concepts.
4   Be able to design efficient algorithms by using discrete structures concepts.
5   Be able to solve problems of different type of disciplines by using concepts of discrete structures.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Recurrent Problems
2 Sums
3 Integer Functions
4 Number Theory
5 Binomial Coefficients
6 Special Numbers
7 Generating Functions
8 Midterm exam
9 Discrete Probability
10 Asymptotics
11 Combinatorial Analysis
12 Algebraic Structures
13 Graphs
14 Graphs

Recomended or Required Reading

Ronald L. Graham, Donald E. Knuth, Oren Patashnik, "Concrete Mathematics A Foundation For Computer Science", Addison -Wesley Publishing Company, 1995.
Seymour Lipschutz, "Esential Computer Mathematics", Schaum's Outlines McGraw-Hill, 1987.

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 PRS PRESENTATION
3 FIN FINAL EXAM
4 FCG FINAL COURSE GRADE MTE * 0.40 +PRS * 0.20 +FIN * 0.40
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.40 +PRS * 0.20 +RST * 0.40


*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

Will be announced.

Language of Instruction

Turkish

Course Policies and Rules

Will be announced.

Contact Details for the Lecturer(s)

murat.berberler@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 13 3 39
Preparations before/after weekly lectures 13 4 52
Preparation for midterm exam 1 40 40
Preparing presentations 1 28 28
Preparation for final exam 1 40 40
Final 1 2 2
Project Assignment 1 2 2
Final 1 2 2
TOTAL WORKLOAD (hours) 205

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.1555
LO.2555
LO.3555
LO.4555
LO.5555