alleryStart learning →Coding Interview Prep Interview Prep — practice questions
Explore 22 free Interview Prep questions in Coding Interview Prep Computer Science. Each question opens with answer choices, the correct answer and a worked solution.
Practise Interview Prep with Quill →Interview Prep MCQs with answers
Showing questions 1–22 of 22.
Array lists and linked lists both arrange elements one after another, so they are:Read the answer and worked solution →An interviewer asks why an array list is fast to read at any index. The reason is it allows:Read the answer and worked solution →A linked list can only be walked from the front, which means it supports:Read the answer and worked solution →Compared with array lists, linked lists are better at:Read the answer and worked solution →A data structure whose nodes each have zero or more child nodes is a:Read the answer and worked solution →In a binary search tree, every value in a node's left subtree is:Read the answer and worked solution →In a binary search tree, every value in a node's right subtree is:Read the answer and worked solution →Reading a binary search tree from left to right gives the elements in:Read the answer and worked solution →A binary search tree built from already sorted input is likely to become:Read the answer and worked solution →A tree that requires the left and right subtrees to be balanced at every node is an:Read the answer and worked solution →An AVL tree keeps itself balanced after insertions by performing:Read the answer and worked solution →A collection where each element carries a priority value is a:Read the answer and worked solution →A priority queue is designed to retrieve and remove the element with the:Read the answer and worked solution →The most common implementation of a priority queue is the:Read the answer and worked solution →A structure that represents binary relations among a collection of entities is a:Read the answer and worked solution →Binary search requires that the list it searches is first:Read the answer and worked solution →The notation used to describe worst case order of growth is:Read the answer and worked solution →Sequential search through a list of N words has a worst case order of growth of:Read the answer and worked solution →Binary search on a sorted list has an order of growth of:Read the answer and worked solution →An algorithm that splits a problem in half, solves each half and combines results is called:Read the answer and worked solution →The canonical divide and conquer comparison sorting algorithm is:Read the answer and worked solution →An algorithm that repeatedly picks the option with the best immediate benefit is:Read the answer and worked solution →
How to practise
- Choose a Interview Prep question and try to work out your answer.
- Open the question to check the correct answer and read its worked solution.
- Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.