COEN 12 Final Exam (45 Questions) – Algorithms, Hashing, Linked Lists, Trees – Santa Clara University

This document provides a complete and accurate set of 45 final exam questions and answers for COEN 12: Data Structures, covering essential topics in computer science and engineering. It includes a wide range of conceptual and technical questions on algorithm analysis (Big-O notation), runtime efficiency, hash table operations (linear and quadratic probing), linked lists (singly and doubly linked, sorted and unsorted), binary search trees, AVL trees, binary heaps, and graph representations. Also addressed are abstract data types (e.g., stacks and queues) and sorting techniques like heap sort and quick sort. All questions are paired with correct answers and structured in a concise, exam-like format. This document serves as a highly valuable resource for revision and final exam practice. It is particularly relevant for students in: Computer Science Software Engineering Computer Engineering Electrical and Computer Engineering Information Technology Students taking any course related to data structures, algorithm design, or computational efficiency will find this material especially helpful, even if studying at institutions other than Santa Clara University, as the topics are commonly included in standard CS curricula. Keywords: COEN 12, final exam, data structures, algorithm analysis, Big-O notation, hash tables, linked lists, binary search tree, AVL tree, binary heap, graph theory, sorting algorithms, quick sort, heap sort, runtime complexity, stack, queue, tree traversal, abstract data types