AP/ITEC2620 3.0 A: Introduction to Data Structures
Calendar Description / Prerequisite / Co-Requisite
A completion to introductory problem solving and algorithm development. Taught in Java, topics include linked lists, binary trees, stacks, queues and other elementary data structures. Complexity analysis is introduced with an emphasis on searching and sorting algorithms. Note: This course will not count for computer science major or minor credit. Prerequisites: AP/ITEC 1620 3.00, AP/ITEC 2610 3.00. PRIOR TO FALL 2014: Course credit exclusions: LE/CSE 1030 3.00.PRIOR TO SUMMER 2013: Prerequisites: AP/ITEC 1620 3.00, AP/ITEC 2610 3.00. Course credit exclusions: GL/CSLA 2620 3.00, GL/ITEC 2620 3.00, SC/CSE 1030 3.00.
- Academic Honesty
- Student Rights and Responsibilities
- Religious Observance
- Grading Scheme and Feedback
- 20% Rule
No examinations or tests collectively worth more than 20% of the final grade in a course will be given during the final 14 calendar days of classes in a term. The exceptions to the rule are classes which regularly meet Friday evenings or on Saturday and/or Sunday at any time, and courses offered in the compressed summer terms.
- Academic Accommodation for Students with Disabilities