In this blog post, I will be showing you examples of past CS201 mid-terms and finals papers. The idea is to help you understand what the examiners are looking for when they grade your paper and prepare yourself better. This way, if it is a topic that has not been covered in lectures or tutorials, then hopefully, these solved past papers can guide how to tackle that subject!
The following two topics (queueing theory and machine learning) are not in the course syllabus but have come up before on previous exams. If you’re feeling particularly adventurous from reading about them below, then feel free to take a shot at solving them! Otherwise, scroll down for some more traditional topics like data.