Com S 507 Numerical Solution of Ordinary Differential Equations. (Math 507) (3-0) Cr. 3 F.SS. Prereq. 415, 465, or 481; knowledge of FORTRAN or C. One step methods for initial value problems, one-step methods for systems, multi-step methods, boundary-value problems. Examples using university computers.

Com S 509 Computational Methods of Linear Algebra. (Math 509). (3-0) Cr. 3. F. Prereq: 307 or 317; knowledge of FORTRAN or C. Numerical methods for solving linear systems of equations and linear least squares problems, and for computing eigenvalues and eigenvectors of matrices, symmetric or not. Matrix factorizations, iteration methods. Analysis of well- and ill-conditioning of computational problems, and stability of methods. Practical computing exercises.

Com S 511 Design and Analysis of Algorithms. (3-0) Cr. 3. F. Prereq: 311 or 330. A study of basic algorithm design and analysis techniques. Advanced data structures, amortized analysis, and randomized algorithms. Applications to sorting, graphs, and geometry. NP-completeness and approximation algorithms.

Com S 512 Formal Methods in Software Engineering. (3-0) Cr. 3. S. Prereq: 311, 330. A survey of formal topics relevant to the software life-cycle process including requirements, specifications, design, implementation, testing and maintenance. Implications of formal results for software prototyping and automated testing.

Com S 518x Introduction to Computational Geometry (3-0) Cr. 3. (418x DL). Alt. F, offered 1998. Prereq: 311 or equivalent. Introduction to data structures, algorithms, and analysis techniques for computational problems that involve geometry. Line segment intersection, polygon triangulation and art gallery problems, orthogonal range querie, point location, geometric data structures, arrangements and duality, delaunay triangulation, convex hulls, binary space partitions, quad trees, visibility graphs, simplex range searching.

Com S 524 Computer System Architecture. (3-0) Cr. 3. F. Prereq: 352 or CprE 305. Fundamentals of computer design, performance and cost, Instruction set design, basic processor implementation techniques, pipelining, memory design, caches, I/O systems, multiprocessor systems, interconnection networks.

Com S 525 Numerical Analysis of High Performance Computing. (3-0) Cr. 3. S. (Cpr E 525 or Math 525). Prereq: Cpr E 308, or one of Math 471, 473 or 481; experience in scientific programming; knowledge of FORTRAN or C. Development, analysis, and testing of efficient numerical methods for use on current state-of-the-art high performance computers. Applications of the methods to the students’ areas of research.

Com S 526x Practical Introduction to Parallel Programming. (3-1) Cr. 3. F. Prereq: 321 and 311 or equivalent. Fundamentals of parallel programming, design and analysis of parallel programs, survey of parallel programming environments for developing large-scale applications. The course will have a laboratory component to provide practical experience on different types of parallel computing platforms.

Com S 531 Theory of Computation. (3-0) Cr. 3. S. Prereq: 331. A systematic study of the fundamental models and analytical methods of theoretical computer science. Computability, the Church-Turing thesis, decidable and undecidable problems, and the elements of recursive function theory. Time complexity, logic, Boolean circuits, and NP-completeness. Finite-state and pushdown computation.

Com S 540 Principles of Compiling (3-1) Cr. 3. S. (440 DL). Prereq: 342. Techniques of lexical analysis, top-down and bottom-up parsing, semantic analysis and code generation. Principles are reinforced through a number of programming projects. Different projects will be assigned to students depending on whether they have enrolled for 440 or 540.

Com S 541 Programming Languages I. (3-1) Cr. 3. F. Prereq: 342 or 440. Survey of the goals and problems of language design. Formal and informal studies of a wide array of programming language features including type systems, naming, state, and control. Creative use of functional, object-oriented, declarative, concurrent and other programming paradigms.

Com S 542 Programming Languages II. (3-0) Cr. 3. Alt. F., offered 1999. Prereq: 440.

Compilation theory and techniques, emphasis on high-level software tools to facilitate compiler construction. Lexical analysis, parsing, attribute grammars, code generation and optimization for traditional and non-traditional languages and architectures.

Com S 552 Principles of Operating Systems. (3-0) Cr. 3. S. Prereq: 352. A comparative study of high-level language facilities for process synchronization and communication. Formal analysis of deadlock, concurrency control and recovery, and system performance. Protection issues including capability-based systems, access and flow control, encryption, and authentication.

Com S 561 Principles of Database Systems (3-0) Cr. 3. S. Prereq: 311and 352. Introduction to database system concepts. Physical data organization. The network model and the DBTG proposal. The hierarchical model. The relational model. Relational query languages. Functional dependencies. Multivalued dependencies. Decomposition of relation schemes. Normal forms. Query systems. Query optimization. Concurrence control. Distributed database systems.

Com S 572 Principles of Artificial Intelligence. (3-1) Cr. 3. F. (472 DL). Prereq: 330, 342, CprE 310 or comparable programming experience. Foundations, scope, and problems of artificial intelligence (AI) and cognitive science. State-space search techniques for problem solving. Knowledge representation and automated inference. Machine learning. Neural and evolutionary approaches to AI. Artificial life. Selected applications in planning, machine perception, analysis, design, intelligent agent architectures. AI programming using Common LISP. Graduate credit requires a research project and a written report.

Com S 576 Motion Strategy: Algorithms and Applications. (3-1) Cr. 3. (476 DL) Alt. S., offered 2000. Prereq: Engl 105, Sp Cm 212, Com S 311 or ME 519, or consent of instructor. Recent techniques for developing algorithms that automatically generate continuous motions while satisfying geometric constraints. Applications in areas such as robotics and graphical animation. Basic path planning. Kinematics, configuration space, and topological issues. Collision detection. Randomized planning. Nonholonomic systems. Optimal decisions and motion strategies. Coordination of Multiple Bodies. Representing and overcoming uncertainties. Visibility-based motion strategies. Implementation of software that computes motion strategies. Written reports. Nonmajor graduate credit.

Com S 583X Adaptive Computing Systems. (3-0) Cr. 3. F. (Cross listed with CpreE 583X). Prereq: ComS 524 or CprE 585, or consent of instructor. Introduction to Adaptive/Recongifurable Computing, FPGA technology and architectures, spatial computing architectures, systolic and bit serial architectures, adaptive network architectures, bus-based and static and dynamic rearrangeable interconnection structure architectures, reconfigurable computing Architectures for Processors, Pipeline, and Caches.

Com S 586 Computer Network Architectures. (3-0) Cr. 3. F. Prereq: 511, 552 or CprE 489. Design and development of advanced computer communication networks: distributed and failsafe routing in large and dynamic networks, gateways and interconnection of heterogeneous networks, flow control and congestion avoidance techniques, network architectures, communication protocol standards, formal specification and verification of protocols, implementation and conformance testing of protocol standards, network partitioning and intelligent reconfiguration of networks.

Com S 587x Principles of Distributed and Network Programming. (3-0) Cr. 3. F. Prereq: 352 or CprE 489 or equivalent. Programming paradigms for building modern distributed applications, including multithreaded client-server programming, distributed object frameworks and programming languages. Web-based computing. Directory services. Mobile computing. Network multimedia applications. Reliability and manageability of networked systems, including aspects of distributed system security, verification of concurrent systems, and network management.

Com S 590 Special Topics. Cr. arr. Prereq: Permission of instructor. Offered on a satisfactory-fail basis only.

Com S 591 Graduate Orientation Seminar. (1-0) Cr. 1. F. Prereq: Graduate classification. Topics include an introduction to ISU computing facilities; M.S. and Ph.D. degree requirements, career choices, ethics, literature searching, technical presentations, technical writing, ethics in writing, and discussion of research interests and projects by members of the graduate faculty. Required by the M.S. Degree and is taken during the first semester of a normal M.S. program. Offered on a satisfactory-fail basis only.

Com S 599 Creative Component. Cr. arr. Offered on a satisfactory-fail basis only.