Computer ScienceIntermediate

Data Structures and Algorithms

Master the fundamental building blocks of efficient software: arrays, trees, graphs, sorting, and searching.

Instructor
Prof. Alan Turing Jr.
Duration
10 weeks
Modules
4
$189

What You'll Learn

  • Implement common data structures from scratch
  • Analyze time and space complexity
  • Choose appropriate algorithms for specific problems

Prerequisites

  • • Programming fundamentals in any language

Course Curriculum

1

Arrays and Linked Lists

Linear data structures and their applications

2 weeks
Topics Covered:
  • •Arrays
  • •Linked Lists
  • •Stacks
  • •Queues
2

Trees and Graphs

Hierarchical and network data structures

3 weeks
Topics Covered:
  • •Binary Trees
  • •BST
  • •AVL Trees
  • •Graph Theory
  • •DFS/BFS
3

Sorting and Searching

Efficient algorithms for organizing and finding data

2 weeks
Topics Covered:
  • •QuickSort
  • •MergeSort
  • •Binary Search
  • •Hashing
4

Algorithm Design

Dynamic programming, greedy algorithms, and complexity

3 weeks
Topics Covered:
  • •Big O Notation
  • •DP
  • •Greedy
  • •Divide & Conquer

Ready to Begin Your Journey?

Join the NextXus Federation's mission to elevate human knowledge for the next 200 years.

Made with Emergent