• 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 5028 ADVANCED COMPUTER PROGRAMMING ELECTIVE 2 0 0 9

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

Offered to

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

Course Objective

This course aims to teach students to apply problem-solving techniques to computing, the fundamental concepts of an object and its relation to that of a class, understand initial steps of object analysis, compose algorithms, learn the syntax of the C++ programming language, implement algorithms as C++ programs and document programs.

Learning Outcomes of the Course Unit

1   to teach students to apply problem-solving techniques to computing 2   the fundamental concepts of an object and its relation to that of a class 3   understand initial steps of object analysis, compose algorithms 4   learn the syntax of the C++ programming language

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Standard input/output 2 Pointers 3 Character strings and arrays 4 Structures and classes 5 Overloading functions and operators 6 Class inheritance and associations 7 Virtual Functions 8 Template and exceptions 9 Object analysis and object design 10 Object analysis and object design 11 Unformatted Input/Output 12 Creating User defined Libraries 13 Creating User defined Libraries 14 Creating User defined Libraries

Recomended or Required Reading

William Ford and William Topp, An Introduction to Computing Using C++ and Object Technology, Prentice Hall, 1999

Planned Learning Activities and Teaching Methods

Assignments Exams

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 Preparation for midterm exam 1 40 40 Preparing assignments 3 30 90 Midterm 1 2 2 TOTAL WORKLOAD (hours) 230

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