Physical Sciences and Mathematics Commons^™

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 333: Introduction To Unix, Travis E. Doom

Computer Science & Engineering Syllabi

Introduction to the use of UNIX and UNIX tools as a problem-solving environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, and debugging. Prerequisite: CS 241.

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Cs 141: Computer Programming I, Eric Maston

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 141: Computer Programming I, Ronald F. Taylor

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.

Cs 205: Computer Literacy And Office Automation, Ann Tirpack

Computer Science & Engineering Syllabi

To understand basic computer operations and the principal components of a computer and connected peripheral devices. To understand and examine current operating systems, software utilities, device drivers and application software. To define and understand current storage technology and learn about logical file storage and
management.

To become proficient in using:
-Windows
-Word Processing Applications
-Spreadsheet Applications
-Database Applications
-Presentation Graphics Applications

To understand the basics of e-mail. To introduce networking concepts including the Internet and its components and web browser basics. To learn ways to protect your data and avoid computer disasters.

Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of spreadsheets, databases, and presentation software using Microsoft Excel Access and PowerPoint.

Cs 205-07: Computer Literacy And Office Automation, John P. Herzog

Computer Science & Engineering Syllabi

Basic computer terminology, word processing, spreadsheets, databases, and graphics.

Cs 209: 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 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first 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. This course assumes students have never written a program before.

Cs 240: Introduction To Computer Science I, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

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

Computer Science & Engineering Syllabi

This course is the first in the three course sequence "Introduction to Computer Science" offered by the
Computer Science department at WSU. This course presents a general introduction to C++ programming
language. It introduces the fundamental capabilities of C++ language as a problem solving tool. Topics include data representation, debugging and program verification.

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 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.

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 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 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. The Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.

Cs 409/609: Principles Of Artificial Intelligence, John C. Gallagher

Computer Science & Engineering Syllabi

Problem solving methods in artificial intelligence (AI) with emphasis on heuristic approaches. Topics include methods of representation, search, intelligent agents, planning, learning, natural language processing, logic, inference, robotics, and case-based reasoning. Three hours lecture, two hours lab.

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. The goal of this course is to blend social implications issues with common technical communication formats you'll need to be familiar with out in the "real world." To do this, the course is built around a research project on a social implications topic …

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 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 the syntax of languages and recognizing patterns. The syntax of languages can be defined using grammars and patterns can be described by regular expressions and accepted by finite state machines. Along with presenting the fundamentals of these topics, the course will develop and investigate the relationships between language definition and pattern recognition.

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs/Mth 316/516: Numerical Methods For Digital Computers, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods of interpolation, data smoothing, functional approximation, numerical differentiation and integration. Solution techniques for linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications of interest to engineering, science, and applied mathematics students are an integral part of the course. Special topics presented as schedule permits.

Cs 214: Visual Basic.Net, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.

Work In Progress: The Wsu Model For Engineering Mathematics Education, Nathan W. Klingbeil, Richard Mercer, Kuldip S. Rattan, Michael L. Raymer, David B. Reynolds

Kno.e.sis Publications

This paper summarizes progress to date on the WSU model for engineering mathematics education, an NSF funded curriculum reform initiative at Wright State University. The WSU model seeks to increase student retention, motivation and success in engineering through application-driven, just-in-time engineering math instruction. The WSU approach involves the development of a novel freshman-level engineering mathematics course EGR 101, as well as a large-scale restructuring of the engineering curriculum. By removing traditional math prerequisites and moving core engineering courses earlier in the program, the WSU model shifts the traditional emphasis on math prerequisite requirements to an emphasis on engineering motivation for …

Ceg 210: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN Administration.

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.

Ceg 724: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course cover basic techniques for low-level and some mid-level vision processing. The techniques include: image filtering, intensity thresholding, edge detection, 2-D shape analysis, line and circle detection, corner detection, pattern matching.

Ceg 476/676 Computer Graphics, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

The objective of this course are to learn the fundamentals of2-D and 3-D object construction, to learn algorithms that transform 2-D and 3-D objects, and practice some of the concepts through implementation.

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 education.
• Gain hands-on experience with programming techniques for network protocols.
• Obtain background for original research in computer networks.

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: CEG260.