BSc:Advanced Algorithms

Advanced Algorithms

• Course name: Advanced Algorithms
• Course number: XYZ
• Knowledge area: Algorithms and Complexity, Programming Languages, Software Development Fundamentals

Administrative details

• Faculty: Computer Science and Engineering
• Year of instruction: 4th year of BS
• Semester of instruction: 2nd semester
• No. of Credits: 4 ECTS
• Total workload on average: 144 hours overall
• Class lecture hours: 2 per week
• Class tutorial hours: 2 per week
• Lab hours: 2 per week
• Individual lab hours: 0
• Frequency: weekly throughout the semester
• Grading mode: letters: A, B, C, D

Prerequisites

• Data Structures and Algorithms I
• Data Structures and Algorithms II

Course outline

Advance Algorithms is a fundamental and important part of computer engineering. This course introduces different methodologies used to solve real world problems. Limitations on solving problems efficiently are also analyzed critically, with emphasis on NP-Complete problems and the theory of complexity. In depth coverage will be made regarding Dynamic Programming and Greedy Algorithms. We shall try to solve various problems using different techniques and shall establish important relationships between algorithms belonging to different categories.

Expected learning outcomes

This course will train you to apply advance techniques and algorithms to solve the real-world problem. After this course, you will be able to:

• Analyze the nature of the problem and formulate the solution
• Understand advanced theories and techniques
• Sound knowledge about the core of algorithms
• Exposure to NP-complete problems
• Design an appropriate algorithm and analysis for the problem at hand

Expected acquired core competences

• Complexity
• Algorithmic design
• Addressing high-complexity (NP-complete) problems

Required computer resources

Not applicable

Evaluation

• 10% Homework
• 20% Quiz
• 25% Midterm Exam
• 40% Final Project