[PORTALNAME]

Course Criteria

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

  • CS 262: Information Management

    3.00 Credits
    Knox College

    Uses the idea of information as a unifying theme to investigate a range of issues in database systems, artificial intelligence, and data communications. Topics covered include information models and systems, database systems, relational databases, knowledge representation and reasoning, intellectual property, and privacy and civil liberties. Prereq: CS 142; D. Blaheta
    ShareCS 262 - Information Management
    Favorite

  • CS 292: Software Development and Professional Practice

    3.00 Credits
    Knox College

    Covers elementary topics in software engineering essential to the design and development of larger software projects. Topics include requirements management, design, software evolution, testing, and project management. Students typically work in teams on a medium-sized software project. Issues of social responsibility, intellectual property, copyright, and assessing the risks in computer systems are discussed. Prereq: Any 200-level Computer Science course.; O; W; J. Dooley
    ShareCS 292 - Software Development and Professional Practice
    Favorite

  • CS 303: Computer Graphics

    3.00 Credits
    Knox College

    Mathematical theories, algorithms, software systems, and hardware devices for computer graphics. Translation, rotation, scaling, projection, clipping, segmented display files, hidden line and surface elimination, surface texturing, point plotting display, raster display, random stroke display, input of graphical data. Prereq: CS 205 and MATH 152 (or equivalent); STAFF
    ShareCS 303 - Computer Graphics
    Favorite

  • CS 305: Operating Systems

    3.00 Credits
    Knox College

    Advanced management of computer resources such as storage, processors, peripheral devices, and file systems. Storage allocation, virtual memory, scheduling algorithms, synchronization, mutual exclusion, deadlock, concurrent programming, processes, inter-process communication, protection, operating system organization. Prereq: CS 226 and CS 201; STAFF
    ShareCS 305 - Operating Systems
    Favorite

  • CS 306: Automata Theory and Programming Languages

    3.00 Credits
    Knox College

    Automata theory (finite machines, Turing machines, regular expressions, context-free languages); computability theory (decidable and undecidable languages, problems that are solvable and not solvable by computers); complexity theory (time and space complexity of algorithms, NP-completeness, intractability); a critical study of the design issues that underlie modern programming languages including the study of lexical and syntactic analysis and the important programming paradigms. Prereq: CS 142 and MATH 175; D. Bunde
    ShareCS 306 - Automata Theory and Programming Languages
    Favorite

  • CS 308: Networks and Distributed Systems

    3.00 Credits
    Knox College

    Covers advanced topics in computer/data networking. Topics include media types, network architectures, common networking practices and components, network design fundamentals, network management technologies and practices, and an introduction to various service and maintenance protocols (IP, DNS, DHCP, WINS, etc.). Prereq: CS 226; STAFF
    ShareCS 308 - Networks and Distributed Systems
    Favorite

  • CS 310: Compilers and Interpreters

    3.00 Credits
    Knox College

    Theory and practice of computer programming language translation. Lexical analysis, syntax analysis, finite state automata, parsing methods, error handling, error recovery, compiler organization, interpretation, intermediate languages, code generation and optimization techniques. Prereq: CS 201 and CS 306; STAFF
    ShareCS 310 - Compilers and Interpreters
    Favorite

  • CS 317: Artificial Intelligence

    3.00 Credits
    Knox College

    A survey of topics in the branch of computer science concerned with creating and understanding "intelligent" computer systems,including advanced search techniques and heuristics, knowledge representation, expert systems, natural language processing, machine learning, and game playing. Topics will also include the study of the nature of intelligence and the representation of intelligent machines in fiction. Prereq: CS 262 or permission of the instructor; D. Blaheta
    ShareCS 317 - Artificial Intelligence
    Favorite

  • CS 320: Database Systems

    3.00 Credits
    Knox College

    Theory and management of database management systems, including database models, design principles, file organizations, data structures and query organization for efficient access, query languages, database-interface applications, normalization and relational concepts such as views, procedural database programming and referential integrity. Prereq: CS 262; STAFF
    ShareCS 320 - Database Systems
    Favorite

  • CS 322: Software Engineering

    3.00 Credits
    Knox College

    Building large-scale computing systems uses requirements analysis, project planning, extensive documentation, cooperative teamwork, and design techniques to decompose a system into independent units. The course covers all the phases of large-scale system development. Different development models are examined including the waterfall model, the spiral mode, rapid prototyping, and extreme programming. Students typically work together in teams to build a term-long project, gaining practical experience with developing larger systems. Prereq: CS 292; O; W; J. Dooley
    ShareCS 322 - Software Engineering
    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)