Algorithms and Complexity


The course covers the algorithm theory and essentials of their computational complexity.

Objectives

• The learning outcome and goal is the knowledge of complex techniques for problems solving and an intro to their complexity. • With the completion of the topic the students will be able to: 1. Solve complex problems, 2. Compute their computational of complexity, 3. Improve the solution of a problem, 4. Use algorithmic techniques, 5. Solve tree and graph oriented problems.

Prerequisites

No prerequisites.

Syllabus

1. Definitions and terminology, 2. Introduction to computational complexity, 3. Improving the 2-d maxima algorithm, 4. Recursive algorithms, 5. Divide and conquer, 6. Dynamic programming, 7. Greedy algorithms, 8. Parallel algorithms, 9. Trees, 10. Graphs, 11. Hash tables, 12. P and NP classes

COURSE DETAILS

Level:

Type:

Undergraduate

(A+)

Instructors: Ilias Savvas
Department: Department of Computer Science and Engineering
Institution: TEI of Thessaly
Subject: Computer Science, Information Technology, Telecommunications
Rights: CC - Attribution-NonCommercial-NoDerivatives

Visit Course Page

SHARE THIS COURSE
RELATED COURSES

,
Eastern Macedonia and Thrace Institute of Technologie

VASSILIS
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Konstandinos Randos
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Ioannis Chalamanis
Eastern Macedonia and Thrace Institute of Technologie
Computer and Informatics Engineering

Dimitrios Katevas
Eastern Macedonia and Thrace Institute of Technologie
COMPUTER AND INFORMATICS ENGINEERING

Dimitrios Pogaridis
Eastern Macedonia and Thrace Institute of Technologie
COMPUTER AND INFORMATICS ENGINEERING

espa en
GUnet

© Copyright 2016 - GUnet