• 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 LME 1004 ABSTRACT MATHEMATICS 2 COMPULSORY 3 0 0 5

Offered By

Mathematics Teacher Education

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR HASIBE SEVGI MORALI

Offered to

Mathematics Teacher Education

Course Objective

This course is aimed at number systems, natural numbers, integers, division and division in whole numbers; Euclidean algorithm, rational numbers, real numbers, selection axiom, well ordered sets, finite and infinite sets, countable and uncountable sets

Learning Outcomes of the Course Unit

1   To be able to recognize natural numbers, whole numbers, rational and real number sets, relate number sets and express their differences. 2   To know the properties of division and divisibility in integers 3   Euclid Algorithm, its applications 4   Well ordered sets, axiom of choice and related problems 5   Finite sets, countable and uncountable infinities in sets, related theorems and examples

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Number systems, naturel numbers, integers and their properties 2 Division and divisibility in integers, proofs and exercises 3 Euclidean algorithm 4 Rational numbers, properties 5 Real numbers, properties 6 Axiom of choice 7 Well ordered sets 8 Course overview, evaluation and midterm examination 9 Finite and infinite sets 10 Properties of finite sets and related theorems 11 Properties of countably infinite sets and related theorems 12 Properties of uncountably infinite sets and related theorems 13 Cardinal numbers 14 Relations between finite and infinite sets, examples and exercises 15 Final Exam

Recomended or Required Reading

1)Özer O. , Çoker D. , Taş K. , 1996, Soyut Matematik, 3. baskı, Izgi Yayınevi, Ankara. 2)Çallıalp F, 2009, Soyut Matematik, Birsen Yayınevi, Ist.

Planned Learning Activities and Teaching Methods

Lecture, discussion, question-answer, 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 *** 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

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

To be announced.

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 3 39 Preparation for midterm exam 1 15 15 Preparation for final exam 1 15 15 Preparing assignments 1 13 13 Midterm 1 2 2 Final 1 2 2 TOTAL WORKLOAD (hours) 125

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 PO.14 PO.15 PO.16 PO.17 PO.18 LO.1 5 4 3 3 2 3 LO.2 5 4 3 3 2 3 LO.3 5 4 3 3 2 3 LO.4 5 4 3 3 2 3 LO.5 5 4 3 3 2 3