[PORTALNAME]

Course Criteria

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

  • CS U232: Honors Freshman Seminar

    1.00 Credits
    Northeastern University

    Introduces a variety of topics that extend the material in the standard freshman computer courses or go beyond the scope of these courses.
    ShareCS U232 - Honors Freshman Seminar
    Favorite

  • CS U277: Honors Adjunct

    1.00 Credits
    Northeastern University

    Retired August 31, 2006. Offers additional introductory academic experience by exploring course-related topics in greater depth with the professor. Available only to courses approved by the University Honors Program.
    ShareCS U277 - Honors Adjunct
    Favorite

  • CS U278: Honors Adjunct

    1.00 Credits
    Northeastern University

    Retired August 31, 2006. Offers additional introductory academic experience by exploring course-related topics in greater depth with the professor. Available only to courses approved by the University Honors Program.
    ShareCS U278 - Honors Adjunct
    Favorite

  • CS U279: Honors Adjunct

    1.00 Credits
    Northeastern University

    Retired August 31, 2006. Offers additional introductory academic experience by exploring course-related topics in greater depth with the professor. Available only to courses approved by the University Honors Program.
    ShareCS U279 - Honors Adjunct
    Favorite

  • CS U290: Logic and Computation

    4.00 Credits
    Northeastern University

    Introduces formal logic and its connections to computer and information science. Offers an opportunity to learn to translate statements about the behavior of computer programs into logical claims and to gain the ability to prove such assertions both by hand and using automated tools. Considers approaches to proving termination, correctness, and safety for programs. Discusses notations used in logic, propositional and first order logic, logical inference, mathematical induction, and structural induction. Introduces the use of logic for modeling the range of artifacts and phenomena that arise in computer and information science.
    ShareCS U290 - Logic and Computation
    Favorite

  • CS U291: Lab for CS U290

    1.00 Credits
    Northeastern University

    Accompanies CS U290. Covers topics from the course through various experiments.
    ShareCS U291 - Lab for CS U290
    Favorite

  • CS U370: Object-Oriented Design

    4.00 Credits
    Northeastern University

    Presents a comparative approach to object-oriented programming and design. Discusses the concepts of object, class, meta-class, message, method, inheritance, and genericity. Reviews forms of polymorphism in object-oriented languages. Contrasts the use of inheritance and composition as dual techniques for software reuse: forwarding vs. delegation and subclassing vs. subtyping. Fosters a deeper understanding of the principles of object-oriented programming and design including software components, object-oriented design patterns, and the use of graphical design notations such as UML (unified modeling language). Basic concepts in object-oriented design are illustrated with case studies in application frameworks and by writing programs in one or more object-oriented languages.
    ShareCS U370 - Object-Oriented Design
    Favorite

  • CS U380: Computer Organization

    4.00 Credits
    Northeastern University

    Introduces the basic design of computing systems. Covers central processing unit (CPU), memory, input, and output. Provides a complete introduction to assembly language such as the basics of an instruction set plus experience in assembly language programming using a RISC architecture. Uses system calls and interrupt-driven programming to show the interaction with the operating system. Covers machine representation of integers, characters, and floating-point numbers. Describes caches and virtual memory.
    ShareCS U380 - Computer Organization
    Favorite

  • CS U390: Theory of Computation

    4.00 Credits
    Northeastern University

    Introduces the theory behind computers and computing aimed at answering the question, "What are the capabilities and limitations of computers " Covers automata theory, computability, and complexity. The automata theory portion includes finite automata, regular expressions, nondeterminism, nonregular languages, context-free languages, pushdown automata, and noncontext-free languages. The computability portion includes Turing machines, the Church-Turing thesis, decidable languages, and the Halting theorem. The complexity portionincludes big-O and small-o notation, the classes P and NP, the P vs. NP question, and NP-completeness.
    ShareCS U390 - Theory of Computation
    Favorite

  • CS U430: Database Design

    4.00 Credits
    Northeastern University

    Studies the design of a database for use in a relational database management system. The entity-relationship model and normalization are used in problems. Relational algebra and then the SQL (structured query language) are presented. Advanced topics include triggers, stored procedures, indexing, elementary query optimization, and fundamentals of concurrency and recovery. Students implement a database schema and short application programs on one or more commercial relational database management systems.
    ShareCS U430 - Database Design
    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)