• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS BIL 1005 DISCRETE MATHEMATICS AND LOGIC COMPULSORY 4 0 0 6

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR FIDAN NURIYEVA

Offered to

Computer Science

Course Objective

To teach mathematical and logical structures which are basis of computer science.

Learning Outcomes of the Course Unit

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

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Logic, Applications of Propositional Logic 2 Proofs, Methods of Proving Theorems 3 Sets, The Power Set, Cartesian Products, Set Operations 4 Relations, Representing Relations, Closures of Relations, Equivalence and Ordering Relations 5 Functions, One-to-One and onto Functions, Inverse Functions and Compositions of Functions The graphs of functions Quiz 1 6 Recursion and Recursive Algorithms 7 Matrices, Matrix Arithmetic 8 Recap 9 Graphs 10 Finite State Machines 11 The Integers and Division, Modular Arithmetic, The Euclidean Algorithm, Applications of Number Theory Boolean algebra Logic gates Minimization of circuits Counting The pigeonhole principle Permutations and combinations Binomial coefficients 12 Counting, The Pigeonhole Principle 13 Advanced counting techniques Divide-and conquer algorithms 14 Permutations and Combinations

Recomended or Required Reading

Textbook(s): Discrete Mathematics and Its Applications, Kenneth H. Rosen, ISBN: 0072424346. Supplementary Book(s): Bilgisayar Bilimi ve Mühendisliğinde Ayrık Matematik, Rifat Çölkesen, ISBN: 975-6796-XX-X.

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 VZ Vize 2 FN Final 3 BNS BNS VZ * 0.40 + FN * 0.60 4 BUT Bütünleme Notu 5 BBN Bütünleme Sonu Başarı Notu VZ * 0.40 + BUT * 0.60

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

fidan.nuriyeva@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 4 56 Preparations before/after weekly lectures 12 5 60 Preparation for midterm exam 1 12 12 Preparation for final exam 1 12 12 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 144

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 PO.12 PO.13 LO.1 5 LO.2 5 5 LO.3 5 5 5 LO.4 5 5 LO.5 5 5