Page 211 - Bowie State University Graduate Catalog 2018-2020.
P. 211

Prerequisites: COSC 561
          Credits: 3
          Continuation of COSC 561. Advanced topics in compiler design and
          construction. Automated compiler tools and compiler compilers. Advanced
          code optimization techniques. Compilation of different computational models.
          Role of compilers in natural language processing.

          COSC  665    SOFTWARE ENGINEERING II
          Prerequisites: COSC 565
          Credits: 3
          The course will cover software life-cycle models and different phases of the
          software development process. Object-oriented techniques are applicable.
          Students will have a group project on developing complex software systems.

          COSC  673    ARTIFICIAL INTELLIGENCE II
          Prerequisites: COSC 573
          Credits: 3
          Continuation of COSC 573. Advanced topics in artificial intelligence, such as
          natural language understanding, computer vision, machine learning, robotics,
          neural networks, automatic theorem proving, and an in-depth look into the
          design and implementation of intelligent computer systems.

          COSC  675    APPLIED COMBINATORICS AND GRAPH THEORY
          Prerequisites: COSC 522
          Credits: 3
          General enumeration methods, difference equations, generating functions.
          Elements of graph theory, matrix representations of graphs, applications of
          graph theory to transport networks, matching theory and graphical algorithms.

          COSC  676    QUEUEING THEORY IN COMPUTER SCIENCE
          Prerequisites: COSC 504 and COSC 522
          Credits: 3
          The development of queueing theory and the application of that theory to
          discrete simulations, in general, and to computer systems, in particular. Topics
          include random processes, characterization of different queueing systems, the
          classical single-server exponential queueing system model, additional single
          and multiple-server queueing models, including birth-death processes and
          finite sources, and the assumptions and limitations of the various queueing
          models. The applications of queueing theory to computer systems are
          emphasized.



                                                                        210
   206   207   208   209   210   211   212   213   214   215   216