Abbottabad University of Science & Technology · Free online courses for AUST students

Data Structures and Algorithms

Uncategorized
Wishlist Share

About Course

This course is the online companion to CS-301 Data Structures and Algorithms (3+1 credit hours). You will implement the core linear and non-linear data structures, choose the right one for a problem, and analyse the cost of searching and sorting algorithms with asymptotic notation.

Each topic has video lectures, downloadable notes and a short quiz. Pass the final assessment to complete the course and earn your certificate.

What Will You Learn?

  • Implement linked lists, stacks and queues
  • Build and traverse binary search trees
  • Choose the right data structure for a problem
  • Analyse searching and sorting algorithms with Big O notation

Course Content

Linear Data Structures
Storing sequences with arrays and linked lists, and processing them in order with stacks and queues.

  • Linked Lists
    00:00
  • Stacks and Queues
    00:00
  • Linear Data Structures Quiz

Trees and Algorithm Analysis
Binary search trees, and measuring how searching and sorting algorithms scale with Big O notation.

Final Assessment
Covers every topic. Score at least 60% to complete the course and earn your certificate.