CSCE A311 — Data Structures and Algorithms 3 Credits
Representation and organization of digital information in the form of effective and efficient data structures, manipulation of data structures in a procedural fashion, and the analysis and evaluation of various algorithms. The following topics will be covered: Abstract Data Types (ADT), arrays, tables, linked lists, stacks, queues, trees, sorting, searching, graphs, hashing, spanning trees, disjoint sets, parallel algorithms, and heaps. Registration Restrictions: Admission to the Bachelor of Science in Computer Science, Bachelor of Science in Computer Systems Engineering, or Bachelor of Science in Electrical Engineering; or instructor approval