• 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 GIS 5032 GIS PROJECT DESIGN ELECTIVE 2 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

PROFESSOR DOCTOR OKAN FISTIKOĞLU

Offered to

GEOGRAPHICAL INFORMATION SYSTEMS - NON THESIS (EVENING PROGRAM) GEOGRAPHICAL INFORMATION SYSTEMS GEOGRAPHIC INFORMATION SYSTEMS Geographical Information Systems (Non-Thesis)

Course Objective

During the course we shall examine the nature of the difficult problems that AI seeks to solve. It then develops the theory of and practice of heuristic search, providing detailed algorithms for standards search methods, including best-first search, hill climbing , constraint satisfactions and many others. We will consider different knowledge representation means and instruments to work with uncertain knowledge.

Learning Outcomes of the Course Unit

1   To learn techniques about the design, programming and implementation 2   To learn about providing detailed algorithms for standards search methods, including best-first search, hill climbing , constraint satisfactions

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction to GIS project design 2 A demonstration of GIS project design 3 design, programming and implementation 4 design, programming and implementation 5 design, programming and implementation 6 GIS project application process 7 GIS project application process 8 GIS project application process 9 Discussion about the projects 10 Discussion about the projects 11 Discussion about the projects 12 Discussion about the projects 13 Discussion about the projects 14 Presentation of design projects

Recomended or Required Reading

All GIS Books

Planned Learning Activities and Teaching Methods

Projects and presentations

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 ASG ASSIGNMENT 2 MTE MIDTERM EXAM 3 PRJ PROJECT 4 FCG FINAL COURSE GRADE ASG * 0.30 + MTE * 0.40 + PRJ * 0.30 *** 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)

To be announced.

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 14 2 28 Preparations before/after weekly lectures 14 5 70 Preparing assignments 2 15 30 Preparing presentations 2 15 30 Preparation for midterm exam 1 10 10 Design Project 1 25 25 Midterm 1 2 2 TOTAL WORKLOAD (hours) 195

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