COMPSCI 61B practice exams

Data Structures · University of California, Berkeley

Make a free, printable COMPSCI 61B practice exam: choose the topics, the length and the difficulty above, and get an exam-style PDF with a full answer key. Each paper draws on 550 original questions and skips the ones you have already seen.

Topics covered

• Interfaces, Generics and Dynamic Dispatch · 50 questions
• Asymptotic Analysis of Java Code · 50 questions
• ArrayLists, Linked Lists and Deques · 50 questions
• Stacks, Queues and Their Uses · 50 questions
• Recursion and Backtracking · 50 questions
• Binary Trees and Binary Search Trees · 50 questions
• Balanced Search Trees · 50 questions
• Hash Tables, hashCode and equals · 50 questions
• Priority Queues and Heaps · 50 questions
• Sorting Algorithms · 50 questions
• Graphs and Graph Algorithms · 50 questions

More Berkeley courses

• MATH 1A Calculus
• MATH 16A Analytic Geometry and Calculus
• MATH 53 Multivariable Calculus
• MATH 56 Linear Algebra
• STAT 2 Introduction to Statistics
• STAT 20 Introduction to Probability and Statistics
• STAT 134 Concepts of Probability
• CHEM 1A General Chemistry
• PHYSICS 7A Physics for Scientists and Engineers
• PHYSICS 8A Introductory Physics
• PSYCH 1 General Psychology
• PSYCH 2 Principles of Psychology
• ECON 100A Microeconomics
• ECON 101A Microeconomics (Quantitative)
• ECON 100B Macroeconomics
• ECON 101B Macroeconomics (Quantitative)
• UGBA 102A Financial Accounting
• UGBA 102B Managerial Accounting

questionbank.dev is independent and not affiliated with University of California, Berkeley. Course codes only say which topics a paper covers; papers are original practice material, not past or upcoming exams.