Start learning →

DSA Interview Prep Computer Science — practice by topic

Browse 60 questions across 5 Computer Science topics. Choose what you want to revise, then open a question to check its answer and worked solution.

Start learning DSA Interview Prep with Quill →

Computer Science topics

Computer Science (60)Cloud Native Architecture (30)Data Structures and Algorithms (30)Interview Prep (30)System Design (30)

Try a Computer Science question

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 →

Worked practice questions

Array lists and linked lists both arrange elements one after another, so they are:

  1. Linear structures
  2. Layered structures
  3. Looping structures
  4. Lattice structures
Show answer and solution

Correct answer: A. Linear structures

1. Their elements sit in a single sequence. 2. No branching or hierarchy is involved. 3. So they are linear structures. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._

Open this question →

An interviewer asks why an array list is fast to read at any index. The reason is it allows:

  1. Repeated hashing
  2. Random access
  3. Rapid deletion
  4. Reverse sorting
Show answer and solution

Correct answer: B. Random access

1. Elements sit next to each other in memory. 2. Any position can be computed directly. 3. So it allows random access. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._

Open this question →

A linked list can only be walked from the front, which means it supports:

  1. Sequential access
  2. Selective access
  3. Symmetric access
  4. Simultaneous access
Show answer and solution

Correct answer: A. Sequential access

1. Each node only knows the next node. 2. You must follow the links in order. 3. So it supports sequential access. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._

Open this question →

How to practise

  1. Choose a Computer Science question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.