COEN 12 Midterm 1 (30 Questions) – ADTs, Searching, Hashing, Big-O – Santa Clara University

This document contains 30 midterm questions and answers from COEN 12: Data Structures at Santa Clara University, academic year 2025/2026. The material is highly focused on foundational computer science concepts, particularly abstract data types (ADTs), search algorithms, hashing techniques, and runtime complexity analysis using Big-O notation. Each concept is explained through direct Q&A format, making the document ideal for both concept reinforcement and exam preparation. Key topics include: Set & Bag ADTs and their properties Sequential and Binary Search algorithms and their time complexities Hashing strategies such as direct hash, subtraction hash, modulo hash, linear probing, quadratic probing, and double hashing Big-O rules and analysis techniques Insertion, removal, and lookup performance across different data structures Each question is followed by a clear and concise answer, ensuring fast comprehension and quick revision. This document is especially useful for students seeking a strong understanding of efficiency and design in data structures. Recommended for students enrolled in: Computer Science Software Engineering Computer Engineering Information Systems Electrical and Computer Engineering It is a great resource for reviewing hashing techniques, runtime behavior of common operations, and algorithm fundamentals in preparation for midterms or technical interviews. Keywords: COEN 12, midterm exam, data structures, abstract data types, ADT, hash table, linear probing, quadratic probing, double hashing, sequential search, binary search, Big-O notation, time complexity, insertion cost, deletion cost, set, bag, hashing functions