everything.study
SFWRTECH 4DS3

Data Structures and Algorithms

Undergraduate

Fall 2026 · C01

Readings

  • Introduction To Algorithms Ed: 4
    Cormen · 4 · Suggested
    ISBN 9780262046305
  • eText Introduction To The Design And Analysis Of Algorithms 6 Month Access
    Levitin · Suggested
    ISBN 9780133001365
Fall 2025 · C01

Readings

  • Introduction To Algorithms Ed: 4
    Cormen · 4 · Suggested
    ISBN 9780262046305
Spring 2022

Topics

  • Tools analyze
  • Common tools
  • Counting primitive operations
  • Asymptotic analysis with Big- Oh (and its relatives
  • Detailed analysis of recursive algorithms is provided
  • Complexity analysis
  • NP hard
  • Complete problems
  • Linked lists
  • Utility of trees
  • Heap sorting) is described and analyzed
  • Sorting with divide and conquer approaches
  • Merge and quick sort are detailed
  • Included breadth

Readings

  • Optional: Introduction to Algorithms (3rd Edition); Cormen, Leiserson, Rivest, Stein; ISBN 9780262033848
    Cormen, Leiserson, Rivest, Stein · 3rd Edition · optional
    ISBN 9780262033848
Sources