EECS 281 practice exams

Data Structures and Algorithms · University of Michigan

Make a free, printable EECS 281 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 350 original questions and skips the ones you have already seen.

Topics covered

• Worst-Case and Average-Case Analysis · 50 questions
• Priority Queues and Heaps · 50 questions
• Balanced and Augmented Search Trees · 50 questions
• Hashing · 50 questions
• Randomized Algorithms and Quicksort · 50 questions
• Graphs, BFS and DFS · 50 questions
• Minimum Spanning Trees and Lower Bounds · 50 questions

More Michigan courses

• MATH 115 Calculus I
• MATH 116 Calculus II
• MATH 214 Applied Linear Algebra
• MATH 215 Multivariable and Vector Calculus
• MATH 216 Introduction to Differential Equations
• STATS 250 Introduction to Statistics and Data Analysis
• STATS 425 Introduction to Probability
• STATS 426 Introduction to Theoretical Statistics
• CHEM 130 General Chemistry: Macroscopic Investigations and Reaction Principles
• PHYSICS 140 General Physics I
• BIOLOGY 171 Introductory Biology: Ecology and Evolution
• PSYCH 111 Introduction to Psychology
• ECON 101 Principles of Economics I
• ECON 102 Principles of Economics II
• ECON 401 Intermediate Microeconomic Theory
• ECON 402 Intermediate Macroeconomic Theory
• ACC 300 Financial Accounting
• ACC 301 Managerial Accounting

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