CS 274 - Data Structures

3 credit hours - This course aims to achieve two main objectives. The first is to introduce students to various data structures for efficient information storage and retrieval. The second is to explore and analyze diverse data abstractions, such as stacks, queues, linked lists, priority queues, heaps, hash tables, binary trees, AVL trees, Red-Black Trees, Graphs, etc. This includes understanding their implementation, algorithmic analysis, and the criteria for selecting suitable data structures to match different applications. Prerequisite(s): CS 170 with grade of “C” or higher.