{"id":4168,"date":"2026-01-16T09:32:45","date_gmt":"2026-01-16T09:32:45","guid":{"rendered":"https:\/\/devserver.admin.uoc.gr\/damsl\/?page_id=4168"},"modified":"2026-01-16T10:11:48","modified_gmt":"2026-01-16T10:11:48","slug":"damsl-090-data-structures","status":"publish","type":"page","link":"https:\/\/mscs.uoc.gr\/damsl\/damsl-090-data-structures\/","title":{"rendered":"DAMSL-090 Data Structures"},"content":{"rendered":"\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\tType<\/strong>
\n\nPreparatory<\/strong>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\tCourse Code<\/strong>
\n\nDAMSL-090<\/strong>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\tTeaching Semester<\/strong>
\n\nA semester<\/strong>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\tECTS Credits<\/strong>
\n\n5<\/strong>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
Student Performance Evaluation<\/h6>

Homework and\/or Lab Assignments, Final exam\/project<\/p><\/div><\/div><\/div>

Prerequisite Courses<\/h6>

Python Programming<\/p><\/div><\/div><\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t

\n\t\t\t\t\t
\n\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
Syllabus<\/span><\/h6>
  • Introduction to the concept of data structure (representation of data in memory, different ways of organizing it, the structure as a basis for algorithmic techniques)<\/li>
  • Introduction to complexity and its importance as an analysis tool<\/li>
  • Introduction to the Python language<\/li>
  • Tables<\/li>
  • Stacks and queues.<\/li>
  • Linked lists, singly linked, doubly linked, circular lists<\/li>
  • The concept of sorting and simple algorithms<\/li>
  • Trees (binary trees, binary search trees, etc.)<\/li>
  • Hash table<\/li>
  • Structures in graph form<\/li><\/ul><\/div><\/div><\/div>
    \u00a0<\/div><\/div><\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t
    Learning Outcomes<\/span><\/h6>
    • Understanding the concept of data structure.<\/li>
    • Implementation of different structures<\/li>
    • Evaluation of their characteristics<\/li>
    • Understanding of basic algorithmic features.<\/li>
    • Perception of the suitability or otherwise of a structure for a computational problem<\/li>
    • Ability to use the above skills to solve computational problems<\/li>
    • Basic use of Python to implement computing solutions<\/li><\/ul><\/div><\/div><\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
      \n\t\t\t\t\t
      \n\t\t\t\t
      \n\t\t\t\t
      \n\t\t\t\t\t\t\t
      \n\t\t\t
      <\/div>\n\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

      Type PreparatoryCourse Code DAMSL-090Teaching Semester A semesterECTS Credits 5 Student Performance Evaluation Homework and\/or Lab Assignments, Final exam\/project Prerequisite Courses Python Programming Syllabus Introduction to the concept of data structure (representation of data in memory, different ways of organizing it, the structure as a basis for algorithmic techniques) Introduction to complexity and its importance as an analysis tool Introduction to the Python language Tables Stacks and queues. Linked lists, singly linked, doubly linked, circular lists The concept of sorting and simple algorithms Trees (binary trees, binary search trees, etc.) Hash table Structures in graph form \u00a0 Learning Outcomes Understanding the concept of data structure. Implementation of different structures Evaluation of their characteristics Understanding of basic algorithmic features. Perception of the suitability or otherwise of a structure for a computational problem Ability to use the above skills to solve computational problems Basic use of Python to implement computing solutions<\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"inline_featured_image":false,"footnotes":""},"class_list":["post-4168","page","type-page","status-publish","hentry","post-no-thumbnail"],"acf":[],"_links":{"self":[{"href":"https:\/\/mscs.uoc.gr\/damsl\/wp-json\/wp\/v2\/pages\/4168","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mscs.uoc.gr\/damsl\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mscs.uoc.gr\/damsl\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mscs.uoc.gr\/damsl\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/mscs.uoc.gr\/damsl\/wp-json\/wp\/v2\/comments?post=4168"}],"version-history":[{"count":16,"href":"https:\/\/mscs.uoc.gr\/damsl\/wp-json\/wp\/v2\/pages\/4168\/revisions"}],"predecessor-version":[{"id":4197,"href":"https:\/\/mscs.uoc.gr\/damsl\/wp-json\/wp\/v2\/pages\/4168\/revisions\/4197"}],"wp:attachment":[{"href":"https:\/\/mscs.uoc.gr\/damsl\/wp-json\/wp\/v2\/media?parent=4168"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}