COURSE UNIT TITLE

: INFORMATION TECHNOLOGY AND MATHEMATICS

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
BTE 1001 INFORMATION TECHNOLOGY AND MATHEMATICS COMPULSORY 3 0 0 5

Offered By

Computer and Instructional Technologies Teacher Education

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

DOCTOR SEMRA ERTEM

Offered to

Computer and Instructional Technologies Teacher Education

Course Objective

To teach mathematical thinking and cause-effect relationship; to be able to analyze and find solutions to related problems depending on counting methods; having information about discrete structures (clusters, relatives, trees); gain ability to think algorithmically; discrete mathematical applications and see how models are adapted to computer problems.

Learning Outcomes of the Course Unit

1   1. The propositions form appropriate expressions and determine the truth values
2   2. Describe basic characteristics, series and basic characteristics of sets, functions and series.
3   3. Boole understands algebra and its properties and minimizes logical functions with determined methods.
4   4. Explain counting bases, permutation, combination theorems
5   5. Interpretation of tree structure and properties and matrix structures
6   6. Use recursive structures and apply repetitive algorithmic constructs
7   7. Applies Graph Theory and makes algorithm analysis.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Suggestions and logic
2 Theory of Sets
3 Connections and Functions
4 Graph Theory and Applications
5 Boole Cebri and Modern Logic
6 Numbers Theory and Numbers
7 Probability Theory and Stochastic Processes
8 General Review, Course Evaluation, Midterm Exam
9 Trees and Hierarchy
10 Matrix Operations and Determinant
11 Algorithms
12 Algorithm applications
13 Graph Theory Applications
14 Algorithm Analysis
15 Final

Recomended or Required Reading

1-Veri Yapıları ve Algoritmalar - Toros Rifat Çölkesen (Ph.D)
2-Ayrık Matematik ve Uygulamaları; Kenneth H. Rosen ; Palme Yayınevi
3-Algoritma Geliştirme ve Veri Yapıları ;Toros Rifat Çölkesen (Ph. D); Editör: Cengiz Uğurkaya (Ph. D)
4-Ayrık yapılar matematiği Yazar: Umut Akas; Kanes Yayınları
5-Bilişim Matematiği - Uygulamalı Ayrık Matematik; Toros Rifat Çölkesen (Ph.D)

Planned Learning Activities and Teaching Methods

Lecture, Problem Solving, Class Discussion, Group Work

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 VZ Midterm
2 FN Semester final exam
3 BNS BNS Student examVZ * 0.40 + Student examFN * 0.60
4 BUT Make-up note
5 BBN End of make-up grade Student examVZ * 0.40 + Student examBUT * 0.60


Further Notes About Assessment Methods

ORDER NO SHORT CODE LONG NAME FORMUL
1 VZ Midterm Exam
2 FN Semester final exam
3 BNS BNS VZ * 0.40 + FN * 0.60
4 BUT Complement note
5 BBN BBN VZ * 0.40 + BUT * 0.60

Homework, discussion, test

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

semra.ertem@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
Preparations before/after weekly lectures 13 4 52
Preparation for midterm exam 1 15 15
Preparation for final exam 1 15 15
Midterm 1 2 2
Final 1 2 2
TOTAL WORKLOAD (hours) 125

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.11543451111
LO.21443452111
LO.31553451111
LO.41433452111
LO.51433451111
LO.61433451111
LO.71433451111

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS