Upper Division Courses
Alt. years. A continuation of CSC-231. Processor architecture, interrupt handling external device interfacing. Advanced assembly language programming. Device communication and relation to the runtime environment. This course does not fulfill the mathematics Liberal Arts Core requirement.
Alt. years. Prereq.: CSC-140. A study of fundamental algorithms, data structures, and their effective use in a variety of applications. The importance of data structure choice and implementation for obtaining the most efficient algorithm for solving a given problem will be studied. A key component of this course is the worst-case asymptotic analysis, which provides a quick and simple method for determining the scalability and effectiveness of an algorithm. Other topics covered generally include: divide-and-conquer algorithms, sorting algorithms, hashing, stacks, queues binary heaps, skip lists, trees, basic graph algorithms. Concepts and skills are mastered through programming projects. This course does not fulfill the mathematics Liberal Arts Core requirement.
Prereq.: Junior or senior standing. May be repeated up to a maximum of 4 credits and is subject to arrangement with the Mathematical and Physical Sciences Department. See independent study guidelines. (INDEPENDENT WORK)
Prereq.: Junior or senior standing and permission. Individually arranged programs of work and study with the department, academic institutions, private industries, or government agencies. See internship guidelines. (INDEPENDENT WORK)