Search Results (750)

View
Selected filters:
  • Computer Science
1: Concepts of Information Technology
Conditions of Use:
No Strings Attached
Rating

This module includes the basics and theories of ICT, including types of ...

This module includes the basics and theories of ICT, including types of computer, networks, how, why and who people access information using ICT. This module is the first under the ECDL (AKA ICDL) qualification, written for Windows XP and Office 2003

Subject:
Computer Science
Material Type:
Reading
Syllabus
Provider:
Rice University
Provider Set:
Connexions
Author:
Jana Mills
2008-'09 Open Education Cup: High Performance Computing
Conditions of Use:
No Strings Attached
Rating

This collection provides an overview of the 2008-'09 Open Education Cup competition. ...

This collection provides an overview of the 2008-'09 Open Education Cup competition. Contest rules, author resources, and example content are provided. This competition is intended to encourage development of original educational content in the field of parallel computing, with cash prizes awarded to contest winners. Selected modules will be included as part of a new collection available through Connexions.

Subject:
Computer Science
Material Type:
Full Course
Reading
Provider:
Rice University
Provider Set:
Connexions
Author:
Jan E. Odegard
Additional Topics
Conditions of Use:
Remix and Share
Rating

This subset of the Black Box Software Testing collection includes resources to ...

This subset of the Black Box Software Testing collection includes resources to teach quality cost analysis, combination testing, regression testing, GUI regression automation, high volume test automation, requirements analysis, test documentation, test scripts, and scripted testing and inattentional blindness. Resources include lecture videos, slides, activities, and suggested readings.

Subject:
Computer Science
Engineering
Material Type:
Activity/Lab
Full Course
Lecture Notes
Unit of Study
Provider:
Center for Software Testing Education and Research
Provider Set:
Black Box Software Testing
Author:
Association for Software Testing
Cem Kaner
Douglas Hoffman
James M. Bach
Rebecca L. Fiedler
Addressing Modes for TI TMS320C54x
Conditions of Use:
No Strings Attached
Rating

The TI TMS320C54x microprocessor provides a number of ways to specify the ...

The TI TMS320C54x microprocessor provides a number of ways to specify the location of data to be used in calculations. Immediate addressing, direct addressing, and indirect addressing are the three main types. Knowing the basic addressing modes of a mic

Subject:
Computer Science
Material Type:
Reading
Syllabus
Provider:
Rice University
Provider Set:
Connexions
Author:
Daniel Sachs
Dima Moussa
Douglas L. Jones
Mark Haun
Matthew Berry
Swaroop Appadwedula
Advanced Algorithms, Fall 2008
Conditions of Use:
Remix and Share
Rating

" This is a graduate course on the design and analysis of ...

" This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introductory courses on algorithms. It is especially designed for doctoral students interested in theoretical computer science."

Subject:
Computer Science
Material Type:
Full Course
Textbook
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Goemans, Michel
Advanced Artificial Intelligence
Conditions of Use:
Read the Fine Print
Rating

This course will present advanced topics in Artificial Intelligence (AI), including inquiries ...

This course will present advanced topics in Artificial Intelligence (AI), including inquiries into logic, artificial neural network and machine learning, and the Turing machine. Upon successful completion of this course, students will be able to: define the term 'intelligent agent,' list major problems in AI, and identify the major approaches to AI; translate problems into graphs and encode the procedures that search the solutions with the graph data structures; explain the differences between various types of logic and basic statistical tools used in AI; list the different types of learning algorithms and explain why they are different; list the most common methods of statistical learning and classification and explain the basic differences between them; describe the components of Turing machine; name the most important propositions in the philosophy of AI; list the major issues pertaining to the creation of machine consciousness; design a reasonable software agent with java code. (Computer Science 408)

Subject:
Computer Science
Philosophy
Material Type:
Full Course
Provider:
The Saylor Foundation
The Advanced CNXML
Conditions of Use:
No Strings Attached
Rating

This is the final installment of my three part tutorial on the ...

This is the final installment of my three part tutorial on the CNXML language. It is currently valid for the most recent release of the 0.3 language. The keywords contain a list of the tags described in this tutorial. Along with the example code in this module there is also an example module that has been growing throughout the tutorial.

Subject:
Computer Science
Material Type:
Reading
Syllabus
Provider:
Rice University
Provider Set:
Connexions
Author:
Ricardo Radaelli-Sanchez
Advanced Circuit Techniques, Spring 2002
Conditions of Use:
Remix and Share
Rating

Following a brief classroom discussion of relevant principles, each student completes the ...

Following a brief classroom discussion of relevant principles, each student completes the paper design of several advanced circuits such as multiplexers, sample-and-holds, gain-controlled amplifiers, analog multipliers, digital-to-analog or analog-to-digital converters, and power amplifiers. One of each student's designs is presented to the class, and one may be built and evaluated. Associated laboratory emphasizing the use of modern analog building blocks. Alternate years.

Subject:
Computer Science
Material Type:
Full Course
Textbook
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Roberge, Jim
Advanced Complexity Theory, Fall 2001
Conditions of Use:
Remix and Share
Rating

Current research topics in computational complexity theory. Nondeterministic, alternating, probabilistic, and parallel ...

Current research topics in computational complexity theory. Nondeterministic, alternating, probabilistic, and parallel computation models. Boolean circuits. Complexity classes and complete sets. The polynomial-time hierarchy. Interactive proof systems. Relativization. Definitions of randomness. Pseudo-randomness and derandomizations. Interactive proof systems and probabilistically checkable proofs. The topics for this course cover various aspects of complexity theory, such as the basic time and space classes, the polynomial-time hierarchy and the randomized classes. This is a pure theory class, so no applications were involved.

Subject:
Computer Science
Material Type:
Full Course
Textbook
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Spielman, Daniel
Advanced Data Structures, Spring 2012
Conditions of Use:
Remix and Share
Rating

Data structures play a central role in modern computer science. You interact ...

Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course covers major results and current directions of research in data structure.

Subject:
Computer Science
Material Type:
Activity/Lab
Homework/Assignment
Lecture Notes
Syllabus
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Demaine, Erik
Demaine, Erik
Advanced Databases
Conditions of Use:
Read the Fine Print
Rating

This course will expand upon SQL as well as other advanced topics, ...

This course will expand upon SQL as well as other advanced topics, including query optimization, concurrency, data warehouses, object-oriented extensions, and XML. Additional topics covered in this course will help you become more proficient in writing queries and will expand your knowledge base so that you have a better understanding of the field. Upon successful completion of this course, the student will be able to: write complex queries, including full outer joins, self-joins, sub queries, and set theoretic queries; write stored procedures and triggers; apply the principles of query optimization to a database schema; explain the various types of locking mechanisms utilized within database management systems; explain the different types of database failures as well as the methods used to recover from these failures; design queries against a distributed database management system; perform queries against database designed with object-relational extensions; develop and query XML files. (Computer Science 410)

Subject:
Computer Science
Material Type:
Full Course
Provider:
The Saylor Foundation
Advanced Electromagnetism, Spring 2003
Conditions of Use:
Remix and Share
Rating

Materials covered include: special relativity, electrodynamics of moving media, waves in dispersive ...

Materials covered include: special relativity, electrodynamics of moving media, waves in dispersive media, microstrip integrated circuits, quantum optics, remote sensing, radiative transfer theory, scattering by rough surfaces, effective permittivities, and random media.

Subject:
Computer Science
Material Type:
Full Course
Textbook
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Kong, Jin Au
Advanced Natural Language Processing, Fall 2005
Conditions of Use:
Remix and Share
Rating

This course is a graduate introduction to natural language processing - the ...

This course is a graduate introduction to natural language processing - the study of human language from a computational perspective. It covers syntactic, semantic and discourse processing models, emphasizing machine learning or corpus-based methods and algorithms. It also covers applications of these methods and models in syntactic parsing, information extraction, statistical machine translation, dialogue systems, and summarization. The subject qualifies as an Artificial Intelligence and Applications concentration subject.

Subject:
Computer Science
Linguistics
Material Type:
Full Course
Textbook
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Barzilay, Regina
Collins, Michael
Advanced Topics in Cryptography, Spring 2003
Conditions of Use:
Remix and Share
Rating

Recent results in cryptography and interactive proofs. Lectures by instructor, invited speakers, ...

Recent results in cryptography and interactive proofs. Lectures by instructor, invited speakers, and students. Alternate years. The topics covered in this course include interactive proofs, zero-knowledge proofs, zero-knowledge proofs of knowledge, non-interactive zero-knowledge proofs, secure protocols, two-party secure computation, multiparty secure computation, and chosen-ciphertext security.

Subject:
Computer Science
Material Type:
Full Course
Textbook
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Micali, Silvio
Adventures in Advanced Symbolic Programming, Spring 2009
Conditions of Use:
Remix and Share
Rating

" This course covers concepts and techniques for the design and implementation ...

" This course covers concepts and techniques for the design and implementation of large software systems that can be adapted to uses not anticipated by the designer. Applications include compilers, computer-algebra systems, deductive systems, and some artificial intelligence applications. Topics include combinators, generic operations, pattern matching, pattern-directed invocation, rule systems, backtracking, dependencies, indeterminacy, memoization, constraint propagation, and incremental refinement. Substantial weekly programming Assignments and Labs are an integral part of the subject. There will be extensive programming Assignments and Labs, using MIT/GNU Scheme. Students should have significant programming experience in Scheme, Common Lisp, Haskell, CAML or some other "functional" language."

Subject:
Computer Science
Material Type:
Full Course
Textbook
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Sussman, Gerald