Search Results (575)

View
Selected filters:
  • Computer Science
4 Corner Soccer
Conditions of Use:
Remix and Share
Rating

Great lead up game for soccer. It is a way for students to practice the skills they have learned, and practiced. Easier way to assess students, because of smaller numbers on the move.

Subject:
Computer Science
Material Type:
Activity/Lab
Author:
Meaghen Ayers
Date Added:
11/16/2018
Additional Topics
Conditions of Use:
Remix and Share
Rating

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
Date Added:
03/01/2005
Advanced Algorithms, Fall 2008
Conditions of Use:
Remix and Share
Rating

" 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
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Goemans, Michel
Date Added:
01/01/2008
Advanced Artificial Intelligence
Conditions of Use:
Read the Fine Print
Rating

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
Date Added:
11/16/2011
Advanced Circuit Techniques, Spring 2002
Conditions of Use:
Remix and Share
Rating

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
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Roberge, Jim
Date Added:
01/01/2002
Advanced Computer Organisation Architecture
Conditions of Use:
No Strings Attached
Rating

This course introduces students to Advanced Computer Organization and Architecture. Where architecture is a term used to describe the attributes of a system as seen by the programmer. Its concerned with designs and operations of a computer. Computer organization is the way the system is structured so that all those cataloged tools can be used, and that in an efficient fashion. This course has its emphasis on system design and performance.

Subject:
Computer Science
Material Type:
Module
Provider:
African Virtual University
Provider Set:
OER@AVU
Author:
Harrison Njoroge
Date Added:
02/22/2018
Advanced Computer Security
Conditions of Use:
No Strings Attached
Rating

There are both practical and theoretical reasons to study algorithms. From a practical standpoint, you have to know a standard set of important algorithms from different areas of computing; in addition, you should be able to design new algorithms and analyze their efficiency. From the theoretical standpoint, the study of algorithms, sometimes called algorithmics, has come to be as the cornerstone of computer science.

Subject:
Computer Science
Material Type:
Module
Provider:
African Virtual University
Provider Set:
OER@AVU
Author:
Richard Musabe
Date Added:
04/20/2018
Advanced Database Systems
Conditions of Use:
No Strings Attached
Rating

At the heart of any major system is a data storage back-end. This back-end is what is refered to as a database. Taking that a database forms the core of systems, there is every need for the data to have integrity and also available for use. Database systems when well designed will ensure the system achieves those goals. Persons with skills to develop and manage these databases are therefore vital in modern day systems. The course principals of Database Systems is needed to help provide the competencies and skills needed by entry-level systems analyst or programmers. This course is about understanding and developing application logic in databases.

Subject:
Computer Science
Material Type:
Module
Provider:
African Virtual University
Provider Set:
OER@AVU
Author:
John Kandiri
Date Added:
02/22/2018
Advanced Databases
Conditions of Use:
Read the Fine Print
Rating

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
Date Added:
11/16/2011
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, 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
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Micali, Silvio
Date Added:
01/01/2003
Advanced Web Technologies
Conditions of Use:
Remix and Share
Rating

This course will cover an introduction to XML and it provides a hands-on experience of creating XML Documents using Schema, Namespaces, XSLT and XPath. It covers how to work with JQuery and implementation of AJAX using XML and JSON.

Subject:
Computer Science
Material Type:
Full Course
Author:
ABDUL RAHIMAN SHAIK KODAVENDLA
Date Added:
10/29/2018
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 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
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Sussman, Gerald
Date Added:
01/01/2009
Agent Based Modeling of Complex Adaptive Systems (Advanced)
Conditions of Use:
Remix and Share
Rating

Building on Complex Adaptive Systems theory and basic Agent Based Modeling knowledge presented in SPM4530, the Advanced course will focus on the model development process. The students are expected to conceptualize, develop and verify a model during the course, individually or in a group. The modeling tasks will be, as much as possible, based on real life research problems, formulated by various research groups from within and outside the faculty.
Study Goals The main goal of the course is to learn how to form a modeling question, perform a system decomposition, conceptualize and formalize the system elements, implement and verify the simulation and validate an Agent Based Model of a socio-technical system.

Subject:
Computer Science
Material Type:
Full Course
Provider:
Delft University of Technology
Provider Set:
Delft University OpenCourseWare
Author:
Dr. Ir. I. Nikolic
Date Added:
03/03/2016
Algorithim Design and Analysis
Conditions of Use:
No Strings Attached
Rating

There are both practical and theoretical reasons to study algorithms. From a practical standpoint, you have to know a standard set of important algorithms from different areas of computing; in addition, you should be able to design new algorithms and analyze their efficiency. From the theoretical standpoint, the study of algorithms, sometimes called algorithmics, has come to be as the cornerstone of computer science.

This course aim to provide an in-depth understanding of the fundamental algorithmic techniques for design and analysis, in turn impart knowledge and practical competence in use of advanced data structures and the design and analysis of algorithms.

Subject:
Computer Science
Material Type:
Module
Provider:
African Virtual University
Provider Set:
OER@AVU
Author:
Godfry Justo
Date Added:
02/22/2018
Algorithim Design and Analysis
Conditions of Use:
No Strings Attached
Rating

There are both practical and theoretical reasons to study algorithms. From a practical standpoint, you have to know a standard set of important algorithms from different areas of computing; in addition, you should be able to design new algorithms and analyze their efficiency. From the theoretical standpoint, the study of algorithms, sometimes called algorithmics, has come to be as the cornerstone of computer science.

This course aim to provide an in-depth understanding of the fundamental algorithmic techniques for design and analysis, in turn impart knowledge and practical competence in use of advanced data structures and the design and Welcome to Advanced computer Security Module. This module provides a study of high-level computer security issues in computer networks and advanced methods of data encryption. It focuses on advanced aspects of computer security, such as encryption, security practices, system security, security for authentication on the Web and password management techniques. Finally this module, students should be able to create secure network architectures adapted to the investment level and required security. Take responsibility for installation, configuration and network security maintenance.

The module aims to give IT infrastructure management skills, where the role of computer security is critical to ensure the integrity of data and the normal operation of the various systems: computer networks, servers and personal computers in the organization. The course will also explore various Information Security controls, how to handle various risk assessment in an organization and finally creating a security policy in organization.

Today, we note that the information is considered the key business of an organization / company due to its usefulness and importance, however, the issue of the company’s Information Security is a priority task for managers, because they recognize the value it has and therefore organizations must make sure that it is managed effectively. For this reason, this module is important because you will learn the methods and tools for computer security that can ensure the confidentiality of information in organizations and also learn how to protect their information and systems in a network environment.

Subject:
Computer Science
Material Type:
Module
Provider:
African Virtual University
Provider Set:
OER@AVU
Author:
Richard Musabe
Date Added:
02/22/2018
Algorithms
Conditions of Use:
Read the Fine Print
Rating

This course focuses on the fundamentals of computer algorithms, emphasizing methods useful in practice. Upon successful completion of this course, the student will be able to: explain and identify the importance of algorithms in modern computing systems and their place as a technology in the computing industry; indentify algorithms as a pseudo-code to solve some common problems; describe asymptotic notations for bounding algorithm running times from above and below; explain methods for solving recurrences useful in describing running times of recursive algorithms; explain the use of Master Theorem in describing running times of recursive algorithms; describe the divide-and-conquer recursive technique for solving a class of problems; describe sorting algorithms and their runtime complexity analysis; describe the dynamic programming technique for solving a class of problems; describe greedy algorithms and their applications; describe concepts in graph theory, graph-based algorithms, and their analysis; describe tree-based algorithms and their analysis; explain the classification of difficult computer science problems as belonging to P, NP, and NP-hard classes. (Computer Science 303)

Subject:
Computer Science
Material Type:
Full Course
Provider:
The Saylor Foundation
Date Added:
11/16/2011
Algorithms for Computer Animation, Fall 2002
Conditions of Use:
Remix and Share
Rating

In-depth study of an active research topic in computer graphics. Topics change each term. Readings from the literature, student presentations, short assignments, and a programming project. Animation is a compelling and effective form of expression; it engages viewers and makes difficult concepts easier to grasp. Today's animation industry creates films, special effects, and games with stunning visual detail and quality. This graduate class will investigate the algorithms that make these animations possible: keyframing, inverse kinematics, physical simulation, optimization, optimal control, motion capture, and data-driven methods. Our study will also reveal the shortcomings of these sophisticated tools. The students will propose improvements and explore new methods for computer animation in semester-long research projects. The course should appeal to both students with general interest in computer graphics and students interested in new applications of machine learning, robotics, biomechanics, physics, applied mathematics and scientific computing.

Subject:
Computer Science
Literature
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Popovic, Jovan
Date Added:
01/01/2002
Ambient Intelligence, Spring 2005
Conditions of Use:
Remix and Share
Rating

This course will provide an overview of a new vision for Human-Computer Interaction (HCI) in which people are surrounded by intelligent and intuitive interfaces embedded in the everyday objects around them. It will focus on understanding enabling technologies and studying applications and experiments, and, to a lesser extent, it will address the socio-cultural impact. Students will read and discuss the most relevant articles in related areas: smart environments, smart networked objects, augmented and mixed realities, ubiquitous computing, pervasive computing, tangible computing, intelligent interfaces and wearable computing. Finally, they will be asked to come up with new ideas and start innovative projects in this area.

Subject:
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Maes, Patricia
Date Added:
01/01/2005
Android Acceleration Application
Conditions of Use:
Read the Fine Print
Rating

In the first of two sequential lessons, students create mobile apps that collect data from an Android device's accelerometer and then store that data to a database. This lesson provides practice with MIT's App Inventor software and culminates with students writing their own apps for measuring acceleration. In the second lesson, students are given an app for an Android device, which measures acceleration. They investigate acceleration by collecting acceleration vs. time data using the accelerometer of a sliding Android device. Then they use the data to create velocity vs. time graphs and approximate the maximum velocity of the device.

Subject:
Computer Science
Engineering
Material Type:
Full Course
Unit of Study
Provider:
TeachEngineering
Provider Set:
TeachEngineering
Author:
Brian Sandall
Scott Burns
Date Added:
09/18/2014
Android Programming
Rating

This Chapter will cover the following topics Android Operating System Android Architecture Android Applications Android Application Development Tools

Subject:
Computer Science
Material Type:
Lesson Plan
Author:
Saleem Raja
Date Added:
01/08/2017
Aplicacición de un Sistema Operativo de Tiempo Real (RTOS) en un robot Arduino
Conditions of Use:
Remix and Share
Rating

Trabajo Final para la cátedra Diseño de Sistemas de Tiempo Real. En este trabajo se muestra desde cómo armar el robot con las piezas compradas hasta cómo modificar y adaptar RTuinOS (un SO de Tiempo Real) para que funcione en nuestro Arduino.

Subject:
Computer Science
Material Type:
Lecture Notes
Author:
María Emilia Charnelli
Date Added:
11/07/2017
Artifical Intelligence
Conditions of Use:
No Strings Attached
Rating

Artificial Intelligence is a subject is one of the most important and exciting sub-fields of Computer Science. This specialist programme covers the fundamentals of Computer Science and Computer Information Systems so as to maximise your future employment opportunities. It also offers the chance to carry out cutting-edge research in this high profile area.

Introductory modules cover Programming in Java, Computer Systems, Databases, Human-Centric Computing, and Algorithmic Foundations. The course is completed by a selection of modules covering important topics within the subject: Knowledge Representation, the study of Multi-Agent Systems, and Robotics among the others. The course also includes a related second year group project and an individual year project.

Subject:
Computer Science
Material Type:
Module
Provider:
African Virtual University
Provider Set:
OER@AVU
Author:
Kebbeh Saffiong
Date Added:
02/22/2018
Artificial Intelligence
Conditions of Use:
Remix and Share
Rating

An quick overview of AI from both the technical and the philosophical points of view. Topics discussed include search, A*, Knowledge Representation, Neural Nets. Video of each class is available, as are problem sets.

Subject:
Computer Science
Material Type:
Full Course
Homework/Assignment
Lecture
Reading
Syllabus
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Patrick Winston
Date Added:
02/16/2011
Artificial Intelligence
Conditions of Use:
Remix and Share
Rating

This course material is created as flipped classroom sessions for Artificial Intelligence Course

Subject:
Computer Science
Material Type:
Module
Author:
Swati Mali
Date Added:
01/04/2017
Artificial Intelligence
Conditions of Use:
Read the Fine Print
Rating

This course includes materials on AI programming, logic, search, game playing, machine learning, natural language understanding, and robotics, which will introduce the student to AI methods, tools, and techniques, their application to computational problems, and their contribution to understanding intelligence. The material is introductory; the readings cite many resources outside those assigned in this course, and students are encouraged to explore these resources to pursue topics of interest. Upon successful completion of this course, the student will be able to: Describe the major applications, topics, and research areas of artificial intelligence (AI), including search, machine learning, knowledge representation and inference, natural language processing, vision, and robotics; Apply basic techniques of AI in computational solutions to problems; Discuss the role of AI research areas in growing the understanding of human intelligence; Identify the boundaries of the capabilities of current AI systems. (Computer Science 405)

Subject:
Computer Science
Material Type:
Full Course
Reading
Syllabus
Textbook
Provider:
The Saylor Foundation
Date Added:
11/16/2011
Artificial Intelligence, Fall 2008
Conditions of Use:
Remix and Share
Rating

An introduction to the main techniques of Artifical Intelligence: state-space search methods, semantic networks, theorem-proving and production rule systems. Important applications of these techniques are presented. Students are expected to write programs exemplifying some of techniques taught, using the LISP lanuage.

Subject:
Computer Science
Material Type:
Full Course
Homework/Assignment
Syllabus
Provider:
UMass Boston
Provider Set:
UMass Boston OpenCourseWare
Author:
Ph.D.
Professor Wei Ding
Date Added:
02/16/2011
Artificial Intelligence, Fall 2010
Conditions of Use:
Remix and Share
Rating

This course introduces students to the basic knowledge representation, problem solving, and learning methods of artificial intelligence. Upon completion of 6.034, students should be able to develop intelligent systems by assembling solutions to concrete computational problems, understand the role of knowledge representation, problem solving, and learning in intelligent-system engineering, and appreciate the role of problem solving, vision, and language in understanding human intelligence from a computational perspective.

Subject:
Computer Science
Information Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Winston, Patrick Henry
Date Added:
01/01/2010
Ask an Engineer
Conditions of Use:
Read the Fine Print
Rating

Explore some of the wonders of modern engineering in this video from the Sciencenter in Ithaca, New York. Hear a diverse selection of engineers explain how things work.

Subject:
Computer Science
Engineering
Material Type:
Lecture
Provider:
PBS LearningMedia
Provider Set:
PBS Learning Media Common Core Collection
Teachers' Domain
Author:
Argosy Foundation
WGBH Educational Foundation
Date Added:
05/09/2006
Augmented Reality and Parabola Challenge
Conditions of Use:
Remix and Share
Rating

This is a challenge based activity in which students use augmented reality and trial and error in order to determine how changes to a quadratic equation affect the shape of a parabola. Students use the Geogebra AR app to manipulate equations and change the parabola to fit around a physical object.

Subject:
Computer Science
Algebra
Material Type:
Activity/Lab
Lesson Plan
Author:
Chris Barnabei
Date Added:
12/06/2018
Automata, Computability, and Complexity, Spring 2011
Conditions of Use:
Remix and Share
Rating

This course provides a challenging introduction to some of the central ideas of theoretical computer science. Beginning in antiquity, the course will progress through finite automata, circuits and decision trees, Turing machines and computability, efficient algorithms and reducibility, the P versus NP problem, NP-completeness, the power of randomness, cryptography and one-way functions, computational learning theory, and quantum computing. It examines the classes of problems that can and cannot be solved by various kinds of machines. It tries to explain the key differences between computational models that affect their power.

Subject:
Computer Science
Information Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Aaronson, Scott
Date Added:
01/01/2011
Automatic Speech Recognition, Spring 2003
Conditions of Use:
Remix and Share
Rating

Graduate-level introduction to automatic speech recognition. Provides relevant background in acoustic theory of speech production, properties of speech sounds, signal representation, acoustic modeling, pattern classification, search algorithms, stochastic modeling techniques (including hidden Markov modeling), and language modeling. Examines approaches of state-of-the-art speech recognition systems. Introduces students to the rapidly developing field of automatic speech recognition. Its content is divided into three parts. Part I deals with background material in the acoustic theory of speech production, acoustic-phonetics, and signal representation. Part II describes algorithmic aspects of speech recognition systems including pattern classification, search algorithms, stochastic modelling, and language modelling techniques. Part III compares and contrasts the various approaches to speech recognition, and describes advanced techniques used for acoustic-phonetic modelling, robust speech recognition, speaker adaptation, processing paralinguistic information, speech understanding, and multimodal processing.

Subject:
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Glass, James Robert
Date Added:
01/01/2003
Automation and Make
Conditions of Use:
No Strings Attached
Rating

Make is a tool which can run commands to read files, process these files in some way, and write out the processed files. For example, in software development, Make is used to compile source code into executable programs or libraries.

Subject:
Computer Science
Material Type:
Lesson
Provider:
NumFocus
Provider Set:
Software Carpentry
Author:
Gerard Capes
Date Added:
03/20/2017
Behavior of Algorithms, Spring 2002
Conditions of Use:
Remix and Share
Rating

Study of an area of current interest in theoretical computer science. Topic varies from term to term. This course is a study of Behavior of Algorithms and covers an area of current interest in theoretical computer science. The topics vary from term to term. During this term, we discuss rigorous approaches to explaining the typical performance of algorithms with a focus on the following approaches: smoothed analysis, condition numbers/parametric analysis, and subclassing inputs.

Subject:
Computer Science
Material Type:
Full Course
Provider:
M.I.T.
Provider Set:
M.I.T. OpenCourseWare
Author:
Spielman, Daniel
Date Added:
01/01/2002