2007-2008 Undergraduate Catalog - Kettering University

Course Descriptions / 141
COMM-435 Written & Oral Communication for Overseas Students
Prerequisite: NA 4 0 0 4
Minimum Class Standing: NA
This course, intended for overseas students, seeks to heighten their awareness
of American business communication practices. It will help develop a
systematic approach to written and oral communication in the workplace.
Topics include the nature of organizational communication and business
writing, including techniques for writing letters, memoranda, proposals, and
reports. Electronic communication practices are examined. Emphasis is
also placed on professional communication skills in multicultural
environments and relevant current events. This course does not receive credit
in any Kettering University degree program.Terms Offered: Fall, Spring
CS-101 Computing and Algorithms I 3 0 2 4
Prerequisite: NA
Minimum Class Standing: NA
An introduction to algorithmic problem solving, with emphasis on elementary
program and software engineering techniques. Syntax and semantics of a
modern programming language; programming and debugging at the file level;
true object-orientation; Strings, arrays, sorting, inheritance, and exception
handling. Terms Offered: All
CS-102 Computing and Algorithms II 3 0 2 4
Prerequisite: CS-101
Minimum Class Standing: NA
A second course in algorithmic problem solving. Recursion, abstract data
types, dynamic data structures, comparison-based sorting, elementary
algorithm analysis, design of software projects of moderate size, and
continuing development of programming skills. Terms Offered: All
CS-202 System Programming Concepts 3 0 2 4
Prerequisite: CS-102
Minimum Class Standing: SO
Fundamental system programming concepts are examined using the C
programming language. Topics include: machine organization, data
representation, interrupt handling, I/O, file management, dynamic structures,
parameter passing, memory management, system calls, process creation,
process control, interprocess communication, and language interfaces. Terms
Offered: All
CS-203 Computing & Algorithms III 3 0 2 4
Prerequisites: CS-102, CS-211
Minimum Class Standing: SO
The design and analysis of advanced data structures and algorithms.
Algorithm design techniques, algorithm analysis techniques, advanced data
structures, advanced sorting, applications to various problem domains. Terms
Offered: All
CS-211 Discrete Mathematics 4 0 0 4
Prerequisite: NA
Corequisite: MATH-101
Minimum Class Standing: NA
Propositional and first-order logic; logical equivalence and inference. Proof
techniques, mathematical induction and principle of diagonalization. Set
operations, relations, functions. Introduction to graphs and trees and their
applications to computer science. Lattice structures and Boolean algebras.
Truth tables and minimization of Boolean expressions. Terms Offered: All
CS-300 The Computing Professional 4 0 0 4
Prerequisites: CE-210 or CS-102, COMM-101
Minimum Class Standing: SO
An examination of the profession of computing from historical and ethical
perspectives. Overview of the history of computing, from the earliest
computational devices and theoretical foundations to modern developments.
Discussion of the social impact of computing on society and the ethical
implications for computing professionals, including analysis of case studies.
Terms Offered: Summer, Fall
CS-312 Theory of Computation 4 0 0 4
Prerequisites: CS-102, CS-211
Minimum Class Standing: SO
Regular languages and grammars; finite-state machines and transducers;
relationships between finite-state automata and regular languages. Contextfree
languages and grammars; language recognition with stack machines and
parsers. Properties of formal languages. Computability and undecidability.
Introduction to computational complexity. Terms Offered: All
CS-320 Computer Graphics 3 0 2 4
Prerequisites: CS-102, MATH-101
Minimum Class Standing: SO
An introduction to computer graphics. Rendering and curve drawing
techniques, clipping algorithms, light and reflection models, object
transformations. Introduction to three-dimensional graphics. Terms Offered:
Fall, Winter
CS-331 Programming Language Design 4 0 0 4
Prerequisites: CS-203, CS-312
Minimum Class Standing: JR
A study of the principles behind the design of programming languages.
Syntactical design, control structures, data structures, naming and
environments, language design tools, historical development, implementation
issues. Terms Offered: Summer, Fall
CS-341 Web Software Tools 3 0 2 4
Prerequisite: CS-102
Minimum Class Standing: NA
World Wide Web programming tools. Introduction to web programming. Web
development, client-side development using HTML and its extensions, serverside
development. Complete web system. Computer technologies including
several computer languages. Terms Offered: Winter, Spring
CS-415 Cryptography 4 0 0 4
Prerequisite: CS-203
Minimum Class Standing: JR
A study of modern data security. Mathematical foundations of cryptography.
Classical cryptographic systems and computer attacks on these systems.
Cryptographic security over unsecure communication paths: cryptographic
protocols, oblivious transfers, proofs of identity, signature schemes. Modern
cryptographic systems: data encryption standards, public-key systems, key
generation and management. External considerations are presented and
discussed: security organizations role in security, privacy considerations,
import/export issues. Terms Offered: Summer, Fall
CS-421 Applied Graph Theory 3 0 2 4
Prerequisite: CS-203
Minimum Class Standing: JR
Topics in graph theory including subgraphs, trees, connectivity, graph
traversal, directed graphs, planarity, graph matching and coloring, and
advanced graph decomposition techniques. Emphasis will be on graph
algorithms and their complexity. Graphs will be used to develop solutions to
problems from various areas such as electrical engineering, operations
research, and business applications. Terms Offered: Summer, Fall
CS-425 Parallel Models and Algorithms 3 0 2 4
Prerequisite: CS-203
Minimum Class Standing: JR
An introduction to various models for parallel computation, such as PRAM
models, vector processors, interconnection networks, trees, meshes,
hypercubes, and sorting networks. Performance measures for parallel models
and for parallel algorithms. Parallel algorithms for searching, sorting, merging,
trees, graphs, and the study of their efficiency. Implementation of some parallel
algorithms are on a parallel machine. Terms Offered: Summer, Fall
CS-431 Compiler Design and Construction I 3 0 2 4
Prerequisites: CS-203, CS-312
Minimum Class Standing: JR
A study of compiler design techniques; scanning, parsing, error recovery and
intermediate code generation and optimization; tools for compiler
construction, including scanner generators and compiler-compilers.
Construction of a working compiler front-end. Terms Offered: Winter, Spring