Data Structures

Learning Outcomes

Upon successful completion of the course, the student is able to:

• Manage and implement complex programs concerning data files of all types, i.e. text files, records and indexed files.
• Understand the structure, nature and use of fundamental data structures including Arrays, Linked Lists, Stacks, Queues, Trees
• Implement data structures in C/C++/Python.
• Design and implement large and complex problems using the structures.

Indicative Module Content

• Estimating a program’s performance (an introduction)
• Data file management (text files, binary, indexed)
• Arrays:
  • sorting algorithms (bubble, selection, insertion, merge quick),
  • searching algorithms (sequential search, binary, Fibonacci)
• Data Structures: Stack, Queue, List, Trees, Graphs
• Priority queues