Wiki Τμήματος Μαθηματικών
Data Structures (MAE681): Διαφορά μεταξύ των αναθεωρήσεων

Data Structures (MAE681): Διαφορά μεταξύ των αναθεωρήσεων

Από Wiki Τμήματος Μαθηματικών
(Νέα σελίδα με '=== General === {| class="wikitable" |- ! School | School of Science |- ! Academic Unit | Department of Mathematics |- ! Level of Studies | Undergraduate |- ! Course Code | MAE541 |- ! Semester | 5 |- ! Course Title | Data Structures |- ! Independent Teaching Activities | Lectures and laboratory exercises (Weekly Teaching Hours: 3, Credits: 6) |- ! Course Type | Special Background |- ! Prerequisite Courses | - |- ! Language of Instruction and Examinations | Greek...')
 
Χωρίς σύνοψη επεξεργασίας
 
(13 ενδιάμεσες αναθεωρήσεις από τον ίδιο χρήστη δεν εμφανίζεται)
Γραμμή 1: Γραμμή 1:
* [[Δομές Δεδομένων (ΜΑΕ681)|Ελληνική Έκδοση]]
{{Course-UnderGraduate-Top-EN}}
{{Menu-OnAllPages-EN}}
=== General ===
=== General ===
{| class="wikitable"
{| class="wikitable"
Γραμμή 16: Γραμμή 20:
! Course Code
! Course Code
|
|
MAE541
MAE681
|-
|-
! Semester
! Semester
|
|
5
6
|-
|-
! Course Title
! Course Title
Γραμμή 46: Γραμμή 50:
|-
|-
! Course Website (URL)
! Course Website (URL)
| -
| See [https://ecourse.uoi.gr/ eCourse], the Learning Management System maintained by the University of Ioannina.
|}
|}
=== Learning Outcomes ===
=== Learning Outcomes ===
{| class="wikitable"
{| class="wikitable"
Γραμμή 88: Γραμμή 93:
|-
|-
! Use of Information and Communications Technology
! Use of Information and Communications Technology
| -
| Yes
Yes
|-
|-
! Teaching Methods
! Teaching Methods
Γραμμή 113: Γραμμή 117:
|
|
Written final exam (70%) comprised of:
Written final exam (70%) comprised of:
• questions about the theory of data structures
* questions about the theory of data structures
• Questions crisis in the form of exercises that require the use of data structures
* Questions crisis in the form of exercises that require the use of data structures
• Exercises testing the understanding of the implementation issues and use of data structures
* Exercises testing the understanding of the implementation issues and use of data structures
Laboratory exercises / midterm (30%)
Laboratory exercises / midterm (30%)
|}
|}
=== Attached Bibliography ===
=== Attached Bibliography ===
* Data structures, algorithms and applications using c ++, Sahnii Sartaj, Publicer A. Tziola (Greek translation)
 
* Algorithms in C ++, parts 1-4: fundamental concepts, data structures, sorting, searching, Robert Sedgewick, Prentice Hall (Greek translation)
<!-- In order to edit the bibliography, visit the webpage -->
* Algorithms in C, parts 1-4: fundamental concepts, data structures, sorting, searching, Robert Sedgewick, Prentice Hall (Greek translation)
<!-- https://wiki.math.uoi.gr/index.php/%CE%A0%CF%81%CF%8C%CF%84%CF%85%CF%80%CE%BF:MAE681-Biblio -->
* Data Structures with C, Nicholas Misirlis (Greek)
 
* Data Structures, Bozanis Panagiotis, Publicer A. Tziola (Greek)
See the official [https://service.eudoxus.gr/public/departments#20 Eudoxus site] or the [https://cloud.math.uoi.gr/index.php/s/62t8WPCwEXJK7oL local repository] of Eudoxus lists per academic year, which is maintained by the Department of Mathematics. Books and other resources, not provided by Eudoxus:
* Michael T. Goodrich, Roberto Tamassia, and David M. Mount, Data Structures and Algorithms in C ++, John Wiley & Sons
 
* Michael Goodrich, Roberto Tamassia, Data Structures and Algorithms in Java, Publicer DIAYLOS
{{MAE681-Biblio}}
* Cormen, Leiserson and Rivest, Introduction to Algorithms, MIT Press, 1990. (there is also a translation from the University of Crete)
* Mark Allen Weiss, Data Structures & Algorithm Analysis in Java, Addison-Wesley
* Clifford A. Shaffer, Data Structures and Algorithm Analysis, ebook, http://people.cs.vt.edu/shaffer/Book/
* Website: opendatastructures.org

Τελευταία αναθεώρηση της 12:31, 15 Ιουνίου 2023

General

School

School of Science

Academic Unit

Department of Mathematics

Level of Studies

Undergraduate

Course Code

MAE681

Semester

6

Course Title

Data Structures

Independent Teaching Activities

Lectures and laboratory exercises (Weekly Teaching Hours: 3, Credits: 6)

Course Type

Special Background

Prerequisite Courses -
Language of Instruction and Examinations

Greek

Is the Course Offered to Erasmus Students

Yes

Course Website (URL) See eCourse, the Learning Management System maintained by the University of Ioannina.

Learning Outcomes

Learning outcomes

The course is an introduction to basic data structures such as strings, arrays, lists, stacks, queues, trees, graphs. It studies properties and implementation issues as well as basic properties on the data structures and their complexity. It also examines basic applications of the above data structures. The main purpose is the design and use of appropriate data structures for storing and retrieving the data of a problem in order for a most efficient processing during the problem solving process. After completing the course the student:

  • Has an understanding of basic data structures and the different ways they can be implemented using a programming language.
  • Can choose appropriate data structures for efficiently storing the data of a problem and their use by an algorithms for solving the problem.
General Competences
  • Working independently
  • Problem data analysis
  • Can use data structures for solving problems in other scientific areas or in the workplace.

Syllabus

  • Elements Of Analysis Of Algorithms
  • Abstract Data Types
  • Strings
  • Arrays
  • Algorithms for Searching, Sorting, Selection
  • Lists (Single Linked Lists, Doubly Linked Lists, Circular Lists, Generalised Lists)
  • Stacks
  • Queues, DeQueues, Priority Queues
  • Trees (General Trees, Binary Trees, Binary Search Trees, Threaded Trees)
  • Heaps
  • AVL-Trees, 2-3 Trees, 2-3-4 Trees, B Trees
  • Directed Graphs, Undirected Graphs
  • Set Manipulation
  • Hashing
  • Dynamic Memory Management

Teaching and Learning Methods - Evaluation

Delivery

Face to face

Use of Information and Communications Technology Yes
Teaching Methods
Activity Semester Workload
Lectures 39
Self study 78
Exercises 33
Course total 150
Student Performance Evaluation

Written final exam (70%) comprised of:

  • questions about the theory of data structures
  • Questions crisis in the form of exercises that require the use of data structures
  • Exercises testing the understanding of the implementation issues and use of data structures

Laboratory exercises / midterm (30%)

Attached Bibliography

See the official Eudoxus site or the local repository of Eudoxus lists per academic year, which is maintained by the Department of Mathematics. Books and other resources, not provided by Eudoxus:

  • Data structures, algorithms and applications using c ++, Sahnii Sartaj, Publicer A. Tziola (Greek translation)
  • Algorithms in C ++, parts 1-4: fundamental concepts, data structures, sorting, searching, Robert Sedgewick, Prentice Hall (Greek translation)
  • Algorithms in C, parts 1-4: fundamental concepts, data structures, sorting, searching, Robert Sedgewick, Prentice Hall (Greek translation)
  • Data Structures with C, Nicholas Misirlis (Greek)
  • Data Structures, Bozanis Panagiotis, Publicer A. Tziola (Greek)
  • Michael T. Goodrich, Roberto Tamassia, and David M. Mount, Data Structures and Algorithms in C ++, John Wiley & Sons
  • Michael Goodrich, Roberto Tamassia, Data Structures and Algorithms in Java, Publicer DIAYLOS
  • Cormen, Leiserson and Rivest, Introduction to Algorithms, MIT Press, 1990. (there is also a translation from the University of Crete)
  • Mark Allen Weiss, Data Structures & Algorithm Analysis in Java, Addison-Wesley
  • Clifford A. Shaffer, Data Structures and Algorithm Analysis, ebook, http://people.cs.vt.edu/shaffer/Book/
  • http://opendatastructures.org/
Ανακτήθηκε από «https://wiki.math.uoi.gr/index.php?title=Data_Structures_(MAE681)&oldid=4592»