Παρουσίαση/Προβολή

Εικόνα επιλογής

Data Structures and Algorithms

() -  Paraskevi Fragopoulou, Giannis Xezonakis

Περιγραφή Μαθήματος

Brief Course Description

The course commands a central role in computer science in both theoretical and practical levels, in many cases covering themes beyond the subject of informatics. The course strives for students to understand fundamental ways of data organization in computer memory and to learn and implement techniques for the handling of that data. Special attention is placed on creating new data algorithms with an obvious result on the dexterities of students to handle such problems.

 
Specific Topis 
  • Algorihm Analysis
  • Sorting, Sets, Selection
  • Basic Data Structures
  • Advanced Data Structure
  • Fundamental Programming Techniques
  • Graphs
  • Graph Algorithms
  • Weigthed Graphs

 

Selected topics from the following list

  • Network Flow and Matching
  • String Matching
  • Number Theory and Cryptography
  • Computational Geometry
  • NP completness
 
Main textbook 
  • M.T. Goodrich, R. Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples, John Wiley & Sons.
 
Suggested bibliography
  • T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, MIT Press, 3rd Edition.
  • Dasgupta, C. H. Papadimitriou, and U. V. Vazirani, Algorithms, MC Graw Hill Higher Education Edition.
  • C. H. Papadimitriou, Keneth Steinglitz, Combinatorial Optimization, Dover Publications.

Ημερομηνία δημιουργίας

Τρίτη 3 Δεκεμβρίου 2019

Σελίδα μαθήματος