Computer Sciences Commons^™

Cs 207: Advanced Office Productivity Ii, Louis A. Benavides

Computer Science & Engineering Syllabi

This course covers post-advanced microcomputer applications including Microsoft
Office Word 2003, Microsoft Office Excel 2003, Microsoft Office Access 2003, and Microsoft
Office PowerPoint 2003. Topics include: creating an online form; working with macros and
Visual Basic for Applications (VBA); working with a master document, an index and a table of contents; linking an Excel worksheet and charting its data in Word; formula auditing, data validation, and complex problem solving in Excel; importing data into Excel; working with PivotCharts, PivotTables, and trendlines in Excel; creating a PivotTable List; advanced Access report and form techniques, and creating multi-page forms; administering a database …

Cs 206: Data Sheet, Terri Bauer

Computer Science & Engineering Syllabi

Data Sheet for section 02.

Cs 241: Computer Science Ii, L. Jane Lin

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.

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.

Ceg 498: Design Experience, John C. Gallagher

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

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

Computer Science & Engineering Syllabi

No abstract provided.

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 levelprogramming. This course assumes students have never written a program before.

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 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 701: Database Systems And Design I, Guozhu Dong

Computer Science & Engineering Syllabi

An introduction to database design, database system implementation issues and techniques, and advanced data models.

Cs 499/699: 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, and data mining applications. This course is designed for senior year undergraduate students and graduate students. 3 hours lecture, 2 hours lab.

Ceg 476/676-01: Computer Graphics I, Lyubomir Zagorchev

Computer Science & Engineering Syllabi

An introduction to 2-D and 3-D computer graphics and their OpenGL implementations.

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.

Ceg 320/520: Computer Organization And Assembly Language Programming, Jennifer White Doom

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operation of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument passing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used.

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

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 333: Introduction To Unix, Bin Wang

Computer Science & Engineering Syllabi

This is a 2 credit hour course that has 10 50-minute lectures and I 0 50-minute Jab sessions. 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.

Cs 316/516: Numerical Methods For Digital Computers I, 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 400/600: Data Structures And Software Design, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

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

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.

Cs 205: Computer Literacy And Office Automation, Terri Bauer

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 XP
-Spreadsheet Applications
-Database Applications
-Presentation Graphics Applications
-To understand the basics of email

Cs 480/680: Comparative Languages, Michael T. Cox

Computer Science & Engineering Syllabi

"Comparative Languages" is a graduate/undergraduate level introductory course in programming languages. We will cover several basic topics ranging from syntax (BNF) and semantics formalisms (attribute grammars), to data types, scope and extent, type checking, parameter passing methods, expression parsing and other fundamentals of programming languages and language development. The intent of the course is to provide a background in the concepts and constructs of languages, rather than simply providing just a survey of various computer languages. Nonetheless in this class, we will learn and program in three very different languages: Pascal (an imperative language), Java (an object-oriented language), and LISP …

Ceg 429/629: Internet Security, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to security issues arising primarily from computer networks. Topics include node and service authentication, address spoofing, hijacking, SYN floods, smurfing, sniffing, routing tricks, and privacy of data en route. Buffer overruns and other exploitation of software development errors. Hardening of operating systems. Intrusion detection. Firewalls. Ethics.

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 …

Modulation Of Airway Inflammation By Immunostimulatory Cpg Oligodeoxynucleotides In A Murine Model Of Allergic Aspergillosis, Banani Banerjee, Kevin J. Kelly, Jordan N. Fink, James D. Henderson Jr., Naveen K. Bansal, Viswanath P. Kurup

Mathematics, Statistics and Computer Science Faculty Research and Publications

Allergic aspergillosis is a Th2 T-lymphocyte-mediated pulmonary complication in patients with atopic asthma and cystic fibrosis. Therefore, any therapeutic strategy that selectively inhibits Th2 T-cell activation may be useful in downregulating allergic lung inflammation in asthma. In the present study, we developed a CpG oligodeoxynucleotide (ODN)-based immune intervention of allergic inflammation in a mouse model of allergic aspergillosis. Four different groups of mice were used in a short-term immunization protocol. Three experimental groups of animals (groups 1 to 3) were sensitized with Aspergillus fumigatus antigens. Animals in group 1 were immunized with A. fumigatus antigen alone, while those in group …

Deadline Analysis Of Interrupt-Driven Software, Dennis Brylow, Jens Palsberg

Mathematics, Statistics and Computer Science Faculty Research and Publications

Real-time, reactive, and embedded systems are increasingly used throughout society (e.g., flight control, railway signaling, vehicle management, medical devices, and many others). For real-time, interrupt-driven software, timely interrupt handling is part of correctness. It is vital for software verification in such systems to check that all specified deadlines for interrupt handling are met. Such verification is a daunting task because of the large number of different possible interrupt arrival scenarios. For example, for a Z86-based microcontroller, there can be up to six interrupt sources and each interrupt can arrive during any clock cycle. Verification of such systems has traditionally relied …

Flexible Verification Of Mpeg-4 Stream In Peer-To-Peer Cdn, Tieyan Li, Yongdong Wu, Di Ma, Robert H. Deng

Research Collection School Of Computing and Information Systems

The current packet based stream authentication schemes provide effective and efficient authentication over a group of packets transmitted on erasure channels. However, by fixing the packets in transmission, any packet manipulation will cause authentication failure. In p2p content delivery network where a proxy-in-the-middle is able to store, forward, transcode and transform the stream, previous schemes are simply unapplicable. To address the problem, we propose a flexible verification scheme that relies on special stream formats (i.e. Unequal Loss Protection ULP scheme [7]). We apply the so called Unequal Loss Verification ULV scheme into MPEG-4 framework. The encoding, packing, amortizing and verifying …

Comments On "A Practical (T, N) Threshold Proxy Signature Scheme Based On The Rsa Cryptosystem", Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

In a (t, n) threshold proxy signature scheme based on RSA, any t or more proxy signers can cooperatively generate a proxy signature while t-1 or fewer of them can't do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers. In this article, we discuss the implementation and comparison of some threshold proxy signature schemes that are based on the RSA cryptosystem. Comparison is done on the basis of time complexity, space complexity and communication overhead. We compare the performance of four schemes: Hwang et al., Wen et …

Huffman Approach To Opcode Compression, Jason B. Shreve

Electrical & Computer Engineering Theses & Dissertations

Instructions are the building blocks of computer programs. They are composed of opcodes, which uniquely identify each instruction, and the operands or data. In most architectures, the instruction length is a set multiple of the word size. The size and number of operands vary by instruction. Due to programmer usage, program need, or compiler design, opcodes do not occur with a constant distribution. Likely, some opcodes occur very frequently, whereas others occur very infrequently or not at all. If the length of an opcode were representative of its frequency, compression in program size might be achieved.

This thesis is an …

Vector Operations In Superscalar Architectures, Nathan Daniel Flinn

Electrical & Computer Engineering Theses & Dissertations

Vector calculations are very prevalent today. Though the vector-processing computer is quite an old concept, superscalar processors lack hardware support for vector operations. This thesis investigates whether an ordinary superscalar computer architecture can be designed to include hardware support for improved vector operations without drastically changing the existing superscalar design and behavior. A computer architecture design was created and implemented that included the vector multiply (dot product) operation. The design includes a Vector Operations Unit that captures incoming vector operations and generates the necessary set of machine instructions to complete the vector operation internally. It then delivers these instructions to …

Randomized Leader Election, Murali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Y. Grama

Department of Computer Science Technical Reports

No abstract provided.