• 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 BIL 2011 ALGORITHMS AND DATA STRUCTURES COMPULSORY 2 2 0 6

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR MURAT ERŞEN BERBERLER

Offered to

Computer Science

Course Objective

This course aims to teach data structures concept and properties. Arrays, stacks, queues, linked lists, trees, sorting and searching algorithms will be discussed In the course context.

Learning Outcomes of the Course Unit

1   Have a basic knowledge of primitive and composite data structures. 2   Have ability to analyze time and memory complexity of an algorithm. 3   Have a good knowledge of basic searching and sorting algorithms. 4   Have a good knowledge of list, queue, stack, and tree data models. 5   Have a basic knowledge of data compressing techniques.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

BIL 1016 - Introduction to Computer Science II

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction to Data Structures and Data Models 2 Time and Memory Analysis 3 Linked lists 4 Linked lists (cont.) 5 Stack and Queue 6 Heap Data Structure and Application 7 Hash Tables 8 Hash Tables (cont.) 9 Binary Search Tree 10 Binary Search Tree (cont.) 11 Tree Traversal Algorithms 12 Searching Algorithms 13 Sorting Algorithms 14 Sorting Algorithms (cont.) 15 Other Data Structures Topics

Recomended or Required Reading

Textbook(s): Çölkesen, R., Veri Yapıları ve Algoritmalar Bilg. Prog. ve Yaz. Müh., Papatya Yayıncılık, 2002. Nabiyev, V., Algoritmalar Teoridan Uygulamalara, Seçkin Yayıncılık, 2021

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 VZ Vize 2 FN Final 3 BNS BNS VZ * 0.40 + FN * 0.60 4 BUT Bütünleme Notu 5 BBN Bütünleme Sonu Başarı Notu VZ * 0.40 + BUT * 0.60

Further Notes About Assessment Methods

None

Assessment Criteria

Will be announced.

Language of Instruction

Turkish

Course Policies and Rules

Will be announced.

Contact Details for the Lecturer(s)

murat.berberler@deu.edu.tr

Office Hours

Will be announced.

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 14 4 56 Preparation for midterm exam 1 10 10 Preparation for final exam 1 15 15 Preparation for quiz etc. 0 0 0 Preparations before/after weekly lectures 0 0 0 Final 1 2 2 Midterm 1 2 2 TOTAL WORKLOAD (hours) 141

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