Algorithms and Data Structure (Laboratory)

Module Information

Module Semester:
3
Module Part:
Laboratory
Sub-Module Code:
245305
Hours per Week:
2
Module ECTS Credits:
5.5
Available to ERASMUS Students:
No
Module Staff:


Module Objective

The purpose of the course is for the students to understand, the construction and use of the main Data Structures and Algorithms (DSA) used in the programming and construction software and affecting its performance. Analyzed those DSA which use at least one of them is required to construct and operate any appreciable program.


Module Study Targets

The learning outcomes of the theoretical part are the following:

  • Describe the use of the main Data Structures and Algorithms (DSA)
  • Develop software
  • Analyze Algorithms
  • Make mental Data types
  • Create lists, stacks
  • Analyze queues, Dual Queues
  • Implement search trees
  • Recognize fragmentation tables
  • Evaluate the search algorithms and classification


Module Acquired Abilities

  • Search, analysis and data synthesis
  • Autonomous work


Module Description

  • Introduction, Analysis of Algorithms
  • Mental Data Types
  • Alphanumeric (Strings), Vectors
  • Lists, Stacks
  • Queues, Dual Queues
  • Trees, Search Trees
  • Fragmentation tales
  • Searching Algorithms and Orders

Module Student Evaluation

Students’ evaluation comprises of the :

  • Theoretical part (60%) and
  • laboratory (40%)


Bibliography

  • [Preiss, Java] Bruno R. Preiss, "Data Structures and Algorithms with Object-Oriented Design Patterns in Java", 1998
  • [Sedgewick, Java] Robert Sedgewick, "Algorithms in Java", Third Edition, PARTS 1-4, FUNDAMENTALS DATA STRUCTURES SORTING SEARCHING, 2002
  • [Sedgewick, C++] Robert Sedgewick, "Algorithms in C++", Third Edition, PARTS 1-4, FUNDAMENTALS DATA STRUCTURES SORTING SEARCHING, 1998
  • Niklaus Wirth, "Algorithms & Data Structures", Prentice-Hal, 1986

Module Links