[PORTALNAME]

Course Criteria

Add courses to your favorites to save, share, and find your best transfer school.

  • CS 581: Introduction to Artificial Intelligence

    3.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): CS 280 This course covers important AI areas, including search algorithms, knowledge representation, production systems, game playing, uncertainty handling, learning, and planning. Students are required to have basic knowledge of data structures, probability theory, and mathematical logic. Upon successful completion of this course, students will have gained an understanding of and skills relevant to modern AI techniques, practices, and design solutions.
    ShareCS 581 - Introduction to Artificial Intelligence
    Favorite

  • CS 582: Reasoning under Uncertainty

    3.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): CS 580 & CS 581 This course covers important AI topics, including hidden Markov models and advanced search algorithms (D-lite and cooperative path finding). Students will also examine uncertainty handling (Dempster- Shafer theory), learning (kernel machines), and advanced topics in planning (conditional and adversarial planning).
    ShareCS 582 - Reasoning under Uncertainty
    Favorite

  • CS 590: Computational Complexity

    3.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): CS 280, CS 330, or Equivalent The study of computational complexity is at the core of theoretical computer science. The key issue to understand in complexity theory is the nature of efficient computation. Hence, it is a natural extension of computability theory, which studies the nature of computation without regard for resource bounds. This course addresses questions such as: What is an algorithm? What problems can or cannot be solved by an algorithm? What problems can or cannot be solved efficiently by an algorithm? How can we classify and compare problems according to their intrinsic computational complexity? Exploring this last question will constitute the bulk of the course. Students will be introduced to ways to compare computational problems, even when we do not know how to solve them efficiently. They will also study the complexity classes (e.g. P, NP, PSPACE, L, NL, BPP, etc.) into which they fall. As the course progresses, students will be led to examine more questions, such as: Is it easier (more efficient) to comply seek approximate solutions? Can flipping coins help in designing efficient algorithms? Can biology and/or physics lend a hand?
    ShareCS 590 - Computational Complexity
    Favorite

  • CS 598: Computer Science Seminar

    1.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): Upon approval of academic advisor Every semester, guest speakers, faculty members, and/or graduate students offer to DigiPen students a number of presentations that cover different research topics in computer science. Each speaker decides on the choice of topic, but they usually are within the general boundaries of students' courses of study. This seminar aims not to pursue any particular topic but rather to explore new research in more depth to allow students to develop their own skills in theoretical analysis. Each speaker's paper(s) will be available to students. They will be required to read these papers and to choose one to expand upon for a final paper and an oral presentation.
    ShareCS 598 - Computer Science Seminar
    Favorite

  • CS 599: Special Topics in Computer Science

    3.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): Upon approval of academic advisor This course is an upper- level graduate class. It is offered infrequently to explore various subjects that may be topical or of special interest. Subjects might include (but are not limited to) 3D graphics rendering algorithms, advanced animation and modeling techniques, artificial intelligence, numerical solutions, and the applications of mathematics and physics in real-time interactive simulations and video game software.
    ShareCS 599 - Special Topics in Computer Science
    Favorite

  • CS 601: Master's Thesis I

    3.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): Upon approval of academic advisor This course is the first part of the master's program thesis. The student shall work with the thesis advisory committee to select a research topic, to conduct a complete survey of existing techniques and algorithms in the related field, to identify fundamental knowledge, and to collect materials and tools that are essential to his or her research work. Upon completion of the course, the student shall produce a written document to summarize the above steps. In this document, the student is also encouraged to include an original idea of proposed approaches to the problem.
    ShareCS 601 - Master's Thesis I
    Favorite

  • CS 602: Master's Thesis II

    3.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): Approval of thesis advisory committee and CS 601 This course is the second part of the master's program thesis. Students shall continue to work under the supervision of the thesis advisory committee to create the theory of the proposed research topic, to develop algorithms, and to possibly create a prototype to verify the theory and methods. Upon completion of the class, the student must submit his or her formal written thesis to the advisory committee to summarize the entire research and pass the oral exam to defend the thesis.
    ShareCS 602 - Master's Thesis II
    Favorite

  • ECE 200: Electric Circuits

    3.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): CS 100 & CS 100L Usually taken after ECE 210, this course is more theoretical than digital electronics. It emphasizes the basic principles on which digital electronics are based. Exploring these principles leads one to conclude that all electronics are really analog. Effects seen in digital circuits may be due to unanticipated capacitance or inductance. It is important to understand how these transient phenomena arise. It is also often useful to have an analog section in a primarily digital circuit. Topics in this course include passive components, series and parallel circuits, two-terminal networks, two-port networks, circuit reduction techniques, impedance analysis, measurement of waveforms, power, and filters. It also looks at operational amplifiers, step responses of various simple circuits, and the Laplace transform.
    ShareECE 200 - Electric Circuits
    Favorite

  • ECE 210: Digital Electronics I

    4.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): CS 100 & CS 100L The objective of this class and the following ECE 260 is to prepare students well enough at hardware design and troubleshooting so that he or she can determine whether a problem comes from hardware or software. The class uses TTL family integrated circuits to build digital devices. Part of the time is spent in the lab. Topics in this course include digital logic, programmable logic devices, FPGA, arithmetic circuits, multiplexers and demultiplexers, logic families, memory devices, and flip-flops.
    ShareECE 210 - Digital Electronics I
    Favorite

  • ECE 220L: Introduction to Robotics

    3.00 Credits
    DigiPen Institute of Technology

    Prerequisite(s): CS 100, CS 100L, & GAM 150 Continuing the concepts learned in CS 100 and CS 100L, students will design and build a device that uses an embedded microprocessor. This device usually takes the form of a robot or electronic toy. The device must be interactive with either humans or the environment, and it must successfully demonstrate digital communication. Throughout the semester, students will document the design, production, and service of their device. This course introduces concepts of software engineering and process documentation, and it will emphasize system-level design so that students can build an initial prototype and then revise key components to be cost-competitive.
    ShareECE 220L - Introduction to Robotics
    Favorite
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
(Type the name of a College, University, Exam, or Corporation)
(For example: Accounting, Psychology)
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
(For example: Introduction To Accounting)
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
of
(For example: Find all institutions within 5 miles of the selected Zip Code)