COMP.CS.300 Data Structures and Algorithms 1¶
- Material and info
- General info
- Theory: lecture videos and questions related to the videos
- Module exercises and exercise sessions
- Programming assigments and programming environments
- General info
- Programming environment
- Compiling, testing, and submitting programming assignments
- Electronic exam
- Material
- Glossary
- Week01 - Glossary
- Viikko01 - Sanasto
- Week02 - Glossary
- Viikko02 - Sanasto
- Week03 - Glossary
- Viikko03 - Sanasto
- Week04 - Glossary
- Viikko04 - Sanasto
- Week05 - Glossary
- Viikko05 - Sanasto
- Week06 - Glossary
- Viikko06 - Sanasto
- Week07 - Glossary
- Viikko07 - Sanasto
- Week08 - Glossary
- Viikko08 - Sanasto
- Week09 - Glossary
- Viikko09 - Sanasto
- Week10 - Glossary
- Viikko10 - Sanasto
- Week11 - Glossary
- Viikko11 - Sanasto
- Week12 - Glossary
- Viikko12 - Sanasto
- Week13 - Glossary
- Viikko13 - Sanasto
- Course staff
- Git
- Algorithms, pseudocode and efficiency
- Decrease- and divide-and-conquer
- Course topics 3 and 4
- Course topic 4
- Course topic 3 exercises
- Sum as a recursion
- Sum of digits as a recursion
- Course topic 4 exercises
- Search the smallest missing
- Programming project 1
- Session activity
- Exercises for the week 3 exercise session
- Attendance and participation on the weekly exercise session
- STL library
- Course topics 5, 6 and 7
- Week 6 of the course
- Course topic 5 exercises
- Drilling algorithms & complexities
- Course topic 6 exercises
- Estimating asymptotic efficiency
- Practise iteration
- Iteration
- Course topic 7 exercises
- Opening the project in Qt Creator (In remote desktop server)
- Testing your functions
- STL-algorithm 1, sort asc
- STL-algorithm 2, sort desc
- STL-algorithm 3, find a given value
- STL-algorithm 4, find the last even value
- STL-algorithm 5, sort mod 3
- STL-algorithm 6, find value from a map
- STL-algorithm 7, find median
- STL-algorithm 8, remove values
- Grading, learning, motivation
- Session activity
- Activities
- Attendance and participation on the weekly exercise session
- Trees (e.g. heaps)
- Graphs
- Sets and maps
- Last activity
- PRG1
- PRG1-OPT
- PRG2
- PRG2-OPT
- Peer-review of PRG1
- Finally