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

Offered By

Management Information Systems

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR CAN AYDIN

Offered to

Management Information Systems

Course Objective

The course aims to train basic data structures and algorithm design with using sample problems and currently used algorithms. Course assignments are supported in this course.

Learning Outcomes of the Course Unit

1   1.Creating an algorithm with using different data structures. 2   2.Storing and grouping data stacks with using linked lists 3   3.Searching data by sorting

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 1.Basic Concepts of Computer Science 2 2.Data structures 3 3.Data Models 4 4.Alghorithms 5 5.Search and Sort Algorithms 6 6.Lists and Linked Lists 7 7.Linked Stacks and Queues 8 8.Mid-Term 9 9.Mid-Term 10 10.Tree Models 11 11.Graph Models 12 12.Finite State Machines 13 13.Recursive Algoritms 14 14.Application

Recomended or Required Reading

Main Textbook: Drocdek A. (2012). Data Structures and Algorithms in C++. Cengage Learning. Help book: Horowitz E., Sahni S. & Mehta D. (1995). Fundamnetals of Data Structures in C++. W.H. Freeman. Knuth, D.E. (1997). The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley.

Planned Learning Activities and Teaching Methods

Students will undergo two exams, one mid-term and one final.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 MTEG MIDTERM GRADE MTEG * 1 3 FIN FINAL EXAM 4 FCGR FINAL COURSE GRADE MTEG * 0.40 + FIN * 0.60 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTEG * 0.40 + RST * 0.60 *** 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

Turkish

Course Policies and Rules

The rules applied by the department are valid.

Contact Details for the Lecturer(s)

can.aydin@deu.edu.tr

Office Hours

Fridays

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 12 3 36 Preparations before/after weekly lectures 12 3 36 Final 1 1 1 Midterm 1 1 1 TOTAL WORKLOAD (hours) 74

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