|
Mar 28, 2024
|
|
|
|
ITCS 2700 - Data StructuresCredit Hours: 4.00 Prerequisites: ITCS 2550 or ITCS 2620
This course provides students with a study of classical abstract data types (ADT). Emphasis will be placed on matching the appropriate data structures and algorithms to application problems. Object oriented structures such as linked lists, stacks, queues and trees will be developed. Algorithms such as hashing, searching and sorting, disjoint sets and graphing will also be implemented. Students will evaluate complexity theory (Big O) across these algorithms. This course assumes that students are already familiar with object oriented programming and dynamic data allocation using pointers.
Contact Hours: 4 Billable Contact Hours: 4
Location: Center Campus
Search for Sections
Add to Favorites (opens a new window)
|
|