Physical Sciences and Mathematics Commons^™

Ceg 476/676: Computer Graphics I, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will have learnt techniques for constructing 2-D and 3-D obects as well as manipulating and rendering the objects using OpenGL.

The outline of the course is as follows:

• Introduction

• Geometric primitives

• Attributes of geometric primitives

• Antialiasing techniques

• Homogeneous coordinate system

• 2-D and 3-D viewing transformations

• Structures and hierarchical modeling

• 2-D and 3-D viewing transformations

• Input devices and interactive techniques •

Visible surface detection methods

Ceg 220: Introduction To C Programming For Engineers I, Robert Helt

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).

Ceg 402/602: Introduction To Computer Communication, Bin Wang

Computer Science & Engineering Syllabi

This course provides an introduction to basic concepts of communication networks, different types of networks, protocols over different layers, and network applications through lectures, labs, homework, and reading on relevant materials. You will

• Understand networking principles, protocols, and technologies.

• Understand some design and performance issues involved in providing a network service.

• Acquire background for supporting e-commerce, e-government, and e-education.

• Gain hands-on experience with programming techniques for network protocols.

• Obtain background for original research in computer networks.

Ceg 420/620: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner

Computer Science & Engineering Syllabi

This course introduces established practices for engineering large-scale software systems. Emphasis is placed on both the technical and managerial aspects of software engineering, and the software development process. This includes techniques for requirements elicitation, analysis, design, testing, and project management. The course emphasizes object-oriented development with the Unified Modeling Language (UML). Hands-on experience is provided through individual homework problems and a partnered project.

Ceg 453/653: Design Of Computing Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 360/560 Ee 451/651: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG 260.

Ceg 498: Design Experience, Thomas C. Hartrum

Computer Science & Engineering Syllabi

CEG 498 (Design Experience) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and communications course work. CEG 498 projects are a minimum of two quarters in length and must be completed in groups of at least three students. Projects are selected under the guidance of the course instructor and are tailored to both student interest and formal classroom preparation. Students are evaluated both on their individual contributions as recorded in a graded engineering journals and on the quality of their collective efforts as reflected in group generated products.

Ceg 770: Computer Engineering Mathematics, Yong Pei

Computer Science & Engineering Syllabi

Computer Engineering and Science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, probability and stochastic process, and queueing theory. In addition to mathematical theory, appropriate applications will be presented.

Ceg 790: Emerging Networks, Bin Wang

Computer Science & Engineering Syllabi

This is a graduate level course on emerging networking technologies. The course involves a reading/lecture/presentation/discussion component, paper review component, and a project component. It will provide an in-depth study on a number of focused areas: dense wavelength division multiplexing (DWDM) optical networks, optical burst switching networks, peer-to-peer networks, and wireless mobile networks (including Ad-hoc wireless networks, sensor networks). Various technical and research issues involved will be studied. These areas of emerging networking technologies will play central roles in future communication networks.

Cs 141: Computer Programming I, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section.

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.

Cs 214: Object-Based Programming, Eric Maston

Computer Science & Engineering Syllabi

This course is a basic introduction to object oriented programming utilizing the Visual Basic programming language.

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.

Cs 241: Introduction To Computer Science Ii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course.

Cs 240: Introduction To Computer Science I, L. Jane Lin

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement.

Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This is the final course in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on building a number of abstract data types such as stacks, queues, trees and tables. We continue to study the C++ object-oriented concepts such as Inheritance, polymorphism and template handling. We also
start learning to analyze the complexity of algorithms in this course.

Cs 400/600: Data Structures And Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

In this course, students will learn basic data structures and how to design and analyze and implement software. Course covers introduction to the fundamentals of complexity and analysis and study of common problems and solutions using various data structures. After taking this course, students are expected to be able to design reasonable software for problems and estimate (evaluate) the performance of them even without writing the software.

Cs 340: Programming Language Workshop In C#, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in C#. You are expected to learn the language and solve a set of programming problems assigned to you using MS Visual Studio .NET. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or' other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.

Cs 466/666: Introduction To Formal Languages, Thomas Sudkamp

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the syntax of languages can be defined using grammars and patterns can be recognized by the computations of finite state machines. Along with presenting the fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science.

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel knowledge from large amounts of data. This course introduces and studies the concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, spatial and sequence mining, privacy, and data mining applications. 3 hours lecture, 2 hours lab.

Cs 766: Evolutionary Computation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques are presented including genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.

Cs 480/680: Comparative Programming Languages, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Cs 784: Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces concepts related to the specification and design of high-level programming languages. It discusses different programming paradigms, algebraic specification and implementation of data types, and develops interpreters for specifying operationally the various programming language features/constructs. It also introduces attribute grammar formalism and axiomatic semantics briefly. The programming assignments will be coded in Scheme.

Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer

Computer Science & Engineering Syllabi

Theory-oriented approach to the application of contemporary algorithms to bioinformatics. Graph theory, complexity theory, dynamic programming and optimization techniques are introduced in the context of application toward solving specific computational problems in molecular genetics. 4 credit hours.

A Classification Of Certain Maximal Subgroups Of Symmetric Groups, Benjamin Newton, Bret Benesh

Mathematics Faculty Publications

Problem 12.82 of the Kourovka Notebook asks for all ordered pairs (n,m) such that the symmetric group Sn embeds in Sm as a maximal subgroup. One family of such pairs is obtained when m=n+1. Kalužnin and Klin [L.A. Kalužnin, M.H. Klin, Certain maximal subgroups of symmetric and alternating groups, Math. Sb. 87 (1972) 91–121] and Halberstadt [E. Halberstadt, On certain maximal subgroups of symmetric or alternating groups, Math. Z. 151 (1976) 117–125] provided an additional infinite family. This paper answers the Kourovka question by producing a third infinite family of ordered …

Homogeneous Nucleation At High Supersaturation And Heterogeneous Nucleation On Microscopic Wettable Particles: A Hybrid Thermodynamic/Density-Functional Theory, T. V. Bykov, Xiao Cheng Zeng

Xiao Cheng Zeng Publications

Homogeneous nucleation at high supersaturation of vapor and heterogeneous nucleation on microscopic wettable particles are studied on the basis of Lennard-Jones model system. A hybrid classical thermodynamics and density-functional theory (DFT) approach is undertaken to treat the nucleation problems. Local-density approximation and weighted-density approximation are employed within the framework of DFT. Special attention is given to the disjoining pressure of small liquid droplets, which is dependent on the thickness of wetting film and radius of the wettable particle. Different contributions to the disjoining pressure are examined using both analytical estimations and numerical DFT calculation. It is shown that van der …