CS 50010 Module 1 - Foundational Principles of Information Security
Syllabus

Assignments


Assignment 1
Assignment 2
Assignment 3
Assignment 4

Slides


Lecture 1 - Logic and Proofs
Lecture 2 - Sets and Limits
Lecture 3 - Asympotics, Stacks, Queues
Lecture 4 - Union-find, recursion, master theorem
Lecture 5 - Graphs and Trees
Lecture 6 - BFS, DFS, Dijkstra
Lecture 7 - BST, Traversals, Hashing
Lecture 8 - 2-3 Trees, Red Black Trees
Lecture 9 - Heaps (part 1, part 2)
Lecture 10 - Greedy Algorithms
Lecture 11 - Randomized Algorithms
Lecture 12 - Complexity
Lecture 13 - Undecidability

Projects


Project 1
Project 2

Practice Exam