Course Criteria

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

    The use of language theory and automata theory in the design of compilers. Syntax-directed compilers. Lexical analysis and computer implementation of finite state machines. Syntax analysis, parsing versus restructuring. Top-down and bottom-up parsing algorithms. TD(k) and LR(k) grammars. The Younges algorithm. Syntax-directed transducers. Prerequisites/Corequisites: Prerequisites: CSCI 6050 or equivalent and knowledge of PASCAL, C, or LISP. When Offered: Offered on availability of instructor. Credit Hours: 3
  • 3.00 Credits

    This course introduces methods that leverage the basic analysis techniques learned in Robotics I to develop numerical and algorithmic techniques needed to endow robots with the "intelligence" to devise strategies to solve problems they will encounter. Once these abilities are sufficiently well developed, robots will become safe and autonomous, thus paving the way for pervasive personal robots. Topics include: configuration spacerepresentation, cell decomposition, roadmap methods, rapidly-exploring random trees, simultaneous localization and mapping, contact modeling, grasping, and dexterous manipulation. Prerequisites/Corequisites: Prerequisite: CSCI 4480. When Offered: Spring Annually Cross Listed: Cross-listed with ECSE 6490, CSCI 4490, ECSE 4490. Credit Hours: 3 Contact, Lecture or Lab Hours: Lecture
  • 3.00 Credits

    This course studies theoretical foundations -namely Petri nets, process calculi, actors, join calculus, and mobile ambients-and practical issues in the design of concurrent and distributed programming languages. We compare communication and synchronization aspects in actor, process, and object-oriented concurrent programming models. Current research on coordination, mobility, naming, security, fault-tolerance, and scalability within the course contest is reviewed.Prerequisites/Corequisites: Prerequisites: CSCI 4430 and CSCI 4220 or equivalent or permission of instructor. When Offered: Spring term annually. Credit Hours: 3
  • 3.00 Credits

    This course covers fundamentals of distributed computing algorithms. The algorithms are studied for particular commonly used distributed computing system models such as: shared memory, message passing, and peer-to-peer systems. Some of the distributed computing problems studied are: mutual exclusion; leader election; Byzantine agreement; spanning trees; vertex coloring. This course also studies distributed routing algorithms for store-andforward, optical wireless and sensor networks. Prerequisites/Corequisites: Prerequisite: CSCI 2300. When Offered: Spring term annually Credit Hours: 3
  • 3.00 Credits

    In this course, there will be a survey of classic papers and current research in computer graphics. Topics include: advanced ray tracing, global illumination, photon mapping, subsurface scattering, mesh generation and simplification, subdivision surfaces, volumetric modeling, procedural modeling and texturing, weathering, physical simulation, appearance models. Course activities include programming assignments, oral presentations and a term project. Prerequisites/Corequisites: Prerequisites: CSCI 2300; previous coursework or experience in computer graphics such as ECSE 4750 or computational geometry is recommended. When Offered: Spring semester. Cross Listed: Cross-listed with CSCI 4530. Credit Hours: 3
  • 4.00 Credits

    Gaussian elimination, special linear systems (such as positive definite, banded, or sparse), introduction to parallel computing, iterative methods for linear systems (such as conjugate gradient and preconditioning), QR factorization and least squares problems, and eigenvalue problems. Prerequisites/Corequisites: Prerequisite: MATH 4800 or CSCI 4800 or permission of instructor. When Offered: Fall term even-numbered years. Cross Listed: Cross-listed as MATH 6800. Students cannot obtain credit for both this course and MATH 6800. Credit Hours: 4
  • 4.00 Credits

    Numerical methods and analysis for ODEs with applications from mechanics, optics, and chaotic dynamics. Numerical methods for dynamic systems include Runge-Kutta, multistep and extrapolation techniques, methods for conservative and Hamiltonian systems, methods for stiff differential equations and for differential-algebraic systems. Methods for boundary value problems include shooting and orthogonalization, finite difference and collocation techniques, and special methods for problems with boundary or shock layers. Prerequisites/Corequisites: Prerequisite: MATH 4800 or CSCI 4800 or permission of instructor. When Offered: Spring term odd-numbered years. Cross Listed: Cross-isted as MATH 6820. Students cannot obtain credit for both this course and MATH 6820. Credit Hours: 4
  • 4.00 Credits

    Numerical methods and analysis for linear and nonlinear PDEs with applications from heat conduction, wave propagation, solid and fluid mechanics, and other areas. Basic concepts of stability and convergence (Lax equivalence theorem, CFL condition, energy methods). Methods for parabolic problems (finite differences, method of lines, ADI, operator splitting), methods for hyperbolic problems (vector systems and characteristics, dissipation and dispersion, shocks capturing and tracking schemes), methods for elliptic problems (finite difference and finite volume methods). Prerequisites/Corequisites: Prerequisite: MATH 4800 or CSCI 4800 or permission of instructor. When Offered: Fall term odd-numbered years. Cross Listed: (Cross listed as MATH 6840. Students cannot obtain credit for both this course and MATH 6840). Credit Hours: 4
  • 4.00 Credits

    Galerkin's method and extremal principles, finite element approximations (Lagrange, hierarchical and 3-D approximations, interpolation errors), mesh generation and assembly, adaptivity (h-, p-, hp-refinement). Error analysis and convergence rates. Perturbations resulting from boundary approximation, numerical integration, etc. Time dependent problems including parabolic and hyperbolic PDEs. Applications will be selected from several areas including heat conduction, wave propagation, potential theory, and solid and fluid mechanics. Prerequisites/Corequisites: Prerequisite: MATH 4800 or CSCI 4800 or permission of instructor. When Offered: Spring term even-numbered years. Cross Listed: (Cross listed as MATH 6860. Students cannot obtain credit for both this course and MATH 6860.) Credit Hours: 4
  • 1.00 Credits

    Presentation of current developments in computer science. Reports by students. Credit Hours: 1
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)
Privacy Statement   |   Terms of Use   |   Institutional Membership Information   |   About AcademyOne   
Copyright 2006 - 2024 AcademyOne, Inc.