|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
8.00 Credits
Does not meet a distribution requirement Prereq. sr, permission of program; 1 to 8 credits
-
3.00 Credits
An introduction to basic computer science concepts and issues with a focus on HTML and JavaScript programming. Additional topics will be chosen from: origins of computers, computer architecture, assemblers and compilers, digital logic, the Internet, and artificial intelligence. Laboratory assignments will offer some experience with programming and the use of application so?ware. ways of organizing data into "data structures"and analyzes how structuring the data can improve program performance. This course is programming intensive. Meets Science and Math II-A requirement P. Dobosh Prereq. Computer Science 101, 102; 4 credits
-
4.00 Credits
Computers are used every day for an enormous variety of tasks, from playing games and chatting with friends to transferring billions of dollars, delivering radiation treatments, and controlling the electrical grid. Computer programs are an essential ingredient in allowing for this great diversity of applications. In this course, you will learn to create programs, not just use programs that others have written. you will develop animations using Alice, a tool specifically designed for learning programming by creating animations, and graphical applications using Java, a very popular modern programming language. We assume no prior study of computer science. Programming intensive. Meets Science and Math II-A requirement B. Lerner 4 credits
-
3.00 Credits
This course builds on the basic programming concepts learned in CS 101. Emphasis is on developing the skills needed to write more sophisticated programs. This includes strategies to aid in assuring the correctness of programs through the use of assertions and unit testing as well as advanced Java features such as inheritance, polymorphism, and network programming.We will also introduce some widely used data structures such as vectors and linked lists. This course is programming intensive. Meets Science and Math II-A requirement The department Prereq. Computer Science 101; 4 credits
-
3.00 Credits
using Java. Solving problems with computers is accomplished by writing programs that operate on data to produce a desired result. The way data is organized and presented to the program can significantly affect its efficiency and simplicity and can sometimes determine whether or not a program can be written to solve the problem at all. This course presents gorithms, divide-and-conquer, dynamic programming, and network flow.We will learn to recognize when to apply each of these strategies as well as to evaluate the expected runtime costs of the algorithms we design. Meets Science and Math II-A requirement B. Lerner Prereq. Computer Science 211 and Mathematics 232; 4 credits
-
3.00 Credits
This course looks at the inner workings of a computer and computer systems. It is an introduction to computer architecture. Specific topics include assembly language programming, memory, and I/O issues. This course is programming intensive. Meets Science and Math II-A requirement L. Ballesteros Prereq. Computer Science 101,102; Computer Science 211 recommended; 4 credits
-
4.00 Credits
Does not meet a distribution requirement The department Prereq. soph, permission of instructor; 1 to 4 credits
-
3.00 Credits
Are there any limits to what computers can do Does the answer to this question depend on whether you use a PC or a Mac Is C more powerful than PASCAL This seminar explores these questions by investigating several models of computation, illustrating the power and limitations of each of these models, and relating them to computational problems and applications. Topics include finite state automata, pushdown automata, grammars, Turing machines, the universal Turing Machine, and computability. Meets Science and Math II-A requirement The department Prereq. Computer Science 101,102 and Mathematics 232; 4 credits
-
3.00 Credits
How does Mapquest find the best route between two locations How do computers help to decode the human genome At the heart of these and other complex computer applications are nontrivial algorithms.While algorithms must be specialized to an application, there are some standard ways of approaching algorithmic problems that tend to be useful in many applications. Among other topics, we will explore graph algorithms, greedy al- Meets Science and Math II-A requirement P. Dobosh students should NOT take this course a?er Computer Science 101; 4 credits
-
3.00 Credits
Building large so?ware systems introduces new challenges to so?ware development. Appropriate design decisions early in the development of large so?ware can make a major difference in developing so?ware that is correct and maintainable. In this course, students will learn techniques and tools to help them address these problems and develop larger so?ware projects, improving their skills in designing, writing, debugging, and testing so?- ware. Topics include design patterns, uML, designing for maintainability, so?ware architecture, and designing concurrent and fault tolerant systems. Programming intensive. Meets Science and Math II-A requirement B. Lerner Prereq. Computer Science 211; 4 credits
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Cookies Policy |
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|