COURSE UNIT TITLE

: DATA ORGANIZATION AND MANAGEMENT

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CME 2202 DATA ORGANIZATION AND MANAGEMENT COMPULSORY 3 2 0 6

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

Offered to

Computer Engineering

Course Objective

The main objectives of this course are to discuss and teach the physical characteristics of storage media and organization and efficient processing of files.

Learning Outcomes of the Course Unit

1   Use XML related technologies such as XML, XSL, XSD, DTD, XQUERY in application development.
2   Understand the basic characteristics of secondary storage characteristics
3   Understand state-of-the-art tree based file indexing structures, focusing on b+tree and its variants.
4   Understand file hashing and external sorting algorithms
5   Understand multi-attribute indexing structures such as R-tree, kd-tree, M-tree and Grid files.
6   Use basic database functionalities.
7   To analyze time and space cost of a given algorithm about data organization or management.
8   Chose the best file stuctures for a given situation.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to File Organization
2 Secondary Storage Device and Basic File Opera
3 XML, DTD
4 XSD, XSL
5 XPATH, XSD, XQUERY
6 Basic Indexing Structures
7 B+tree indexing
8 B+tree indexing
9 Hashing
10 External sorting
11 Multidimensional indexing methods
12 Midterm Exam
13 Introduction to Database Management Systems
14 Structured Query Language

Recomended or Required Reading

1) Michael J. Folk and Bill Zoellick, File Structures: An OO Approach with C++, 2nd Edition, Addison Wesley, 1998.
2) Slazberg, Betty, File Structures, An analytic approach, John Wiley & Sons Publishing Company, 1990.

Planned Learning Activities and Teaching Methods

Presentation/Lecturing and Interactive discussion

Assessment Methods

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


*** 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)

Adil Alpkocak,
Dokuz Eylul Universitesi, Bilgisayar Muh. Bolumu
Tınaztepe Kampusu,
35390 Izmir
Tel: (232) 3017408

Office Hours

Wednesday 13:00 - 17:100

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 2 28
Tutorials 14 2 28
Preparations before/after weekly lectures 12 2 24
Preparation for midterm exam 1 16 16
Preparation for final exam 1 16 16
Preparing assignments 3 15 45
Midterm 1 2 2
Final 1 2 2
TOTAL WORKLOAD (hours) 161

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.151513
LO.252513
LO.352513
LO.452513
LO.552513
LO.652513
LO.752513
LO.852513