COEN 12 Final Exam (28 Questions) – Sorting Algorithms, Data Structures, Runtimes – Santa Clara University

This document contains 28 exam-style questions and answers focused on Big-O runtimes and performance analysis for various sorting algorithms and abstract data types, prepared for the COEN 12: Data Structures course at Santa Clara University during the 2025/2026 academic year. The content is designed to provide a structured and in-depth review of time complexities across best, average, and worst cases, with a specific emphasis on sorting methods including selection sort, insertion sort, shell sort, bubble sort, heap sort, and quick sort. Additionally, it outlines runtime operations for key data structures such as arrays (sorted and unsorted), hash tables, linked lists (sorted and unsorted), binary search trees, and AVL trees, covering operations like search, insert, delete, and retrieving min/max values. The answers are all clearly marked and verified, making the material ideal for final exam preparation, quick review, or academic reinforcement. This document is especially suitable for students in: Computer Science Computer Engineering Software Engineering Electrical and Computer Engineering Information Technology Whether you are preparing for exams, reviewing runtimes, or comparing data structure efficiencies, this material offers a reliable, exam-focused overview aligned with most undergraduate data structures courses. Keywords: COEN 12, final exam, sorting algorithms, runtime complexity, Big-O notation, selection sort, insertion sort, quick sort, heap sort, bubble sort, shell sort, data structures, hash table, linked list, binary search tree, AVL tree, min/max operations, array performance