CISC 3130 Data Structures
(Prior to Fall 2010, this course was known as CIS 22.
The information below might still reflect the old course numbers. Bracketed numbers, if any, are the old course numbers. Learn more...)
4 hours; 4 credits
Stacks and their implementations. Prefix, postfix, and infix notation. Queues and linked lists and their implementations. Binary and general trees and their implementations and traversals. Sorting and searching techniques. Graph algorithms. (Not open to students who are enrolled in or have completed Computer and Information Science 14 or 21.)
Prerequisite: Computer and Information Science 3110 [15] or 16.
DISCLAIMER
The City University reserves the right, because of changing conditions,
to make modifications of any nature in academic programs and requirements
of the university and its constituent colleges without advanced notice.
Students are advised to consult regularly with college and department counselors
concerning their programs of study.
