syllabus.md

Data Structures & Algorithms 1 (DSA 1) Syllabus

• Week 1: Introduction

  • Introduction
    • What is DSA?
    • C/C++ Differences
  • BigO Notation
  • C++ STL
  • Recursion
  • Searching Algorithms -Linear Search -Binary Search

• Week 2: Linked List

  • Singly Linked List
  • Doubly Linked List
  • Cyclic Linked List
  • Sentinels
  • Question Session

• Week 3: Stack, Queue, Recursion

  • Stack
    • Stack basics
    • Ex: Parentheses
    • Call Stack
  • Recursion
    • Call Stack (cont.)
    • Recursive basics
    • Ex: Generating Combinations
    • Ex: Towers of Hanoi
  • Queue
    • Queue basics
    • Ex: Implement a queue using stacks
    • Ex: Implement a stack using queues

• Week 4: Tree

  • Graph introduction
  • Trees basics
    • Tree Traversals
    • Ex: Operating systems file ops.
    • Ex: Reverse Polish Notation
  • Binary Search
    • Binary Search Trees

• Week 5: Graphs

  • Graph introduction
  • Graph Algorithms
    • DFS
    • BFS
    • Ex: Number of islands

• Week 6: STL Data Structures

  • Heap
  • Set
  • Map
  • Hashmap