Students are introduced to the basic methods of representing data in Computing Science. Students review, implement and analyze several fundamental data structures including lists, stacks, queues, and graphs. Students learn the implementation of algorithms using these data structures and the efficiency and cost tradeoffs of each of them. Prerequisite: C or better in COMP 1390 or MATH 1700 or MATH 1701, and COMP 1230 or COMP 1231 or COMP 1240 or COMP 2120 Note: Students can receive credit for either COMP 2230 or COMP 2231
Students are introduced to the basic methods of representing data in Computing Science. Students review, implement and analyze several fundamental data structures including lists, stacks, queues, and graphs. Students learn the implementation of algorithms using these data structures and the efficiency and cost tradeoffs of each of them. Prerequisite: C or better in COMP 1390 or MATH 1700 or MATH 1701, and COMP 1230 or COMP 1231 or COMP 1240 or COMP 2120 Note: Students can receive credit for either COMP 2230 or COMP 2231