At the end of this course, the students; 1) Should be able to understand and use some of the basic data structures. 2) Are expected to see differences between different algorithms and implementations.
MODE OF DELIVERY
Face to face
PRE-REQUISITES OF THE COURSE
No
RECOMMENDED OPTIONAL PROGRAMME COMPONENT
There is no recommended optional programme component for this course.
COURSE DEFINITION
Object-Oriented Design, Analysis Tools, Stacks, Queues, and Deques, Vectors, Lists, and Sequences, Trees, Priority Queues, Dictionaries, Search Trees, Sorting and Selection, Text Processing, Graphs.
COURSE CONTENTS
WEEK
TOPICS
1st Week
Introduction: Abstract data types and data structures
2nd Week
Fundamental concepts
3rd Week
Collections
4th Week
Recursion
5th Week
Recursion
6th Week
Lists
7th Week
Linked lists
8th Week
MIDTERM
9th Week
Stacks and queues
10th Week
Binary trees
11th Week
Binary search trees
12th Week
Sorting
13th Week
Hashing
14th Week
Applications/Project presentations
RECOMENDED OR REQUIRED READING
"Data Structures and Program Design in C++", J.R., R.L. Kruse, C.L. Tondo, B.P. Leung, 1999.
PLANNED LEARNING ACTIVITIES AND TEACHING METHODS
Lecture,Problem Solving,Questions/Answers,Other
ASSESSMENT METHODS AND CRITERIA
Quantity
Percentage(%)
Mid-term
1
30
Assignment
1
10
Project
1
10
Total(%)
50
Contribution of In-term Studies to Overall Grade(%)
50
Contribution of Final Examination to Overall Grade(%)
50
Total(%)
100
LANGUAGE OF INSTRUCTION
Turkish
WORK PLACEMENT(S)
No
KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)
