Singapore University of Social Sciences

Data Structures and Algorithms I (MTH251)

Synopsis

MTH251 will provide students with an understanding of the common algorithms and data structures used in information technology. The topics covered are of central importance for many applications in data analytics and information technology. The course gives a comprehensive introduction to algorithm analysis, basic data types such as stacks, queues and trees and how these data types are implemented with linked lists. Codes will be written and presented in Python.

Level: 2
Credit Units: 5
Presentation Pattern: Every January

Topics

  • Algorithm Analysis
  • Asymptotic Analysis
  • Analysing Recursive Algorithms
  • Designing Recursive Algorithms
  • Array-Based Sequences
  • Multidimensional Data Sets
  • Stacks
  • Queues
  • Linked Lists
  • Positional Lists
  • Trees
  • Tree Traversal Algorithms

Learning Outcome

  • Apply data structures to store and process information
  • Analyze the efficiency of different algorithms
  • Demonstrate advantages and disadvantages of specific algorithms and data structures
  • Identify basic data structures and summarise their typical uses, strengths and weaknesses
  • Determine bugs in program codes
  • Solve problems computationally through the application of basic data structures and algorithms
Back to top
Back to top