Computer Science
The Computer Science program has been developed to meet the educational needs of professionals working within discipline. The graduate courses in the program will be taught by WPI faculty in Newport, RI with the use of distance learning technology to accommodate for those traveling on business. Anyone with an undergraduate degree is welcome to apply for admission into the program.
All of the courses will carry graduate credit and can be applicable to a Master's Degree in Computer Science, upon admission into the degree program. For more information, please contact Rachel Yamartino at +1-508-831-6222 or riy@wpi.edu.
Computer Science
- CS 524 Algorithms: Design and Analysis January 2007
- CS 531 System Simulation April 2007
- ECE 506/CS 513 Introduction to Local and Wide Area Networks September 2007
- CS 509Design of Software Systems: January 2008
- CS 525x Principles of Systems Engineering April 2008
ECE 506/CS513. Introduction to Local and Wide Area Networks
This course provides an introduction to the theory and practice of the design of computer and communications networks, including the ISO seven-layer reference model. Analysis of network topologies and protocols, including performance analysis, is treated. Current network types and evolving network technologies are introduced, including local, metropolitan and wide area networks. The theory, design and performance of local area networks are emphasized. The course includes an introduction to queueing analysis and network programming. (Prerequisites: A knowledge of the C programming language is assumed. CS 504 or ECE 502 or equivalent background in probability; may be taken concurrently. NOTE: Students who receive credit for ECE 573 may not receive credit for ECE 506.)
CS 509. Design of Software Systems This course focuses on the high-level design aspects of software engineering. Included are architectural and interface design. Within architectural design, the topics covered are Yourdan structured design, Jackson structured design and object-oriented design. When possible, real-time extensions are discussed. Sufficient coverage of the areas of requirements specification and testing is given to support the above topics. (Prerequisites: knowledge of a recursive high-level language and data structures. An undergraduate course in software engineering is desirable.)
CS 524. Algorithms: Design and Analysis
This course covers the design, analysis and proofs of correctness of algorithms. Examples are drawn from algorithms for advanced data structures, set manipulation and searching, graphs and geometric problems. Analysis techniques include asymptotic worst case and average case, as well as amortized analysis. Average case analysis includes the development of a probability model. Techniques for proving lower bounds on complexity are discussed, along with NP- completeness. Prerequisites: an undergraduate knowledge of data structures, discrete structures and algorithms. Note: students with a strong CS background in design and analysis of computer systems (at the level equal to a solid BS in computer science) should not take CS 524 and should consider taking CS 504.
CS 525x - Principles of Systems Engineering
Systems Engineers define, develop and deploy systems. Systems engineering is a multi-faceted discipline, involving human, organizational, and various technical variables that work together to create complex systems (Sage, 2000). This course provides a thorough overview, with specific integrated examples, projects and team building exercises, of the Principles of Systems Engineering. Topics covered include; Introduction to Systems Engineering; Requirements Development; Functional Analysis and Requirements Allocation; System Architecture and System Design; Integration, Verification and Validation; Trade Studies; Systems Analysis, Modeling and Simulation; Specialty Engineering; Risk Management; and Technical Planning and Management. (Prerequisite: an undergraduate degree in engineering or science, or permission of the instructor.)
CS 531. System Simulation
The theory and design of discrete simulations are discussed. Other topics are random number generations, analysis of output and optimization.
Last modified: December 19, 2006 15:13:31
