BTS531
ALGORITHMS
- Course Code
- BTS531
- Semester
- -
- Theory+Practice
- 3 + 0
- ECTS
- 10
| Course Type | Elective Course | ||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Course Level | Master's Degree Without Thesis | ||||||||||||||||||||||||||||||
| Year of Study | - | ||||||||||||||||||||||||||||||
| Semester | - | ||||||||||||||||||||||||||||||
| ECTS | 10 | ||||||||||||||||||||||||||||||
| Name of Lecturer(s) | - | ||||||||||||||||||||||||||||||
| Learning Outcomes |
At the end of this course, the students;
|
||||||||||||||||||||||||||||||
| Mode of Delivery | Face to face | ||||||||||||||||||||||||||||||
| Prerequisites | No | ||||||||||||||||||||||||||||||
| Recommended Optional Programme Components | There is no recommended optional programme component for this course. | ||||||||||||||||||||||||||||||
| Course Description | The Role of Algorithms in Computing, Growth of Functions, Recurrences, Probabilistic Analysis and Randomized Algorithms, Sorting and Order Statistics, Heapsort, Quicksort, Sorting in Linear Time, Medians and Order Statistics, Data Structures, Elementary Data Structures, Hash Table, Binary Search Trees, Red-Black Trees, Augmenting Data Structures, Advanced Design and Analysis Techniques, Dynamic Programming, Greedy Algorithms, Amortized Analysis, Advanced Data Structures, B-Trees, Binomial Heaps, Fibonacci Heaps, Data Structures for Disjoint Sets, Graph Algorithms, Elementary Graph Algorithms, Minimum Spanning Trees, Single-Source Shortest Paths, All-Pairs Shortest Paths, Maximum Flow, Selected Topics, Sorting Networks, Matrix Operations, Linear Programming, Polynomials and the FFT, Number-Theoretic Algorithms, String Matching, Computational Geometry, NP-Completeness, Approximation Algorithms. | ||||||||||||||||||||||||||||||
| Course Contents |
|
||||||||||||||||||||||||||||||
| Recommended or Required Reading | 1. Timur Karaçay, Java Veri Yapıları, Oracle yayınları, 2011. 2. William Joseph Collins. Data structures and the Java collections framework, McGraw-Hill, 2001. 3. N.B. Dale, D.T. Joyce, and C. Weems. Object-oriented data structures using Java. Jones and Bartlett, London, 2006. 4. Peter Drake. Data structures and algorithms in Java. Prentice Hal, 2006. 5. W. Ford and W.R Topp. Data structures with Java. Prentice Hall, 2004. 6. M.T. Goodrich and Roberto Tamassia. Data Structures and Algorithms in Java. John Wiley and Sons, London, 1960. 7. Simon Gray. Data Structures in Java: From Abstract Data Types to the Java Collections Framework. Addison Wesley, 2006. 8. S. James and M. Gray. Data structures in Java: from abstract data types to the Java Collections Framework. Pearson Addison-Wesley, 2007. 9. Robert Lafore. Data Structures and Algorithms in Java. Sams, 2002. 10. Robert Sedgewick. Algorithms in Java. Addison-Wesley, 2003. 11. Mark Allen Weiss. Data structures and algorithm analysis in Java. Peason Addison-Wesley, 2007. 12. Web sources. | ||||||||||||||||||||||||||||||
| Planned Learning Activities and Teaching Methods |
| ||||||||||||||||||||||||||||||
| Assessment Methods and Criteria | |||||||||||||||||||||||||||||||
| Language of Instruction | Turkish | ||||||||||||||||||||||||||||||
| Work Placement(s) | No |
Programme Qualifications / Learning Outcomes
| LO1 | LO2 | |
|---|---|---|
| K1 | X | X |
| K2 | X | |
| K3 | ||
| K4 | X | |
| K5 | X | |
| K6 | X | |
| K7 | X | |
| K8 | X | |
| K9 | X | |
| K10 | X | |
| K11 |