|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
1.00 Credits
Pending Approval.
-
0.00 - 1.00 Credits
Emphasizes object-oriented design and programming in Java, an effective modern technique for producing modular, reusable, internet-aware programs. Also introduces interactive computer graphics, user interface design and some fundamental data structures and algorithms. A sequence of succesively more complex graphics programs, including Tetris, helps provide a serious introduction to the field intended for both potential concentrators and those who may take only a single course. No prerequisites.
-
1.00 Credits
Introduces fundamental techniques for problem solving by computer that are relevant to most areas of computer science, both theoretical and applied. Algorithms and data structures for sorting, searching, graph problems, and geometric problems are covered. Programming assignments conform with the object-oriented methodology introduced in CSCI 0150. Prerequisite: CSCI 0150 or written permission.
-
0.00 - 1.00 Credits
CSCI0170/0180 is an introductory sequence that helps students begin to develop the skills, knowledge, and confidence to solve computational problems elegantly, correctly, efficiently, and with ease. The sequence is unique in teaching both the functional and imperative programming paradigms---the first through the languages Scheme and ML in CSCI0170; the second through Java in CSCI0180. The sequence requires no previous programming experience. Indeed, few high school students are exposed to functional programming; hence even students with previous programming experience often find this sequence an invaluable part of their education.
-
0.00 - 1.00 Credits
A continuation of CSCI 0170. Students learn to program in Java while continuing to develop their algorithmic and analytic skills. Emphasis is placed on object-oriented design of programs and the implementation and use of data structures. Examples are drawn from such areas as databases, strategy games, web client/server programming, graphical user interfaces, sorting, and data compression. Lab work done with the assistance of TAs. Prerequisite: CSCI 0170.
-
0.00 - 1.00 Credits
This course is a one-semester introduction to computer science for students with strong prior computer science background. It covers core data structures, algorithms, and analysis techniques similar to those of the two-course introductory sequences (CSCI 0150-0160 and CSCI 0170-0180), integrated with programming. Prerequisite: score of 5 on the CS AP AB exam, equivalent knowledge of Java and data structures, or permission of the instructor.
-
1.00 Credits
Seeks to place on solid foundations the most common structures of computer science, to illustrate proof techniques, to provide the background for an introductory course in computational theory, and to introduce basic concepts of probability theory. Introduces Boolean algebras, logic, set theory, elements of algebraic structures, graph theory, combinatorics, and probability. No prerequisites.
-
1.00 Credits
Basic principles of computer organization. Begins with machine representation of data types and logic design, then explores architecture and operations of computer systems, including I/O, pipelining, and memory hierarchies. Uses assembly language as an intermediate abstraction to study introductory operating system and compiler concepts. Prerequisite: CSCI 0150 or CSCI 0180 or CSCI 0190.
-
0.00 - 1.00 Credits
Advanced programming techniques including Java, threads, web-applications, user interfaces and XML. Covers software design including object-oriented design, systems design, web application design and user interface design. Software engineering including modeling, analysis, testing, debugger reuse, the software lifecycle, tools and project management. Prerequisite: CSCI 0160, CSCI 0180 or CSCI 0190. CSCI 0220 is recommended.
-
0.00 - 1.00 Credits
The course introduces basic models of computation including languages, finite-state automata and Turing machines. Proves fundamental limits on computation (incomputability, the halting problem). Provides the tools to compare the hardness of computational problems (reductions). Introduces computational complexity classes (P, NP, PSPACE and others). Prerequisite: CSCI 0220.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|