Thinkycap logo
Worksheets

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.

Practice nowAlgorithms and Data StructuresBachelor of Science in Computer Science · University · Core Courses · 50 exercisesPractice now

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

  1. What is the worst-case running time of linear search?
  2. Stack or queue? Sort the properties.
  3. What does binary search require?

Solve these and more questions now →

More topics in Core Courses