Computer Science course

Data Structures & Algorithms

Master algorithmic problem solving and optimal data organization.

Computer Science
Intermediate

Course overview

Data Structures and Algorithms (DSA) form the foundation of efficient software and coding interviews. This course teaches how to analyze time and space complexity with Big-O notation, select optimal data structures, and solve problems using searching, sorting, recursion, trees, and graph algorithms.

Prerequisites

Good foundation in Python
C++
Java
or JavaScript.

What you'll achieve

  • Analyze time and space complexity using Big-O notation
  • Implement and manipulate fundamental data structures from scratch
  • Solve algorithmic problems using recursion, two-pointer, and sliding window techniques
  • Understand tree traversals (BST) and graph search algorithms (BFS, DFS)

Curriculum

  1. 1Algorithmic analysis & Big-O time/space complexity
  2. 2Linear structures: Dynamic arrays & Linked Lists (Singly & Doubly)
  3. 3Stacks and Queues: Implementations and classic applications
  4. 4Recursion, backtracking & divide-and-conquer strategy
  5. 5Sorting & searching: Merge sort, Quick sort, Binary search
  6. 6Hash tables, collision resolution & set operations
  7. 7Trees: Binary Search Trees (BST), traversals (Pre, In, Post, Level-order)
  8. 8Graph representations, Breadth-First Search (BFS) & Depth-First Search (DFS)

Who is this for?

Computer science university students and developers preparing for technical coding interviews.

Contact admissions for current fee and available learning formats

Enrol in Data Structures & Algorithms

  • 10 weeks
  • Intermediate
  • Live online · One-to-one available · Group batches when scheduled
  • 1-on-1 & small batches
Apply for this course Request Free Demo Have questions? Ask on WhatsApp

Ready to start your learning journey?

Apply today and our admissions team will review your application and guide you through the next steps.