Engineering Commons^™

Cs 765-01: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 460/660-01: Introduction To Software Computer Engineering, Robert J. Weber

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Ceg 725-01: Computer Vision Ii, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 468/668: Managing The Software Development Process, John A. Reisner

Computer Science & Engineering Syllabi

This course will cover some of the challenges and issues associated with managing software projects. Emphasis will occur on two fronts: (1) the software project manager's view (that is, what considerations and obstacles confront project managers during software development), and (2) the organizational view (that is, how organizations can foster a climate where software project management is performed smartly throughout an organization).

Ceg 260-01: Digital Computer Hardware, Sridhar Ramachandran

Computer Science & Engineering Syllabi

Digital Computer Hardware. Topics include switching algebra and switching functions, logic design of combinational and sequential circuits using TTL, combinational logic design with MSI and LSI, busing, storage elements, and instrumentation. 3 hours lecture, 2 hours lab. Prerequisite: CS 241.

Ceg 477/677-01: Computer Graphics Ii, John A. Reisner

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 498-01: 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 726-01: Pattern Recognition, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 435/635-01: Distributed Computing And Systems, Yong Pei

Computer Science & Engineering Syllabi

Study of process coordination, client-server computing, network and distributed operating systems, network and distributed file systems, concurrency control, recovery of distributed transactions, and fault-tolerant computing.

Ceg 210-01: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN administration, hardware and software configuration.

Ceg 461/661-01: Object-Oriented Programming And Design, Thomas C. Hartrum

Computer Science & Engineering Syllabi

Study of object-oriented design and programming. Programming topics emphasize the core concepts of encapsulation, inheritance, polymorphism, and dynamic binding. Additional topics include class organization, software maintenance, and design of reusable components. There is a project to be implemented in a modem object-oriented language such as Java or C++.

Ceg 434/634-01: Concurrent Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 820-01: Computer Architecture Ii, Soon M. Chung

Computer Science & Engineering Syllabi

Continuation of CEG720 with more details on multiprocessor systems, parallel processing, and performance analysis.

Ceg 860-01: Object-Oriented Programming, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course motivates the need for object-oriented programming, and studies, in detail, object-oriented programming techniques, languages, and technology. The lectures will focus on the foundations of OOP, while the student presentations will focus on the applications and extensions of Object Technology.

Ceg 750-01: Microprocessor, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Cs 891-01: Information Retrieval, Extraction, And Management, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course expects an advanced Ph.D. student to (i) review background material in the area of Information Retrieval, Extraction, and Management, and (ii) develop/deliver a presentation on a mutually acceptable topic.

Cs 781-01: Compiler Design And Construction Ii, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is a continuation ofCS780 covering the theory and practice of compiler design. Topics emphasized are semantic analysis, code generation, and optimization.

Cs 790-01: Multimedia Coding And Communication (I), Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.

Cs 740-01: Algorithms, Complexity And The Theory Of Computability, Thomas Sudkamp

Computer Science & Engineering Syllabi

The objective of this course is to use the formal algorithmic system provided by Turing machines as a tool to analyze the complexity of decision and optimization problems and the algorithms that solve them. The topics to be covered include

•the definition of the time and space complexity of a deterministic algorithm

•the classes of deterministic polynomial and non-polynomial time languages

•the complexity of nondeterministic algorithms

•the P=NP question (relationship between solvability by deterministic and
nondeterministic polynomial time algorithms)

•the implications oaf solution to the P=NP question

•NP completeness and examples of NP complete problems

•classes of NP complete problems …

Cs 701-01: Database Systems And Design, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of DB design concepts and operating principles of database systems.

Cs 400/600-01: Data Structures And Software Design, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Cs 466/666-01: 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 languages can be defined using a rule-based systems called 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 241-02, 03: Introduction To Computer Science Ii, Haiyun Bian

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. Concepts introduced in CS 240 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and exception handling. Student must register for one lecture section and one lab section.

Cs 241-01: Computer Science Ii, Eric Maston

Computer Science & Engineering Syllabi

This course is the second in the Introduction to Computer Science (24X) series. It focuses on object oriented concepts and an introduction to data structures.

Cs 142-01: Computer Programming Ii, Haiyun Bian

Computer Science & Engineering Syllabi

Concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and exception handling. Student must register for both lecture and one lab section.

Cs 242-01: Computer Science Iii, Eric Maston

Computer Science & Engineering Syllabi

This is the third and final course in the Introduction to Computer Science series. This course focuses on data structures with abstract data types, such as trees, stacks, queues and tables.

Cs 240-01: Introduction To Computer Science I, Dale E. Nelson

Computer Science & Engineering Syllabi

No abstract provided.

Cs 209-01: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 209 is the second of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming.

Cs 141-01: 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. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.