Algorithms and Data Structures
Bachelor of Science in Computer Science · University · Core Courses
In this unit you will: know Big O notation, searching, stacks, and queues; compare sorting methods, running times, and stability; apply search trees, heaps, and hash tables; match graph algorithms and algorithm design paradigms; apply everything at exam level.
There are 50 exercises to practice: interaktive Aufgaben. Every answer gets instant feedback, free and without signing up.
What's included
- Know Big O notation · searching · stacks · and queues
- Compare sorting methods · running times · and stability
- Apply search trees · heaps · and hash tables
- Match graph algorithms and algorithm design paradigms
- Apply everything at exam level
Example questions
- What is the worst-case running time of linear search?
- Stack or queue? Sort the properties.
- What does binary search require?