COMP.CS.300 Data Structures and Algorithms 1¶

Course week 1 - Algorithms & pseudocode
- Course week 1
- Q&A attendance
Course week 2 - Measuring efficiency
- Course week 2
  - Self-study (in English)
  - Submit weekly exercises
- Course week 2 exercises
- Exercises for the week 3 exercise session
  - Exercise 1
  - Exercise 2
- Attendance and participation on the weekly exercise session
- Q&A attendance
Course week 3 - Divide-and-conquer
- Course week 3
  - Self-study (videos and slides in english)
  - Submit weekly exercises
- Course week 3 exercises
  - Performance
- Sum as a recursion
- Sum of digits as a recursion
- Exercises for the week 4 exercise session
  - Exercise 1
  - Exercise 2
- Attendance and participation on the weekly exercise session
- Q&A attendance
Course week 4 - Big-O, -Omega and -Theta
- Course week 4
  - Self-study
  - Submit weekly exercises
- Course week 4 exercises
  - Iteration vs. recursion
- Search the smallest missing
  - Quicksort
  - Mergesort
- Exercises for the week 5 exercise session
  - Exercise 1
  - Exercise 2
- Attendance and participation on the weekly exercise session
- Q&A attendance
Course week 5 - STL library
- Course week 5
  - Self-study (english videos and slides)
  - Submit weekly exercises
- Course week 5 exercises
  - big-O notation
  - Calculating asymptotic efficiency
- Drilling algorithms & complexities
- Exercises for the week 6 exercise session
- Attendance and participation on the weekly exercise session
- Q&A attendance
Course week 6 - STL algorithms
- Week 6 of the course
- Course week 6 exercises
  - Iterators
  - STL containers
- Estimating asymptotic efficiency
- Student git repositories
- Hello Gitlab
- Course-upstream to pull new instructions
- Practise iteration
- Iteration
- Exercises for the week 7 exercise session
  - Task 1
  - Task 2
- Attendance and participation on the weekly exercise session
- Q&A attendance
Course week 7 - Trees
- Week 7 of the course
- Course week 7 exercises
- Exercises for the week 8 exercise session
  - Task 1
- Attendance and participation on the weekly exercise session
- Q&A attendance
Course week 8 - Amortized complexity
- Week 8 of the course
- Course week 8 exercises
- Valgrind
  - Valgrind, the memory management analyser
  - Exercising valgrind
- Exercises for the week 9 exercise session
  - Task 1
- Exercise session registration
- Q&A attendance
- Grading, learning, motivation
Course week 9 - Heaps
- Week 9 of the course
- Course week 9 exercises
- Exercises for the week 10 exercise session
- Exercise session registration
- Q&A attendance
Course week 10 - Graphs, BFS, DFS
- Course week 10
  - Self-study
  - Submit weekly exercises
- Course week 10 exercises
- Exercises for the week 11 exercise session
  - Task 1
- Exercise session registration
- Q&A attendance
Course week 11 - Weighted graphs, Dijkstra, A*
- Course week 11
- Course week 11 exercises
  - Breadth First Search
  - Depth First Search
- Exercises for the week 12 exercise session
  - Task 1
  - Task 2
- Exercise session registration
- Q&A attendance
Course week 12 - Hashtables
- Course week 12
- Course week 12 exercises
  - Dijkstra’s algorithm
- Exercises for the week 13 exercise session
  - Task 1
- Exercise session registration
- Q&A attendance
Course week 13 - Balanced binary trees
- Course week 13
- Course week 13 exercises
  - Open Hashing
  - Hash tables
- Exercises for the week 14 exercise session
  - Task 1
  - Task 2 - Project 2 orienting questions
- Submit Project 1 for peer-review
- Exercise session registration
- Q&A attendance
Course week 14 - Revision
- Course week 14
  - Blooper collection (mostly in Finnish)
- Revision
  - Revision
- Peer-review of Project1
- Q&A attendance
Material and info
- General info
  - Plussa
  - Weekly timetable
  - Grading
  - Staff
- Theory: lecture videos, lecture-questions, and discussion (Q&A) sessions
- Weekly exercises and exercise sessions
  - Exercise times and places
- Programming assigments and programming environments
- General info
- Programming environment
- Compiling, testing, and submitting programming assignments
- Electronic exam
  - Exam windows for this course
  - Enrolling to an exam
- Material
  - The following books are good references:
  - Other useful sources
- Glossary
- Teams online discussion forum
- Course staff
Programming project 1 - the specification and orienting questionnaires
- Project 1 documentation
  - Homework exercises to be returned by the deadline of this module
- Prg1 starting exercises
  - PRG1 instructions
  - PRG1 instructions on testing
Project 1 graders (compulsory)
- Assignment graders
Project 1 graders (optional)
- Optional graders
Programming project 2
- Project 2 documentation
Project 2 graders (compulsory)
- Assignment graders (compulsory)
Project 2 graders (optional)
- Assignment graders (optional)
Points registered by personnel: videos, exam
- Watching lecture videos - part1
- Watching lecture videos - part2
- Exam
Finally
- Peer feedback
- Peer review validator
- Grading, learning, motivation, the end survey