Fall 2007

Introduction to the design of solutions to computer solvable problems. Algorithm design, solution implementation using a high-level programming language, program correctness and verification.

Linear lists, strings, arrays, and orthogonal lists; graphs, trees, binary trees, multilinked structures, sorting techniques; dynamic storage allocation; applications.

The principles of object-oriented programming are examined using Java. Topics include graphics, graphical user interfaces and multi-threaded programming.

Examination of key disciplines of computing systems: architecture, operating systems, digital logic, VLSI, networks, AI, robotics, graphics, and algorithms. Includes hardware/software laboratory tours and exercises.

Boolean algebra; number systems; Boolean function synthesis; binary arithmetic; codes; combinational logic devices; sequential circuits; state machine design and implementation.

Historical, technical, and critical approach to the evolution of computer and video game architectures and game design, from its beginnings to the present day.

The object-oriented paradigm for programming-in-the-large (using the C++ language); UNIX tools for software development; developing window-based applications under X-windows.

Models for discrete structures; finite state automata, regular sets. Selected applications of logic and combinatorics to program correctness, algorithms and complexity, programming language semantics and databases.

History of video games; overview of game genres; phases of video game development (concept, preproduction, production, post-production); roles of artists, programmers, designers, and producers.

Explores the aesthetic development/technical implementation necessary to achieve unique, compelling, intuitive visual design in games. Students will develop group visual game design portfolios.

Coursework taken off campus. Title of course taken at other institution appears as a section title.

Upper and lower bounds on sorting and order median. Deterministic and random computation, data structures, NP-completeness, cryptography, Turing machines and undecidability.

HTML progrmming for creating home pages, installation and modification of Web server, writing progrms that offer enhanced services, manipulation of graphics, video and sound.

Organization and operation of the processor, memory and I/O of a minicomputer at the machine language level; assembly language programming; data representation and computer arithmetic.

Introduction of principles, methods, techniques, and tools for multi-person construction of multi-version software systems.

Underlying concepts and principles required for programming video games (topics include vectors, transformations, 3-D math, geometric primitives, matrices).

Basic issues in concurrency, deadlock control, synchronization scheduling, memory management, protection and access control, inter-process communication, and structured design. Laboratory experiences with Unix-like operating system. Not available for graduate credit to computer science majors.

Concepts of assemblers, compilers, interpreters and their design; macro assemblers, Polish notation and translation techniques; operator precedence parsing; push down automata; code generation. Not available for graduate credit to computer science majors.

Designing, building and programming mobile robots; sensors, effectors, basic control theory, control architectures, some advanced topics, illustrations of state-of-the-art. Teamwork; final project tested in a robot contest. Junior standing or higher.

Network architectures; layered protocols, network service interface; local networks; long-haul networks; internal protocols; link protocols; addressing; routing; flow control; higher level protocols.

Operation and timing of 8/16/32-bit microprocessors; asynchronous and synchronous SRAM interface; burst and pipelined bus cycles, parallel and serial I/O, interrupt controller, DMA controller, bus protocols; hardware/simulation labs. Recommended preparation: EE 457

Intensive introduction to programming principles, discrete mathematics for computing, software design and software engineering concepts. Not available for credit to computer sciencemajors, graduate or undergraduate.

Register transfer level machine organization; MIPS instruction setarchitecture; performance; computer arithmetic; organization and detailed implementation of non-pipelined and pipelined processors; cache and virtual memory. Not available for graduate credit to computer science majors.

Rounding errors in digital computation; solution of linear algebraic systems; Newton's method for nonlinear systems; matrix eigenvalues; polynomial approximation; numerical integration; numerical solution of ordinary differential equations.

Concepts and algorithms underlying the understanding and construction of intelligent systems. Agents, problem solving, search, representation, reasoning, planning, communication, perception, robotics, neural networks.

Hardware for interactive graphic systems; picture representations; data structures for graphics; picture processing techniques; languages for graphics; survey of applications such as animation and simulation.

File input/output techniques, basic methods for file organization, file managers, principles of databases, conceptual data models, and query languages.

Develop applications of interactive technology that extend beyond the traditional videogame market: education, health, training, policy exploration, analytics, visualization, simulation, the arts and therapy.

Techniques for building the core components of a game engine; 2-D/3-D graphics, collision detection, artificial intelligence algorithms, shading, programming input devices.

Individual research and readings. Not available for graduate credit.

a: Design, iterative prototyping, and development of a 1st playable level.

Computational linear algebra; solution of general nonlinear systems of equations; approximation theory using functional analysis; numerical solution of ordinary and partial differential equations.

a: Initial value problems; multistep methods, stability, convergence and error estimation, automatic stepsize control, higher order methods, systems of equations, stiff problems; boundary value problems; eigenproblems. Prerequisite: 501 or 502a or consent of instructor. b: Computationally efficient schemes for solving PDE numerically; stability and convergence of difference schemes, method of lines; fast direct and iterative methods for elliptic equations. Prerequisite: 501 or 502a or consent of instructor.

Populations, permutations, combinations, random variables, distribution and density functions, conditional probability and expectation,; binomial, poisson, and normal distributions; laws of large numbers, central limit theorem. Prerequisite: Consent of Instructor.

Theories of management and their application to software projects. Economic analysis of software products and processes. Software cost and schedule estimation, planning and control.

Fundamental techniques of computer animation and simulation, knowledge and/or experience in the design, scripting, production and post-production stages of computer animation.

The principles of developing game engines targeted at modern PC and game console hardware.

Design and implementation of networked games, from the origins of the supporting technologies in distributed systems, visual simulations, networked virtual environments, and shipped games.

Explore the complex engineering process required to design and build a real-time graphics engine to support physical realism on mobile devices.

Team projects intended to address the multifaceted technical and creative challenges that are inherent to comprehensive game development.

Protecting computer networks and systems using cryptography, authentication, authorization, intrusion detection and response. Includes lab to provide practical experience working with such systems.

Intensive overview of cryptography for practitioners, historical perspective on early systems, number theoretic foundations of modern day cryptosystems and basic cryptanalysis.

Computation and adaptation in networks of interconnected distributed processing units; classical and statistical approaches to neural nets; state-of-the-art neural network research. Recommended preparation: basic statistics, linear algebra

Protocol design for computer communication networks, network routing, transport protocols, internetworking.

Asynchronous channels and architectures; implementation design styles; controller synthesis; hazards, and races; Petri-nets; performance analysis, and optimization; globally asynchronous locally synchronous design. Open only to graduate students.

Advanced issues in Computer Organization, Naming, Kernel Design, Protection Mechanism and Security Policies, Reliable Computing, data base OS, Secure Networks, Systems Specification, Decentralized Systems, Real Time Systems.

Comparative studies of computer system components: the CPU, memory, and I/O; analytical modeling techniques to allow comparative evaluation of architectures; parallelism and supercomputers.

Students complete laboratory exercises in operating system and network management, distributed systems, TCP/IP, SNMP, NFS, DNS, etc. Term project required. Recommended preparation: 551, 555

Foundations of symbolic intelligent systems, search, logic, knowledge representation, planning, learning. Recommended preparation: good programming and algorithm analysis skills

Acquiring computer-tractable linguistic knowledge has always been a bottleneck in building natural language systems. We will examine statistical techniques for extracting knowledge automatically from online text.

Introduce neural modelling, distributed artificial intelligence and robotics approaches to vision, motor control and memory. Prerequisite: Graduate standing.

Study of self-modifying computer systems that acquire new knowledge and improve their own performance; topics include induction, explanation-based learning, analogy, discovery, and connectionist learning. Prerequisite: CSCI-561.

Explores fundamental techniques such as recursion, Fourier transform ordering, dynamic programming for efficient algorithm construction. Examples include arithmetic, algebraic, graph, pattern matching, sorting, searching algorithms.

Advanced study of programming languages with application to the Web. Languages for client-side and server-side processing. Examples taken from: HTML, Java, JavaScript, Perl, XML and others. Recommended preparation: knowledge of at least two programming languages

Description and recognition of objects, shape analysis, edge and region segmentation, texture, knowledge based systems, image understanding.

State-of-the-art technology for networked multimedia systems such as: system design, I/O technologies, data management, data compression, networking and telecommunications. Design of real-world multimedia solution. Recommended preparation: familiarity with C or C++

A: Software life-cycle processes; planning considerations for product definition, development, test, implemetation, maintenance. Team project. Graduate standing.

Course outlines the process of creating images from 3D models. Includes transformations, shading, lighting, rastorization, texturing, and other topics.

Geometric algorithms from graphics, vision, geometric modeling, and optimization are studied in a unified way. Topics include proximity, motion planning, Voronoi diagrams, convex hulls. Prerequisite: 303

Survey of robot control and learning methods from technical papers. Control architectures, adaptation, learning, cooperation, distributed v. centralized approaches, cooperative and competitive systems.

Database system architecture; conceptual database models; semantic, object-oriented, logic-based, and relational databases; user and program interfaces; database system implementation; integrity, security, concurrency and recovery.

Federated and multi-database systems, database networking, conceptual and schematic diversity, information sharing and exchange, knowledge discovery, performance issues.

Mathematical techniques employed in computer-aided-design systems, including: graph theory, algorighmic and heuristic techniques for combinatorial problems, data structures and modeling. Recommended preparation: CSCI 570, CSCI 455.

The design and implementation of user interface software. Study of issues relating to human/computer interaction. Visual design and real-time interfaces.

Software engineering methods and techniques for embedded, resource constrained, and mobile environments. Applications to real-time operating systems and wireless networking systems. Class project.

Research leading to the master's degree. Maximum units which may be applied to the degree to be determined by the department. Graded CR/NC.

Credit on acceptance of thesis. Graded IP/CR/NC.

Credit on acceptance of thesis. Graded IP/CR/NC.

Credit on acceptance of thesis. Graded IP/CR/NC.

Hands-on training on the basics of parallel computing and scientific visualization in the context of computer simulations in science and engineering.

Introduction of Ph.D. students to the broad range of computer science research. Two semesters registration required. Open to Computer Science doctoral students only. Graded CR/NC.

Course content to be selected each semester from recent developments in computer science.

Sensor network applications, design and analysis. Deployment; energy-efficiency; wireless communications; data-centric operation; capacity and lifetime; collaborative signal processing; reliability, fault-tolerance and security. Recommended preparation: EE 465, good programming/mathematical skills

Fault models; test generation; fault simulation; self-checking and self-testing circuits; design for testability; fault tolerant design techniques; case studies.

Current topics in network and distributed systems; bernal and written presentation skills, effective critiquing, and evaluation.

Research leading to the doctorate. Maximum units which may be applied to the degree to be determined by the department. Graded CR/NC.

Credit on acceptance of Dissertation. Graded CR/NC.

Credit on acceptance of Dissertation. Graded CR/NC.

Credit on acceptance of Dissertation. Graded CR/NC.

Credit on acceptance of Dissertation. Graded CR/NC.

Credit on acceptance of Dissertation. Graded CR/NC.