UCL · COMP0005 · Computer Science
COMP0005 Algorithms: exam practice questions, marked
Practise for COMP0005 Algorithms at UCL with 45 quick-recall questions, 18 exam-style questions and 9 first-class stretch questions, written from the module’s published description. Write an answer and get it marked against UCL’s grade bands in about 30 seconds, with the exact sentences that lost marks and three changes to reach the next class.
Try one free, no sign-up Create a free account
Example COMP0005 question
(a) Rank these functions by asymptotic growth, slowest first: n log n, 2^n, n^2, log n, n^3, sqrt(n). [3] (b) Give the running time in Big-Theta of the loop: for i in range(n): for j in range(i): print(i, j). Justify. [3] (c) Prove that 3n^2 + 5n = O(n^2). [4]
Topics covered
- Analysis of Algorithms and Asymptotics
- Abstract Data Types: Stacks, Queues, Lists
- Elementary Sorting Algorithms
- Efficient Sorting: Mergesort, Quicksort, Heapsort
- Priority Queues and Heaps
- Searching and Symbol Tables
- Graph Representations and Traversal
- Weighted Graphs: Shortest Paths and MSTs
- String Processing: Tries, Substring Search, Compression
About the module
Aims:The aim of this module is to provide students with an introduction to data structures and algorithms that are fundamental to programming and to understand...
Unizy is an independent revision tool and is not affiliated with or endorsed by UCL. Marks are practice estimates, not official marks.