• 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 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

ASSISTANT PROFESSOR GÖKSU TÜYSÜZOĞLU

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 JSON and XML related technologies such as XML, XSD 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 external sorting algorithms 5   Use basic database functionalities. 6   To analyze time and space cost of a given algorithm about data organization or management. 7   Choose 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 Data Organization and Management 2 Data, Information, Knowledge 3 Data Representation 4 Data Representation 5 XML Technologies 6 XML Technologies 7 Data Coding 8 Storage Devices & Basic File Ops 9 Binary Search, Simple Indexing 10 B+ Tree 11 External Sorting 12 Introduction to DBMS 13 Data Normalization & SQL 14 Database Design

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 MTE MIDTERM EXAM 2 ASG ASSIGNMENT 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE MTE * 0.30 + ASG * 0.30 + FIN * 0.40 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + ASG * 0.30 + RST * 0.40

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)

Göksu TÜYSÜZOĞLU, Dokuz Eylul University, Department of Computer Engineering Tınaztepe Campus, 35390 Izmir Tel: (232) 3017440

Office Hours

Tuesday 10:00 - 12:00

Work Placement(s)

None

Workload Calculation

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

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