Special Topics in Theoretical Computer Science (ΠΛ9): Διαφορά μεταξύ των αναθεωρήσεων
Από Wiki Τμήματος Μαθηματικών
Χωρίς σύνοψη επεξεργασίας |
|||
| (7 ενδιάμεσες αναθεωρήσεις από τον ίδιο χρήστη δεν εμφανίζεται) | |||
| Γραμμή 1: | Γραμμή 1: | ||
[[ | * [[Ειδικά Θέματα Θεωρητικής Πληροφορικής (ΠΛ9)|Ελληνική Έκδοση]] | ||
{{Course-Graduate-Top-EN}} | |||
{{Menu-OnAllPages-EN}} | |||
=== General === | === General === | ||
| Γραμμή 50: | Γραμμή 52: | ||
! Learning outcomes | ! Learning outcomes | ||
| | | | ||
* Theoretical Computer Science is the foundation of information science and its main objective is to analyze and solve computational problems that are considered to be the most difficult and most fascinating in the history of mathematics. In addition to the purely mathematical aspect, Theoretical Computer Science offers new and effective techniques for dealing with practical computational problems that arise in all areas of scientific activity. | |||
* The aim of the course is to specialize in areas covered by Theoretical Computer Science, such as Cryptography, Parallel Algorithms, Advanced Scientific Calculations, Approximation Algorithms, Semantics of Programming Languages, Computational Geometry, etc. | |||
* The students of the course are expected to have advanced theoretical and practical skills in a wide range of subjects of vital importance for the Theoretical Computer Science and Mathematics. It will provide students with the opportunity to gain a strong background while exploring applications of Theoretical Computer Science in other areas such as economics, physics and biology. | |||
* The course includes individual exercises, summary writing and presentation of relevant research papers. | |||
* The course material will be adapted and specialized according to the necessary developments and requirements. | |||
|- | |- | ||
! General Competences | ! General Competences | ||
| | | | ||
* Search for, analysis and synthesis of data and information, with the use of the necessary technology | |||
* Working independently | |||
* Team work | |||
* Project planning and management | |||
|} | |} | ||
=== Syllabus === | === Syllabus === | ||
The main objective of the course is the specialization in areas covered by Theoretical Computer Science such as: | |||
* Cryptography | |||
* Parallel Algorithms | |||
* Advanced Scientific Calculations | |||
* Approximation Algorithms | |||
* Programming Languages Semantics | |||
* Computational Geometry | |||
* Algorithm Engineering | |||
The course matterial will be adapted and specialized according to the necessary developments and requirements. | |||
=== Teaching and Learning Methods - Evaluation === | === Teaching and Learning Methods - Evaluation === | ||
| Γραμμή 67: | Γραμμή 84: | ||
! Delivery | ! Delivery | ||
| | | | ||
Lectures | |||
|- | |- | ||
! Use of Information and Communications Technology | ! Use of Information and Communications Technology | ||
| | | | ||
Use of projector and interactive board during lectures. | |||
|- | |- | ||
! Teaching Methods | ! Teaching Methods | ||
| Γραμμή 82: | Γραμμή 99: | ||
| 39 | | 39 | ||
|- | |- | ||
| | | Working independently | ||
| | | 78 | ||
|- | |- | ||
| | | Exercises - Homework | ||
| | | 70.5 | ||
|- | |- | ||
| Course total | | Course total | ||
| Γραμμή 94: | Γραμμή 111: | ||
! Student Performance Evaluation | ! Student Performance Evaluation | ||
| | | | ||
* Written exercises (50%) | |||
* Essay / report (20%) | |||
* Public presentation (30%) | |||
|} | |} | ||
| Γραμμή 100: | Γραμμή 119: | ||
<!-- In order to edit the bibliography, visit the webpage --> | <!-- In order to edit the bibliography, visit the webpage --> | ||
<!-- https://wiki.math.uoi.gr/index.php/%CE%A0%CF%81%CF%8C%CF%84%CF%85%CF%80%CE%BF: | <!-- https://wiki.math.uoi.gr/index.php/%CE%A0%CF%81%CF%8C%CF%84%CF%85%CF%80%CE%BF:MAM173-Biblio --> | ||
{{ | {{MAM173-Biblio}} | ||
Τελευταία αναθεώρηση της 05:17, 16 Ιουνίου 2023
- Ελληνική Έκδοση
- Graduate Courses Outlines
- Outline Modification (available only for faculty members)
- Department of Mathematics
- Save as PDF or Print (to save as PDF, pick the corresponding option from the list of printers, located in the window which will popup)
General
| School | School of Science |
|---|---|
| Academic Unit | Department of Mathematics |
| Level of Studies | Graduate |
| Course Code | ΠΛ9 |
| Semester | 1 |
| Course Title | Special Topics in Theoretical Computer Science |
| Independent Teaching Activities | Lectures (Weekly Teaching Hours: 3, Credits: 7.5) |
| Course Type | Elective |
| Prerequisite Courses |
641 - Design and Analysis of Algorithms |
| Language of Instruction and Examinations |
Greek |
| Is the Course Offered to Erasmus Students | Yes (in English) |
| Course Website (URL) | See eCourse, the Learning Management System maintained by the University of Ioannina. |
Learning Outcomes
| Learning outcomes |
|
|---|---|
| General Competences |
|
Syllabus
The main objective of the course is the specialization in areas covered by Theoretical Computer Science such as:
- Cryptography
- Parallel Algorithms
- Advanced Scientific Calculations
- Approximation Algorithms
- Programming Languages Semantics
- Computational Geometry
- Algorithm Engineering
The course matterial will be adapted and specialized according to the necessary developments and requirements.
Teaching and Learning Methods - Evaluation
| Delivery |
Lectures | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Use of Information and Communications Technology |
Use of projector and interactive board during lectures. | ||||||||||
| Teaching Methods |
| ||||||||||
| Student Performance Evaluation |
|
Attached Bibliography
- Ζάχος, Ε., Παγουρτζής, Α., Σούλιου, Θ., Θεμελίωση επιστήμης υπολογιστών. Αποθετήριο «Κάλλιπος», 2015.
- Christos Papadimitriou, Computational Complexity, 1998.
- J. Kleinberg and E. Tardos, Σχεδιασμός Αλγορίθμων, Εκδόσεις Κλειδάριθμος, 2008.
- T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Εισαγωγή στους Αλγορίθμους, Πανεπιστημιακές Εκδόσεις Κρήτης, 2012.