Tuesday, January 9th, 2024
Great are they who see that spiritual is stronger than any material force, that thoughts rule the world.
— Ralph Waldo Emerson
ECS165A Lecture 1: Overview
- syllabus
- textbooks
- @ramakrishnanDatabaseManagementSystems2003
- find a better quality PDF
- @sadoghiTransactionProcessingModern2022
- @sadoghiLStoreRealtimeOLTP2018
- additional/optional papers
- @ramakrishnanDatabaseManagementSystems2003
- project/milestones
- team of exactly 5
- design carefully before coding to avoid rearchitecturing during later milestones
- top 3 performant teams get bonus points
- sample test case/data available (bare minimum testing)
- Zoom oral eval (group presentation) 50% of grade
ECS122A Lecture 1: Overview
- expected skills (quiz 1)
- proof by induction
- code runtime analysis
- limit lemma
- big-O notation
- basic data structures: list, stack, queue, heap, disjoint set
- graph: BFS, DFS, MST, shortest path
- primitive operation
- basic code runtime analysis examples
- Basic algorithm analysis
- Does it halt?
- Is it correct?
- Is it optimal?
- Memory usage?
- Data structure used in communication
- notating algorithm running time
- prove big-O relationship
- See lecture 1 slides 24-25 for examples.
- limit lemma