2008–2009 - Florida Institute of Technology
2008–2009 - Florida Institute of Technology
2008–2009 - Florida Institute of Technology
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
CSE 4520 SPECIAL TOPICS IN SOFTWARE ENGINEERING (3 credits).<br />
Provides instruction and experience in timely topics related to the production <strong>of</strong><br />
quality-engineered s<strong>of</strong>tware. May be repeated for a maximum <strong>of</strong> nine credits, provided<br />
the topics change. (Requirement: Instructor approval.)<br />
CSE 4610 REQUIREMENTS ENGINEERING (3 credits). Studies in depth<br />
s<strong>of</strong>tware requirements, engineering tools and techniques. Includes gathering user<br />
requirements, formal specification <strong>of</strong> system behavior, system interfaces, end user<br />
and system documentation and validation techniques. Emphasizes the end-user<br />
aspect <strong>of</strong> gathering and formalizing user expectations. Prerequisites: CSE 2410.<br />
CSE 4621 SOFTWARE METRICS AND MODELING (3 credits). Examines<br />
common s<strong>of</strong>tware metrics, axiomatic foundations <strong>of</strong> measurement, validity <strong>of</strong><br />
measurements and measurement dysfunction, and some statistical and modeling<br />
approaches to help students make their s<strong>of</strong>tware measurements meaningful. Prerequisites:<br />
CSE 2400, CSE 2410.<br />
CSE 5210 FORMAL LANGUAGES AND AUTOMATA THEORY (3 credits).<br />
Presents abstract models <strong>of</strong> computers (finite automata, pushdown automata and<br />
Turing machines) and the language classes they recognize or generate (regular, context-free<br />
and recursively enumerable). Also presents applications in compiler design,<br />
algorithms and complexity theory. Prerequisites: CSE 2010.<br />
CSE 5211 ANALYSIS OF ALGORITHMS (3 credits). Presents time and space<br />
complexity <strong>of</strong> computer algorithms. Includes algorithm classes, such as divide-andconquer,<br />
greedy, dynamic programming and backtracking; techniques for solving<br />
recurrence equations; graph algorithms; searching and sorting; and deterministic and<br />
nondeterministic polynomial time problem classes. Prerequisites: CSE 2010 or<br />
CIS 5200, MTH 1002.<br />
CSE 5231 COMPUTER NETWORKS (3 credits). Covers theory, design and<br />
analysis <strong>of</strong> computer communication systems. Includes TCP/IP, Internet, the World<br />
Wide Web, ISO-OSI network architecture, LANs (Ethernet, Fast Ethernet, Token<br />
Ring, Token Bus, etc.) FDDI, ATM, SONET, wireless communications, satellite<br />
networks, DNS, firewalls, network modeling and simulation. Prerequisites: CSE 2400,<br />
MTH 1002.<br />
CSE 5232 NETWORK PROGRAMMING (3 credits). Covers design and implementation<br />
<strong>of</strong> programs that communicate with other programs across a computer<br />
network. Includes streams, server-side networking, client-side networking, multithreading,<br />
exceptions and remote method invocation. Prerequisites: CSE 2010.<br />
CSE 5233 COMPUTER FORENSICS (3 credits). Introduces concepts and<br />
techniques for the seizure and examination <strong>of</strong> digital evidence, along with the legal<br />
and ethical issues related to reporting on the results. Covers forensic tools and<br />
investigative procedures and includes a survey <strong>of</strong> current literature. Prerequisites:<br />
CSE 3101, CSE 4001.<br />
CSE 5240 PARALLEL PROCESSING (3 credits). Investigates architectures for<br />
parallel computers and parallel algorithms for computational problems. Discusses<br />
performance evaluation metrics for the performance <strong>of</strong> parallel processing.<br />
CSE 5241 DISTRIBUTED COMPUTING (3 credits). Studies the fundamental<br />
concepts in s<strong>of</strong>tware systems that support and work in a distributed computing environment.<br />
Includes discussion <strong>of</strong> network communication mechanisms, distributed<br />
operating systems, services supporting distributed systems, distributed database<br />
systems, fault-tolerant systems and distributed algorithms. Prerequisites: CSE 4001.<br />
CSE 5250 PROGRAMMING LANGUAGES (3 credits). Surveys programming<br />
language concepts including language features, implementation issues and language<br />
groups. Prerequisites: CIS 5200 or CSE 2010.<br />
CSE 5251 COMPILER THEORY AND DESIGN (3 credits). Covers extensively<br />
the major topics <strong>of</strong> compiler design. Includes lexical analysis, scannergenerator<br />
tools, parsing, syntax-directed translation, static semantic checking, storage<br />
organizations, code generation and code optimization. Prerequisites: CSE 2010,<br />
CSE 3101.<br />
CSE 5260 DATABASE SYSTEMS (3 credits). Introduces the analysis and design<br />
<strong>of</strong> typical database systems. Includes theoretical and practical aspects <strong>of</strong> designing<br />
database systems and a substantial project. Prerequisites: CIS 5200 or CSE 2010.<br />
CSE 5261 INFORMATION RETRIEVAL (3 credits). Overviews key models<br />
(vector space, Boolean, probabilistic) and utilities (relevance ranking, relevance feedback,<br />
n-gram processing) for information retrieval. Also describes additional models<br />
and utilities based on current trends in the field. Presents benchmarking efforts and<br />
case studies. Corequisites: CSE 5260.<br />
CSE 5280 COMPUTER GRAPHICS (3 credits). Presents the graphics pipeline<br />
for polygonal-based models. Includes mathematical concepts and data structures<br />
for graphics, coordinate systems, clipping, scan conversion, hidden-object detection,<br />
rendering, color models and graphics programming standards. Prerequisites: CSE 2050<br />
or CIS 5200, MTH 1002.<br />
CSE 5281 GRAPHICAL USER INTERFACES (3 credits). Studies the theories<br />
and techniques <strong>of</strong> human-computer interaction and the design <strong>of</strong> direct manipulation<br />
graphical-user interfaces that support menus, buttons, sliders and other widgets<br />
for input, text and graphics for output. Students design, implement and evaluate a<br />
graphical-user interface.<br />
CSE 5283 COMPUTER VISION (3 credits). Develops computational methods<br />
that model the capacity <strong>of</strong> the human vision system. Develops main concepts <strong>of</strong><br />
computer vision research and its applications including robot navigation and interaction,<br />
autonomous exploration, traffic monitoring, biometrics identification and building<br />
3-D images. Prerequisites: CSE 2010.<br />
CSE 5290 ARTIFICIAL INTELLIGENCE (3 credits). Introduces the theoretical<br />
foundations <strong>of</strong> artificial intelligence, focusing on the areas <strong>of</strong> automated<br />
reasoning, search and heuristics. Introduces an AI language to implement concepts.<br />
Prerequisites: CIS 5200 or CSE 2010.<br />
CSE 5294 THEORY AND APPLICATIONS OF NEURAL NETWORKS<br />
(3 credits). Includes learning in a single neuron, single and multi-layer perceptrons,<br />
recurrent neural networks, structured neural networks, neural networks to<br />
perform principal component analysis, principal component regression and partial<br />
least squares regression. (Requirement: Instructor approval or prerequisite course.)<br />
Prerequisites: ECE 5201 or MTH 5102.<br />
CSE 5400 TOPICS IN COMPUTER SCIENCE (3 credits). Current topics in<br />
computer science at the introductory graduate level. Topics vary and the course may<br />
be repeated for credit. (Requirement: Instructor approval.)<br />
CSE 5401 INDEPENDENT STUDY IN COMPUTER SCIENCE (1–3 credits).<br />
Working closely with a faculty member, the student probes a subject in greater<br />
depth than is normally possible in a regular class. Requires a comprehensive paper or<br />
an applied research project. (Requirement: Instructor approval.)<br />
CSE 5500 COMPUTER SCIENCE SEMINAR (0 credits). Presentations by<br />
faculty, graduate students and guest speakers on topics <strong>of</strong> current interest. May be<br />
repeated for credit.<br />
CSE 5501 COMPUTER SCIENCES INTERNSHIP (0 credits). Industrybased<br />
internship experience under the supervision <strong>of</strong> a graduate faculty member, to<br />
provide pr<strong>of</strong>essional experience for graduate students without prior experience in a<br />
practical information technology setting. (Requirement: At least nine graduate credit<br />
hours in computer sciences completed with at least a 3.0 GPA, and permission <strong>of</strong> the<br />
instructor.)<br />
CSE 5610 COMPUTATIONAL COMPLEXITY (3 credits). Reviews problems,<br />
algorithms, Turing machines and computability. Studies Boolean and first-order<br />
logic, leading to undecidability results; and relations among complexity classes using<br />
reductions and completeness. Presents approximate and randomized algorithms.<br />
Prerequisites: CSE 5210, CSE 5211.<br />
CSE 5615 COMPUTATIONAL MOLECULAR BIOLOGY (3 credits).<br />
Introduces important computational problems related to molecular biology. Includes<br />
motif finding, approximate sequence alignment, phylogeny construction and system<br />
biology. Requires knowledge in programming, discrete mathematics, data structures<br />
and algorithms. Does not require prerequisite biological sciences (BIO) course.<br />
CSE 5620 ADVANCED COMPUTER ARCHITECTURE (3 credits). Covers<br />
design <strong>of</strong> interleaved memory systems and multiprocessor caches; linear and nonlinear<br />
pipelines; data-flow and reduction machines; Vector computers, multiprocessors<br />
and array processors. Includes performance, scheduling and scalability <strong>of</strong> parallel<br />
machines. Prerequisites: ECE 4551.<br />
CSE 5630 ADVANCED OPERATING SYSTEMS (3 credits). Studies in detail<br />
the design and implementation <strong>of</strong> an operating system. Discusses various data<br />
structures and algorithms for process, memory and input/output device management.<br />
Investigates issues in distributed operating systems. Prerequisites: CSE 4001.<br />
CSE 5631 ADVANCED COMPUTER NETWORKS (3 credits). Covers<br />
computer network design and analysis topics. Includes network management, distributed<br />
network environments, bridges, routers, gateways, congestion control, ATM<br />
application program interface, multimedia and network applications. Prerequisites:<br />
CSE 5231.<br />
CSE 5632 SURVIVABLE NETWORK OBJECTS (3 credits). Covers theory,<br />
design and analysis <strong>of</strong> secure computer communication systems. Includes encryption,<br />
authentication, digital signature, digital certificate, secure socket layer, agentbased<br />
network applications and development <strong>of</strong> distributed applications over the<br />
Internet using CORBA and Java. Prerequisites: CSE 5631 or ECE 5535.<br />
CSE 5636 NETWORK SECURITY (3 credits). Covers network intrusion<br />
detection, statistical anomaly detection and network perimeter security, and traffic<br />
monitoring including tools (Ethereal, TCPDUMP) used to analyze captured traffic<br />
streams. Overviews methods and tools used by hackers. Includes statistical anomaly<br />
detection and its role in detecting previously unseen attacks. Prerequisites: CSE 5231<br />
or ECE 5535.<br />
CSE 5650 ADVANCED PROGRAMMING LANGUAGES (3 credits). Presents<br />
theoretical topics in programming languages. Includes the lambda-calculus,<br />
functional programming, type interface and different approaches to the semantics <strong>of</strong><br />
programming languages. Prerequisites: CSE 5250.<br />
CSE 5660 DATABASE MANAGEMENT SYSTEMS (3 credits). Studies the<br />
internal components <strong>of</strong> a database management system (DBMS). Includes data<br />
organization, query optimization, transaction processing, concurrency control, logging<br />
and recovery, security and distributed DBMS. Prerequisites: CSE 5260.<br />
Course Descriptions 181