Home > Computer Engineering > Quizzes > Computer Science Distilled
Computer Science Distilled
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 25% Most missed: “What are database transactions used for?”
Computer Science Distilled
Time left 00:00
25 Questions

1. Database normalization

2. Field (relational database)

3. Levenshtein distance

4. What kind of databases is usually used for Big Data?

5. What mathematical problem corresponds to finding the minimum number of frequencies for a cellular network?

6. Biconditional

7. BFS

8. When are distributed databases needed?

9. Data mining

10. Hash table buckets

11. Arrays vs binary search trees (properly balanced)

12. SQL

13. Selection sort time complexity

14. What is a hash function (in general)

15. when is insertion sort used?

16. How are approximation algorithms judged?

17. How to avoid infinite recursion?

18. Multi-master distributed database

19. What's the advantage of hash tables?

20. Contrapositive

21. Binary search tree

22. Arrays vs linked lists

23. What is the advantage of a multi-master distributed database over a single-master one?

24. How does a processor implement Dijkstra's algorithm?

25. Chaining hash collision resolution