Page 230 - 2016-2018 Graduate Catalog (Revised)
P. 230

COSC  517     SATELLITE OPERATIONS AND CONTROL
               Prerequisites: Graduate status
               Credits: 3
               This course provides students with a basic understanding of satellite
               operations  and  control.  Topics  to  be  covered  include:  orbits,  launch
               vehicle and propulsion spacecraft systems, satellite communications,
               ground systems, earth stations, flight software and table maintenance,
               analysis of data.

               COSC    518    COMPUTER GRAPHICS I
               Prerequisites: COSC 502 and COSC 504
               Credits: 3
               Two-Dimensional  (2D)  interactive  graphics.  Basic  clipping  and  scan
               conversion techniques, 2D homogeneous coordinate system, graphics
               hardware and software systems, user interfaces, graphics standards,
               and rendering techniques.

               COSC  522     DISCRETE STRUCTURES
               Prerequisites: Graduate Status
               Credits: 3
               A survey of those areas in mathematics that are particularly useful to
               computer science. Topics discussed include set theory, relations and
               functions,  equivalence  and  order  relations,  digraphs  and  trees,  and
               probability concepts.
               COSC  523     LOGIC, COMPUTABILITY AND AUTOMATA
               Prerequisites: COSC 522
               Credits: 3
               An elementary development of propositional and predicate logics, set
               and Boolean algebras with a discussion of Markov algorithms, Turing
               machines  and  recursive  functions.  Topics  include  post  productions,
               word problems and formal languages.

               COSC    528    DESIGN AND ANALYSIS OF ALGORITHMS
               Prerequisites: COSC 504 and COSC 522
               Credits: 3
               This course includes discussion of design and analysis of basic computer
               algorithms  based  on  the  following  techniques:  divide-and-conquer,
               greedy, dynamic programming, tree and graph traversals, backtracking,
               and  branch-and-bound  method.  Applications  to  problems,  such  as
               sorting and searching, traveling salesman, knapsack, graph coloring, set



                                                                      229
   225   226   227   228   229   230   231   232   233   234   235