Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
- Publication Year
Articles 1291 - 1312 of 1312
Full-Text Articles in Physical Sciences and Mathematics
Cs 766: Evolutionary Computation, Mateen M. Rizki
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 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan
Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan
Computer Science & Engineering Syllabi
This course deals with the theory and practice of compiler design. Topics emphasized are scanning and parsing. If time permits, semantic analysis will also be covered.
Cs 784: Programming Languages, Krishnaprasad Thirunarayan
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 206: Data Sheet, Terri Bauer
Cs 206: Data Sheet, Terri Bauer
Computer Science & Engineering Syllabi
Data Sheet for section 02.
Cs 480/680: Comparative Languages, Michael T. Cox
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 …
Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer, Dan E. Krane
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 240: Introduction To Computer Science I, Mateen M. Rizki
Cs 240: Introduction To Computer Science I, Mateen M. Rizki
Computer Science & Engineering Syllabi
No abstract provided.
Cs 240: Introduction To Computer Science, Eric Matson
Cs 240: Introduction To Computer Science, Eric Matson
Computer Science & Engineering Syllabi
We will develop basic techniques to design, develop and implement programs using the C++ language.
Cs 208: Computer Programming For Business With Java, I, Robert Rea
Cs 208: Computer Programming For Business With Java, I, Robert Rea
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 an intermediate-level of programming in Java. This course assumes students have never written a program before.
Ceg 255: Introduction To The Design Of Information Technology Systems, Eric Matson
Ceg 255: Introduction To The Design Of Information Technology Systems, Eric Matson
Computer Science & Engineering Syllabi
Information systems consist of modern elements such as database systems, networks, multiplatform distributed computing, web infrastructure and multimedia computing. In this course we will address these areas individually and also where they intersect to gain a basic understanding of how information technology can be used to solve real problems.
Ceg 402/602: Introduction To Computer Communication, Bin Wang
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 333: Introduction To Unix, Bin Wang
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.
Ceg 429/629: Internet Security, Prabhaker Mateti
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.
Ceg 498: Design Experience, John C. Gallagher
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.
Ceg 434/634: Concurrent Software Design, Thomas C. Hartrum
Ceg 434/634: Concurrent Software Design, Thomas C. Hartrum
Computer Science & Engineering Syllabi
This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency, and their solutions are examined through course projects and through readings on operating system design.
Ceg 361/561-01: Introduction To Software Testing, John A. Reisner
Ceg 361/561-01: Introduction To Software Testing, John A. Reisner
Computer Science & Engineering Syllabi
This course covers software testing strategies, along with established best practices, so students learn how to test their software in a complete and systematic (vice ad-hoc) manner. Particular attention is paid to planning, writing, and executing software testing documentation, i.e., software test plan, to include documented results. Various projects are assigned, designed to illustrate various challenges associated with software testing, and to reinforce the strategies and techniques used to overcome these challenges.
Ceg 476/676-01: Computer Graphics I, Lyubomir Zagorchev
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 214: Object Oriented Programming, Roddy Keish
Cs 214: Object Oriented Programming, Roddy Keish
Computer Science & Engineering Syllabi
No abstract provided.
Cs 340: Programming Language Workshop In Java, Ronald F. Taylor
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 302-01: Client Server Databases, Karen Meyer
Cs 302-01: Client Server Databases, Karen Meyer
Computer Science & Engineering Syllabi
No abstract provided.
Cs/Mth 317/517: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor
Cs/Mth 317/517: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor
Computer Science & Engineering Syllabi
Continuation of CS/MTH/316/516. Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of sources of errors in numerical methods. Special topics and applications presented as schedule permits. 4 credit hours. Prerequisites: CS 316, MTH 233, 253, or 355. Programming course prerequisites: EGR 153 or CEG 220 or CS 241.
Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura
Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura
Computer Science & Engineering Syllabi
Low-cost parallel computers such as PC clusters are becoming available, and many previously unsolvable problems can be solved using such computers. However, designing algorithms that perform well on parallel computers is often challenging. The focus of this course is on learning how to design algorithms for parallel computers and how to evaluate them.