|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
1.00 Credits
Group 1, 1 course This course builds on CSC 121 and introduces programming topics, such as sets, recursion and dynamic data types. Data type abstraction and implementation are introduced by studying structures, such as lists, stacks, queues and binary trees. The object-oriented implementation of these structures is emphasized. Tools for algorithm analysis are introduced, and comparisons of functional, object oriented and imperative programming paradigms are made. The concept of tradeoffs (i.e., time vs. space, iteration vs. recursion, static vs. dynamic and imperative vs. functional) recurs as a theme throughout the course. Prerequisite: CSC 121. Recommended pre- or corequisite: MATH 123 or MATH 223. Offered each semester. Not offered pass/fail.
-
1.00 Credits
1 course A seminar focused on a theme related to the study of computer science. Open only to first-year students.
-
1.00 Credits
Group 1, 1 course This is an introduction to the study of computer hardware, concentrating on the central processing unit and main storage. Topics include representing information, machine language, combinational and sequential logic, input/output, registers, register transfer logic and bus structures. Assembly language and the high-level language, C++, are used to aid in the understanding of these topics. Prerequisite: CSC 122 and either MATH 123 or MATH 223. It is recommended but not required that both MATH 123 and MATH 223 are completed by the time CSC 221 and CSC 222 are completed. Offered each semester. Not offered pass/fail.
-
1.00 Credits
Group 1, 1 course This course examines, in depth, several historically significant and highly functional models of data storage, including trees, sets, tries, priority queues and graphs. Attention is given to selecting the most appropriate model for a particular problem. Differences between the conceptual features of a model and its physical representation on a computer are emphasized. Algorithms which operate on these models are also considered. Other topics include an in-depth study of sorting, including special-purpose sorting algorithms. Prerequisite: CSC 122 and either MATH 123 or MATH 223. It is recommended but not required that both MATH 123 and MATH 223 are completed by the time CSC 221 and CSC 222 are completed. Offered each semester. Not offered pass/fail.
-
0.50 - 1.00 Credits
0.5-1 course Topics are chosen from computer science to allow the study of computer science topics for non-computer science majors. Does not count in the computer science major GPA.
-
1.00 Credits
Group 1, 1 course This course examines fundamental principles in Human Computer Interaction as seen from the viewpoint of a computer scientist. Topics include user-centered design, expert reviews, usability tests, tradeoffs between interaction devices, alternative input-output methods, including handwriting recognition and associated algorithms, the design of interfaces for users with visual or motor impairments, construction of appropriate error messages and implementation of graphical user interfaces (GUIs). Prerequisites: CSC 221 or 222. Typically offered annually. Not offered pass/fail.
-
1.00 Credits
Group 1, 1 course This course examines the implementation of intelligent algorithms on a computer system. The concept of an intelligent algorithm is motivated by initial discussions of the nature of intelligence and its relation to computers, particularly the Turing test. The course begins with two basic topics of artificial intelligence. The first is problem definition, state spaces and search methods, and the second is knowledge representation and logical reasoning. Following these topics is coverage of more advanced topics, such as game-playing algorithms, genetic algorithms, planning algorithms, computer vision, learning algorithms and natural language processing, among others. Prerequisite: CSC 222. Typically offered annually. Not offered pass/fail.
-
1.00 Credits
Group 1, 1 course Various models of formal languages (which provide a basis for compilers) and computation (which defines the kinds of problems that can be solved by a computer) are studied. Topics include regular languages, regular expressions, finite state automata, context-free languages, context-free grammars, push-down automata and Turing machines. The application of these models to several practical problems in computer science is considered. Computational limits are also discussed, using as examples several problems which cannot be solved by any algorithm. Prerequisite: CSC 122 and MATH 223 . Typically offered annually. Not offered pass/fail.
-
1.00 Credits
Group 1, 1 course This course is an introduction to the concepts, techniques, algorithms and implementation of computer graphics. Topics include moving and drawing lines in absolute and relative coordinates, transformations, windowing, clipping, projections, perspective, polygon filling, hidden surface techniques and a variety of applications, including graphical user interfaces and menuing systems. Prerequisite: CSC 222. Recommended prerequisite or co-requisite MATH 151. Typically offered annually. Not offered pass/fail.
-
1.00 Credits
Group 1, 1 course This course provides an external and an internal view of relational database management systems (DBMSs). The external view consists of database design and implementation. The database query and manipulation languages SQL and QBE will be studied to the degree that students will be able to become proficient in these languages on their own. The internal view involves characteristics of secondary storage devices, methods of organizing information, various file organization and accessing techniques and other topics related to database engine implementation. Programming assignments complement topics discussed in class, including the building of a few key components of a database engine. Prerequisite: CSC 222 or permission of instructor. Typically offered annually. Not offered pass/fail.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|