• 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 MAT 4060 INTRODUCTION TO MATHEMATICAL BIOLOGY ELECTIVE 4 0 0 7

Offered By

Mathematics (English)

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR MELTEM ADIYAMAN

Offered to

Mathematics (Evening) Mathematics (English)

Course Objective

This course aims to provide an introduction to a variety of mathematical models for biological systems and to present the mathematical theory and techniques useful in the analysis of these models.

Learning Outcomes of the Course Unit

1   Will be able to understand conceptual and visual representation of models 2   Will be able to understand population models. 3   Will be able to solve linear and nonlinear dynamical systems. 4   Will be able to understand graph theory applications in biology 5   Will be able to solve graph theory applications in biology

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Biological Applications of Difference Equations, Population Models 2 Nicholson-Bailey Model 3 Host-Parasite Model 4 Predator-Prey Model 5 Populaton Genetics Models 6 Nonlinear Structured Models 7 Biological Applications of Differential Equations 8 Examples for midterm, Midterm 9 Predator-Prey Model 10 Competition Models 11 Spruce Budworm Model 12 Metapopulation and Patch Models 13 Chemostat Model 14 Continuous Age-Structured Model

Recomended or Required Reading

J. S. L. Allen, An Introduction to Mathematical Biology, Pearson Prentice Hall, 2007

Planned Learning Activities and Teaching Methods

Lecture Notes Presentations Solving problems

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 ASG ASSIGNMENT 3 FINS FINAL EXAM 4 FCG FINAL COURSE GRADE MTE * 0.30 + ASG * 0.20 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + ASG * 0.20 + RST * 0.50

Further Notes About Assessment Methods

None

Assessment Criteria

Midterm, Assignment, Final

Language of Instruction

English

Course Policies and Rules

1. Attending at least 70 percent of lectures is mandatory. 2. Plagiarism of any type will result in disciplinary action

Contact Details for the Lecturer(s)

e-mail: meltem.evrenosoglu@deu.edu.tr, tel: (232) 301 85 75

Office Hours

To 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 14 2 28 Preparation for midterm exam 1 17 17 Preparation for final exam 1 20 20 Preparing assignments 5 8 40 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 165

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