You will have 2 hours to complete the exam within the time period mentioned above. The exam will be handed out through blackboard and you will upload the solution to blackboard. Please upload the solutions as a plain text file (.txt). You are allowed to use an editor or IDE to solve programmming questions.

For students that are unfamiliar with blackboard, please ensure that you have access and try out the mock exam that we created so that you can get comfortable with the submission process.

The exam will consist of both multiple choice and coding questions. We will cover the following topics:

• Runtime complexity analysis

  • understand and be able to apply the Big-O notation

  • be able to analyze the worst-case runtime complexity of simple programs / algorithms

• Lists

  • understand implementations of list operations

    • array-backed lists

    • linked-lists

  • be able to use lists for a particular purpose

  • know the runtime complexity of common list operations for a particular implementation of the list ADT

• Maps

  • understand the Python dictionary data structure and be able to use it to solve computational problems

• Search

  • understand and be able to implement binary search and linear search

• Python

  • be able to write simple programs in python that utilize build-in data structures and utility functions

  • be able to comprehend Python programs and be able to reason about their execution

These are solutions from previous years.

• 2020 - Spring
  • midterm1: questions , solutions
• 2019 - Fall
  • midterm1: questions , solutions
• 2019 - Spring
  • midterm1: questions
• 2018 - Summer
• 2018 - Spring
  • midterm1: questions
• 2017 - Fall
  • midterm1: questions
• 2017 - Summer
• 2017 - Spring
  • midterm1: questions
• 2016 - Fall
  • midterm1: questions
• 2016 - Summer
  • midterm1: questions
• 2016 - Spring
  • midterm1: questions
• 2015 - Fall
  • midterm1: questions