COURSE UNIT TITLE

: FUNDAMENTALS OF ALGORITHMS AND DATA STRUCTURES

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
GIS 5009 FUNDAMENTALS OF ALGORITHMS AND DATA STRUCTURES 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 RECEP ALP KUT

Offered to

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

Course Objective

Basic concepts of computer system hardware and software. Machine, assembly and high level languages. Internal data representation, integers, reals and characters. Problem solving and algorithm development. Program structures. Sequencing, alteration, iteration. schema design types. Scalar and structured data types. Arrays, records, sets and files. Stacks, queues, linear lists and trees. Implementation of data structures. Recursion. Searching arrays and linked lists. Sequential and binary tree searches. Sorting methods, bubble sort, insertion sort, heap sort, quick sort.

Learning Outcomes of the Course Unit

1   Basic concepts of computer system hardware and software.
2   Problem solving and algorithm development.
3   Implementation of data structures
4   Search and sorting

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Overview How to create Programs, How to Analyze Programs
2 Basic Elements of Programming Constants, Variables, Variable Types
3 Ordered Lists Arrays,Matrices
4 Ordered Lists Arrays,Matrices
5 Stacks and Queues Fundamentals,ADD, DELETE Operations,Example Studies
6 Stacks and Queues Fundamentals,ADD, DELETE Operations,Example Studies
7 Stacks and Queues Fundamentals,ADD, DELETE Operations,Example Studies
8 Linked Lists Singly Linked Lists,Linked Stacks and Queues,The Storage Pool,Polynomial Addition,Sparse Matrices,Doubly Linked Lists,Storage Management
9 Linked Lists Singly Linked Lists,Linked Stacks and Queues,The Storage Pool,Polynomial Addition,Sparse Matrices,Doubly Linked Lists,Storage Management
10 Linked Lists Singly Linked Lists,Linked Stacks and Queues,The Storage Pool,Polynomial Addition,Sparse Matrices,Doubly Linked Lists,Storage Management
11 Linked Lists Singly Linked Lists,Linked Stacks and Queues,The Storage Pool,Polynomial Addition,Sparse Matrices,Doubly Linked Lists,Storage Management
12 Trees Basic terminology,Binary Trees
13 Trees Basic terminology,Binary Trees
14 Sorting and Searching Searching,Insertion Sort,Quick Sort

Recomended or Required Reading

Textbook
Horowitz E & Sahni S "Fundamnetals of Data Structures", PITMAN.
References
Knuth, D.E. The Art of Computer Programming
Addison-Wesley 1997, 1998

Planned Learning Activities and Teaching Methods

Term Project
Presentation
Assignments
Exams

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE 1 MIDTERM EXAM 1
2 MTE 2 MIDTERM EXAM 2
3 ASG ASSIGNMENT
4 RPT REPORT
5 FIN FINAL EXAM
6 FCG FINAL COURSE GRADE MTE 1 * 0.20 + MTE 2 * 0.20 + MAKRASG +RPT/2 * 0.20 +FIN * 0.40
7 RST RESIT
8 FCGR FINAL COURSE GRADE (RESIT) MTE 1 * 0.20 + MTE 2 * 0.20 + ASG +RPT/2 * 0.20 +RST * 0.40


*** 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
Preparing assignments 4 8 32
Preparation for final exam 1 30 30
Preparation for midterm exam 2 25 50
Preparing presentations 1 20 20
Preparations before/after weekly lectures 14 2 28
Final 1 2 2
Midterm 2 2 4
TOTAL WORKLOAD (hours) 194

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.13223232223223
LO.23232223223322
LO.32223232232222
LO.43323223222323

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