CSC2203 — Data Structures
The objective of this course is to apply analysis and design techniques to non-numeric algorithms that act on data structures. Topics will include linked lists, queues, stacks, trees, A VL trees, and string-handling algorithms. Prerequisite: CSC 1114 – Foundations of Computer Science II. CSC 2611/6. Internship in Computer Science. The professional internship is intended to provide a learning opportunity for beginning students to: 1) apply knowledge and skills acquired in the classroom in a professional context; 2) understand which skills are transferable to new contexts; 3) identify and understand the practices and protocols of the industry in which they are working; and 4) refine and reassess their own career goals as a result of the experience. Current employment may not be used for credit in this course. This is a credit/no credit course and may be repeated for a maximum of 6 credit hours. Prerequisite: Consent of program.