Home  »  Faculty of Engineering »  Program of Computer Engineering (English 30%)

COURSE UNIT TITLECOURSE UNIT CODESEMESTERTHEORY + PRACTICE (Hour)ECTS
DATA STRUCTURES BİL265 Third Term (Fall) 3 + 1 7

TYPE OF COURSE UNITCompulsory Course
LEVEL OF COURSE UNITBachelor's Degree
YEAR OF STUDY2
SEMESTERThird Term (Fall)
NUMBER OF ECTS CREDITS ALLOCATED7
NAME OF LECTURER(S)Instructor Oğul Göçmen
LEARNING OUTCOMES OF THE COURSE UNIT At the end of this course, the students;
1) Learn dynamic memory allocation and linked list concepts
2) Learn basic data structures
3) Learn how to implement data structures
4) Learn data abstraction and object oriented design concepts
5) Get the ability to analyze the complexity of algorithms
6) Comprehend recursion
7) Get practice on solving problems with data structures
8) Gains the ability to work in interdisciplinary projects.
MODE OF DELIVERYFace to face
PRE-REQUISITES OF THE COURSEYes(BİL122)
RECOMMENDED OPTIONAL PROGRAMME COMPONENTNone
COURSE DEFINITIONBasic data types. Arrays, singly and doubly linked lists, memory considerations, stacks and recursion, queues, tree structures and traversal methods, sorting and searching algorithms, space and time considerations, and applications of data structures.
COURSE CONTENTS
WEEKTOPICS
1st Week Introduction to Data Structures, Programming Principles
2nd Week Object Design Techniques
3rd Week The Vector Container
4th Week Pointers and Dynamic Memory Management
5th Week The List Container and Iterators
6th Week Stacks
7th Week Applications of Stacks
8th Week Midterm Week
9th Week Queues / Priority Queues and Their Applications
10th Week Linked Lists
11th Week Binary Trees
12th Week Binary Search Trees
13th Week Advanced Associative Structures - I (Hash Functions)
14th Week Advanced Associative Structures - II (2-3-4 Trees, Red/Black Tree Structures)
RECOMENDED OR REQUIRED READING1. Data Structures with C++ using STL, 2nd Edition, W.Ford & W.Topp, Prentice-Hall, 2002.
2. Data Structures and Algorithm Analysis in C++, 3rd Edition, M.A. Weiss, Addison Wesly Inc., 2006.
3. Data Structures & Program Design in C, 2nd Edition, Kruse, Tondo, Leung, Prentice-Hall, 1997.
PLANNED LEARNING ACTIVITIES AND TEACHING METHODSLecture,Questions/Answers,Experiment,Presentation,Problem Solving,Project,Report Preparation
ASSESSMENT METHODS AND CRITERIA
 QuantityPercentage(%)
Mid-term130
Assignment415
Quiz410
Attendance15
Total(%)60
Contribution of In-term Studies to Overall Grade(%)60
Contribution of Final Examination to Overall Grade(%)40
Total(%)100
ECTS WORKLOAD
Activities Number Hours Workload
Midterm exam11,51,5
Preparation for Quiz
Individual or group work
Preparation for Final exam15050
Course hours14342
Preparation for Midterm exam13030
Laboratory (including preparation)14228
Final exam11,51,5
Homework6212
Project15050
Quiz616
Total Workload221
Total Workload / 307,36
ECTS Credits of the Course7
LANGUAGE OF INSTRUCTIONEnglish
WORK PLACEMENT(S)No
  

KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)
LO1LO2LO3LO4LO5LO6LO7LO8
K1    X            
K2  X     X         X  
K3        X        
K4          X   X    
K5               
K6                X
K7               
K8               
K9               
K10               
K11               
K12