|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Second part of a two-part sequence in Java programming. Introduction to specifications, simple unity testing, and debugging; building and using canonical data structures; algorithm analysis and reasoning techniques such as assertions and invariants. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: Computer Science 307, 314, 314H. Only one of the following may be counted: Computer Science 314, 314H, 315, 315H. Prerequisite: Computer Science 312 or 312H with a grade of at least C-.
-
3.00 Credits
Second part of a two-part sequence in Java programming. Introduction to specifications, simple unity testing, and debugging; building and using canonical data structures; algorithm analysis and reasoning techniques such as assertions and invariants. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: Computer Science 307, 314, 314H. Only one of the following may be counted: Computer Science 314, 314H, 315, 315H. Prerequisite: Computer Science 312 or 312H with a grade of at least C-, and consent of the honors director.
-
3.00 Credits
Implementation of basic data structures, including stacks, queues, lists, priority queues, trees, binary search trees, graphs, and sets; recursion; efficient sorting and searching algorithms; hashing; and multithreaded programs. Three lecture hours and one laboratory hour a week for one semester. Only one of the following may be counted: Computer Science 314, 314H, 315, 315H. Prerequisite: Computer Science 307 with a grade of at least C-, and credit or registration for Computer Science 313K.
-
3.00 Credits
Data types, data structures, algorithms, and programming; functions and recursion; abstraction and encapsulation. Correctness: specification, testing, proving. Introduction to analysis of algorithms. Implementation and use of basic data structures, including stacks, queues, lists, priority queues, trees, binary search trees, graphs, sets. Efficient sorting and searching algorithms; hashing; and multithreaded programs. Three lecture hours and one discussion hour a week for one semester. Only one of the following may be counted: Computer Science 314, 314H, 315, 315H. Prerequisite: Consent of the honors director.
-
3.00 Credits
Introduction to functional and symbolic programming and to the use of these concepts throughout computer science. Three lecture hours a week for one semester. Prerequisite: Credit with a grade of at least Cor registration for Computer Science 337 or 337H, and consent of the honors director.
-
3.00 Credits
Fundamentals of software issues related to scientific computing. Topics include floating-point computations, numerical computation errors, interpolation, integration, solution of linear systems of equations, optimization, and initial value problems of ordinary differential equations. Implementation of algorithms are investigated using MATLAB for matrix and vector computations. Examples are drawn from a variety of science and mathematics areas. Three lecture hours a week for one semester. May not be counted toward a degree in computer science. Computer Science 323E and 323H may not both be counted. Prerequisite: Computer Science 303E or the equivalent; Mathematics 408C, 408K, or 408N; Mathematics 408D, 408M, or 427L; and credit with a grade of at least C- or registration for Mathematics 341 or 340L.
-
3.00 Credits
Fundamentals of software issues related to scientific computing. Topics include floating-point computations, numerical computation errors, interpolation, integration, solution of linear systems of equations, optimization, and initial value problems of ordinary differential equations. Implementation of algorithms are investigated using MATLAB for matrix and vector computations. Examples are drawn from a variety of science and mathematics areas. Three lecture hours a week for one semester. May not be counted toward a degree in computer science. Computer Science 323E and 323H may not both be counted. Prerequisite: Computer Science 303E, 305J, or 307; Mathematics 408D, 408M, or 427L; credit with a grade of at least C- or registration for Mathematics 341 or 340L; and consent of the honors director.
-
3.00 Credits
Basics of two- and three-dimensional computer graphics systems, modeling and rendering, and selected graphics software APIs. Other topics may include interactive graphics, animation, graphical user interfaces, and the graphical presentation of information. Three lecture hours a week for one semester. May not be counted toward a degree in computer science. Prerequisite: Computer Science 307, 313E, 314, 314H, or Electrical Engineering 422C (or 322C) with a grade of at least C-.
-
3.00 Credits
Introduction to the principles and basic concepts of the Internet. Networking applications and protocols. Simple client/server applications. Other topics may include network technologies and topologies, packet and circuit switching, LANS and WANS, Internet security, and network management. Three lecture hours a week for one semester. May not be counted toward a degree in computer science. Prerequisite: Computer Science 307, 313E, 314, 314H, or Electrical Engineering 422C (or 322C) with a grade of at least C-.
-
3.00 Credits
A practical introduction to database management systems, with discussion of database administration and management. Survey of logical modeling, database design with a focus on relational databases, SQL query language, and current applications. Topics may include data integrity, performance, concurrency, transaction processing, recovery, security, and Web applications. Three lecture hours a week for one semester. May not be counted toward a degree in computer science. Prerequisite: Computer Science 307, 313E, 314, 314H, or Electrical Engineering 422C (or 322C) with a grade of at least C-.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|