Undergraduate Catalog 2011-2013 - SUNY Institute of Technology

Courses
CS 377 Introduction to the Theory of Computing (4)
Introduction to theoretical computer science. Topics include: automata,
formal languages, Turing machines, recursive function theory,
computational complexity, and program correctness. Prerequisites: CS
240 and MAT 115.
CS 381 Principles of Computer Security and Cryptography
Focuses on general principles of computer security and cryptography. Topics
covered include threat trees, threat taxonomies, malware, common attacks,
cryptographic principles, block ciphers, hash functions and public-key
cryptography. Prerequisites: MAT 115 or MAT 413, CS 249 and CS 330.
CS 407 UNIX System Administration (4)
Topics will include: concepts involving system administration and
maintenance procedures to facilitate normal system operation; technical
details regarding problems that could result from operating system
malfunction as well as threats to system security that are inherent in a
multiprogramming environment; techniques and tools for hardware and
software configuration management. Prerequisite: CS 307; Corequisite:
CS 330.
CS 409 Software Project Management (4)
This course presents different techniques for managing software projects
and technical staff and familiarizes the student with artifacts of project
management. The topics to be covered include: user specification; project
proposal; contracts; software cost models and estimation techniques;
project planning; implementation management; project delivery.
Prerequisite: CS 370.
CS 420 Numerical Computing (4)
Basic techniques of numerical computation. Topics include: computer
arithmetic and error control, solution of non‐linear algebraic equations
including some non‐linear optimization, polynominal interpolations
including splines, curve fitting, integration, and an introduction to
differential equations. Emphasis will be on non‐formal settings with a
view toward applications. Prerequisites: Calculus and proficiency in a
high-level programming language.
CS 421 Computational Linear Algebra (4)
Computational aspects of linear algebra, including linear optimization
models, are explored. Topics include: different algorithms for solution
of sets of linear algebraic equations, eigenvalue problems, linear
programming, clustering techniques, and software requirements.
Prerequisites: CS 240 and MAT 340 or equivalent.
CS 431 Principles of Programming Languages (4)
This course fosters a disciplined approach to the design of programs.
Through carefully chosen assignments, the need for certain data
structures and programming language features is made apparent. Several
different programming languages are used. Topics include: structured
programming, functional programming, recursion, and string processing.
Prerequisite: CS 240.
CS 441 Computer Systems Architecture (4)
After a higher level review of current mainframe architecture and
operating systems, advanced architectures, proposed and implemented
for parallel computation, will be considered. The second half of the
course will survey techniques for modeling and assessing performance of
computer systems and networks, with emphasis on probabilistic models.
Prerequisites: MAT 225 and CS 220.
CS 445 UNIX Network Programming (4)
The course explores computer networks from the implementation and
programming point of view. The network architecture and communication
protocols studied by the class allow connection of heterogeneous systems
in an environment that may be geographically distributed. Prerequisites:
CS 240 and knowledge of UNIX and C.
CS 446 Local Area Network Architecture (4)
An intensive study of LAN architecture models for Computer Science
students. Topics include: contention‐free and contention-based models,
hybrid nets, HSLANs, integrated voice/video/data models. Prerequisites:
CS 220 and CS 330.
CS 450 Computer Graphics (4)
A conceptual and programmatic introduction to raster and vector
graphics. Topics include object-oriented graphics application programming
interfaces, hierarchical modeling, concepts of scene graphs, geometric
transformations and transform groups, behaviors for animation and
interaction, interactive tools for geometries and behaviors, classical
application programming interfaces, web-related graphics technologies,
and graphics file formats. Prerequisites: CS 240 and MAT 115.
CS 451 Distributed Systems (4)
A study of distributed protocol and software frameworks. Synchronous
and asynchronous networks will be covered. Protocols for leader election
and distributed consensus will be presented synchronous networks. Faulttolerant
protocols will be discussed for synchronous systems as well as
their adaptability in asynchronous models. The use of shared memory
and message passing as well as Byzantine failures will be discussed.
Prerequisites: CS 240 and CS 330.
CS 454 System Simulation (4)
An introduction to the basic techniques of systems modeling and analysis
through system simulation. Discrete and continuous system simulation
models, use of various simulation packages and analysis of simulation
output are included for consideration. Prerequisites: C, C++, or JAVA
and senior status or permission of instructor.
CS 477 Algorithms (4)
How good is it? Is there a better algorithm to solve it? This course aims
at developing a toolbox of algorithms for solving real problems that arise
frequently in computer applications and the principles and techniques for
determining their time and space requirements and efficiency. In addition,
the general complexity spectrum is discussed to give students a grounding
in intractability and unsolvability. Prerequisites: MAT 115 and CS 240.
CS 480 Compiler Design (4)
Basic concepts of formal languages and automata theory and their
applications in compiler writing. Several practical parsing methods are
discussed. Prerequisite: CS 240.
CS 489 Cooperative Work‐Study in Computer Science
(Variable 1‐4)
Student will be employed by a cooperating firm or agency. Periodic
progress reports will be required. The department will provide a list of
cooperating employers, and the student will be required to interview for
the position. Students are paid by the employer. Prerequisites: Limited to
Computer Science majors who have completed core courses and secured
departmental approval. Additional restrictions are on file with the
department. Only S/U grades are awarded for this course.
CS 490 Selected Topics in Computer Science (Variable 1-4)
Coverage of a specialized computer science topic, of current interest but
not adequately treated in regular course offerings. The topic may, for
example, be the theoretical and programmatic study of a methodology
for a class of computational problems, an introduction to a research area
of computing, or an in-depth examination of the usage and internals of a
software artifact or framework. The same topic will not be repeated for
at least two years. Prerequisites: CS 240 and MAT 115.
CS 491 Independent Study (Variable 1‐4)
Extensive study and research on a particular topic of student interest
under the supervision of a faculty member. The student is required to
submit a written proposal which includes a description of the project, its
duration, educational goals, method of evaluation, and number of credits
to be earned. Prerequisites: Matriculated students only, permission of
instructor and dean of subject area.
CS 495 Artificial Intelligence (4)
An introduction to fundamental knowledge representation schemes
and intelligent problem-solving techniques, and corresponding
implementation software artifacts. Both symbol system and biology/
society-based approaches are covered. Topics include state space heuristic
search, constraint satisfaction, classical logic, fuzzy logic, Bayesian
techniques, connectionism, genetic algorithms, swarm and multi-agent
intelligence, and planning. Prerequisites: CS 240 and MAT 115.
SUNYIT Undergraduate Catalog 2011-2013 99
C O U R S E S