Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
3BBM201Data Structures3+0+03506.09.2024

 
Course Details
Language of Instruction English
Level of Course Unit Bachelor's Degree
Department / Program COMPUTER ENGINEERING
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course Providing solid foundations in the basic concepts of programming, choosing and designing data structures that are appropriate for a problem and comparing the considered algorithms.problem and comparing the considered algorithms.
Course Content Space and time complexity, matrix storage, stack, queue, singly/doubly linked lists, binary trees, graphs
Course Methods and Techniques Lecture, Problem Solving
Prerequisites and co-requisities ( BBM103 ) and ( BBM101 ) and ( BBM203 )
Course Coordinator None
Name of Lecturers Associate Prof.Dr. Adnan Özsoy
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources 1. Horowitz E., Sahni S., Anderson S.,??Fundamentals of Data Structures in C?, Computer Scince Press, New York, 1993 2. Horowitz E., Sahni S., Mehta D.,?Fundamentals of Data Structures in C++?, Computer Scince Press, New York, 1995 3. Problem Solving and Program Design in C, 7th Edition. Jeri Hanly and Elliot Koffman, Pearson, 2013 4. Data Structures and Algorithm Analysis in C++. 4th Edition, Mark Allen Weiss, Pearson, 2014
Course Notes 1. Horowitz E., Sahni S., Anderson S.,””Fundamentals of Data Structures in C”, Computer Scince Press, New York, 1993
2. Horowitz E., Sahni S., Mehta D.,”Fundamentals of Data Structures in C++”, Computer Scince Press, New York, 1995
3. Problem Solving and Program Design in C, 7th Edition. Jeri Hanly and Elliot Koffman, Pearson, 2013
4. Data Structures and Algorithm Analysis in C++. 4th Edition, Mark Allen Weiss, Pearson, 2014


Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Midterm Exam 2 % 52
Assignment 4 % 8
Final examination 1 % 40
Total
7
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Hours for off-the-c.r.stud 4 9 36
Assignments 4 2 8
Preparation for Midterm Exam 2 20 40
General Exam Preparation 1 24 24
Total Work Load   Number of ECTS Credits 5 150

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Understand fundemantals of data structures.
2 Determine space and time complexity of some basic algorithms.
3 Learn the basic concepts for recursive algorithms
4 Specialize in matrix storage(sparse, band, lower/upper triangular matrix)
5 Learn how to use some essential data structures such as stack, queue, singly/doubly linked list
6 Design the efficient algorithms in converting and evaluating infix,prefix,postfix expressions
7 Implement an array-based or a pointer-based linked list and discuss advantage and disadvantage of both implementations
8 Learn the basic concepts of binary tree and graph data structures

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Basic concepts for data structures
2 Performance analysis, space and time complexity
3 Representation of multidimensional arrays
4 Lower/upper triangular, sparse and band matrices
5 Stack and Queue
6 Evaluation of expressions
7 Array-based linked list
8 Midterm exam
9 Linked list applications (stack, queue, hashtable)
10 Doubly Linked Lists
11 Binary Trees
12 Graph representation
13 Midterm exam
14 Data structure examples
15 Final Exam Preparation
16 Final Exam

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12
All 5 5 4 4 2 1 3 3 3 3 1
C1
C2
C3
C4
C5
C6
C7
C8

  Contribution: 1: Very Slight 2:Slight 3:Moderate 4:Significant 5:Very Significant

  
  https://bilsis.hacettepe.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=2687578&lang=en