• 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 CME 1205 DISCRETE COMPUTATIONAL STRUCTURES COMPULSORY 3 0 0 5

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

TANZER ONURGIL

Offered to

Computer Engineering

Course Objective

The aim of this course is to introduce discrete data structures and to reach a solution by using these structures within a mathematical perspective for the encountered problems.

Learning Outcomes of the Course Unit

1   Apply discrete structures such as sets, relations, functions, graphs and trees, in solving the encountered problems 2   Apply the information about combinatorial mathematics, logic and proof in solving the encountered problems 3   Analyze the problems within the course subjects from a mathematical perspective 4   Formulize the problems within the course subjects from a mathematical perspective 5   Evaluate the scope, boundaries and the nature of the encountered problems in an integral way

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction, Sets 2 Functions 3 Relations 4 Relations 5 Counting 6 Graphs 7 Graphs 8 Graphs 9 Trees 10 Trees 11 Midterm exam. 12 Trees 13 Logic 14 Proofs

Recomended or Required Reading

Kenneth Rosen, "Discrete Mathematics and Its Applications". Sixth Ed. McGraw-Hill, 2007.

Planned Learning Activities and Teaching Methods

Presentation, guided problem solving

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 FIN FINAL EXAM 3 FCG FINAL COURSE GRADE MTE * 0.50 + FIN * 0.50 4 RST RESIT 5 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.50 + RST * 0.50 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Computer Engineering Department, Room 108. Phone: 3017416 e-mail: tanzer@cs.deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 3 39 Preparation for midterm exam 1 6 6 Preparations before/after weekly lectures 14 4 56 Preparation for final exam 1 10 10 Final 1 2 2 Midterm 1 2 2 Quiz etc. 1 1 1 TOTAL WORKLOAD (hours) 116

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 LO.1 5 5 3 LO.2 5 5 3 LO.3 5 5 4 3 2 LO.4 5 4 4 3 3 LO.5 5 4 4 4 3