aysebastugkoc@uludag.edu.tr, +902242942677, Bursa Uludağ Üniversitesi Gemlik Asım Kocabıyık MYO Bilgisayar Programcılığı-Gemlik/Bursa
18
Website:
19
Objective of the Course:
It is the analysis of algorithms needed in creating mathematical models and any subject containing data, storing information in computer memory and presenting basic data structures designed to access this information.
20
Contribution of the Course to Professional Development
It makes students aware of the structures used for storing and processing data during programming. On the importance of quantitative methods used in software design is settled.
21
Learning Outcomes:
1
Learns algorithm development and analysis methods.;
2
Knows how algorithms measure their performance.;
3
Learns sorting and search methods.;
4
Gains knowledge of data and basic data types.;
5
Learns the basic data structures designed to store and access information in computer memory.;
6
Can solve problems with stack, queue, list, linked list, tree, graph data structures.;
7
It performs all the subjects using a programming language.;
22
Course Content:
Week
Theoretical
Practical
1
Algorithm Development and Algorithm Analysis
2
Basic Data Types, Memory Management and Recursive Algorithms
3
Search Algorithms
4
Sorting Algorithms
5
Lists
6
One-Way and Two-Way Linked Lists
7
Stacks
8
An Overview and Midterm
9
Queues
10
Graph Definition and Representation, Graph Navigating Algorithms
11
Graph Shortest Path Finding Algorithms: Dijktra, Bellman & Ford
12
Trees
13
Binary Tree, Heap Tree, AVL Trees
14
General Tree Applications, Huffman Coding, Lempelziv Coding
23
Textbooks, References and/or Other Materials:
“Data Structures, Past, Present, and Future,” Mark Allen Weiss, Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015. Dr.Rıfat ÇÖLKESEN, "Veri yapıları ve algoritmalar", Papatya yayıncılık, 2002. Lecture Notes.
24
Assesment
TERM LEARNING ACTIVITIES
NUMBER
PERCENT
Midterm Exam
1
40
Quiz
0
0
Homeworks, Performances
0
0
Final Exam
1
60
Total
2
100
Contribution of Term (Year) Learning Activities to Success Grade
40
Contribution of Final Exam to Success Grade
60
Total
100
Measurement and Evaluation Techniques Used in the Course
A midterm and a final exam will be held to check the students' learning in the course.
Information
25
ECTS / WORK LOAD TABLE
Activites
NUMBER
TIME [Hour]
Total WorkLoad [Hour]
Theoretical
14
2
28
Practicals/Labs
0
0
0
Self Study and Preparation
14
2
28
Homeworks, Performances
0
2
28
Projects
0
0
0
Field Studies
0
0
0
Midtermexams
1
3
3
Others
0
0
0
Final Exams
1
3
3
Total WorkLoad
90
Total workload/ 30 hr
3
ECTS Credit of the Course
3
26
CONTRIBUTION OF LEARNING OUTCOMES TO PROGRAMME QUALIFICATIONS
