Search Results (13)

View
Selected filters:
  • ArsDigita University
Algorithms
Conditions of Use:
Remix and Share
Rating

The design of algorithms is studied, according to methodology and application. Methodologies ...

The design of algorithms is studied, according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexity of an algorithm and the underlying data structures. NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms.

Material Type:
Case Study
Full Course
Homework/Assignment
Lecture
Lecture Notes
Reading
Syllabus
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Shai Simonson
Applied Probability
Conditions of Use:
Remix and Share
Rating

Focuses on modeling, quantification, and analysis of uncertainty by teaching random variables, ...

Focuses on modeling, quantification, and analysis of uncertainty by teaching random variables, simple random processes and their probability distributions, Markov processes, limit theorems, elements of statistical inference, and decision making under uncertainty. This course extends the discrete probability learned in the discrete math class. It focuses on actual applications, and places little emphasis on proofs. A problem set based on identifying tumors using MRI (Magnetic Resonance Imaging) is done using Matlab.

Subject:
Statistics and Probability
Material Type:
Full Course
Homework/Assignment
Lecture
Lecture Notes
Reading
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Rajeev Surati
Tina Kapur
Artificial Intelligence
Conditions of Use:
Remix and Share
Rating

An quick overview of AI from both the technical and the philosophical ...

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
Database Management Systems
Conditions of Use:
Remix and Share
Rating

A more formal approach to Relational Database Management Systems, compared the way ...

A more formal approach to Relational Database Management Systems, compared the way they were covered during Web Applications. Database systems are discussed from the physical layer of B-trees and file servers to the abstract layer of relational design. Also includes alternative and generic approaches to database design and database management system including relational, object-relational, and object-oriented systems, SQL standards, algebraic query languages, integrity constraints, triggers, functional dependencies, and normal forms. Other topics include tuning database transactions, security from the application perspective, and data warehousing.

Material Type:
Assessment
Full Course
Homework/Assignment
Lecture
Reading
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Ravi Jasuja
Discrete Mathematics
Conditions of Use:
Remix and Share
Rating

This course covered the mathematical topics most directly related to computer science. ...

This course covered the mathematical topics most directly related to computer science. Topics included: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, and number theory. Emphasis will be placed on providing a context for the application of the mathematics within computer science. The analysis of algorithms requires the ability to count the number of operations in an algorithm. Recursive algorithms in particular depend on the solution to a recurrence equation, and a proof of correctness by mathematical induction. The design of a digital circuit requires the knowledge of Boolean algebra. Software engineering uses sets, graphs, trees and other data structures. Number theory is at the heart of secure messaging systems and cryptography. Logic is used in AI research in theorem proving and in database query systems. Proofs by induction and the more general notions of mathematical proof are ubiquitous in theory of computation, compiler design and formal grammars. Probabilistic notions crop up in architectural trade-offs in hardware design.

Subject:
Computer Science
Mathematics
Material Type:
Assessment
Full Course
Homework/Assignment
Lecture
Lecture Notes
Reading
Syllabus
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Shai Simonson
How Computers Work
Conditions of Use:
Remix and Share
Rating

Includes the basics of digital logical design, computer organization and architecture including ...

Includes the basics of digital logical design, computer organization and architecture including assembly language, processor design, memory hierarchies and pipelining. Students examine the detailed construction of a very simple computer. Problem sets use Beta-Sim, a RISC simulator written by Mike Wessler. A higher level view of a modern RISC architecture is studied, using the Patterson and Hennessey introductory text, from both the programmer's point of view and the hardware designer's point of view. The distinction between RISC and CISC architectures is emphasized.

Subject:
Architecture and Design
Material Type:
Assessment
Full Course
Homework/Assignment
Lecture
Lecture Notes
Reading
Syllabus
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Gill Pratt
Mathematics for Computer Science
Conditions of Use:
Remix and Share
Rating

A basic introduction to Calculus and Linear Algebra. The goal is to ...

A basic introduction to Calculus and Linear Algebra. The goal is to make students mathematically literate in preparation for studying a scientific/engineering discipline. The first week covers differential calculus: graphing functions, limits, derivatives, and applying differentiation to real-world problems, such as maximization and rates of change. The second week covers integral calculus: sums, integration, areas under curves and computing volumes. This is not meant to be a comprehensive calculus course, but rather an introduction to the fundamental concepts. The third and fourth weeks introduce some basic linear algebra: vector spaces, linear transformations, matrices, matrix operations, and diagonalization. The emphasis will be on using the results, not on their proofs.

Subject:
Computer Science
Calculus
Material Type:
Assessment
Full Course
Homework/Assignment
Reading
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Tara Holm
Object-oriented Program Design and Software Engineering
Conditions of Use:
Remix and Share
Rating

The concepts of the Object-oriented paradigm using Java. The basic principles of ...

The concepts of the Object-oriented paradigm using Java. The basic principles of software engineering are emphasized. We study how to design and think in an object oriented fashion. As a final project, students work in groups to develop a Gnutella distributed music-sharing client.

Material Type:
Assessment
Full Course
Homework/Assignment
Lecture
Lecture Notes
Reading
Syllabus
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Dave Goddeau
Software Engineering for Web Applications
Conditions of Use:
Remix and Share
Rating

Teaches basics of designing a dynamic web site with a database back ...

Teaches basics of designing a dynamic web site with a database back end, including scripting languages, cookies, SQL, and HTML with the goal of building such a site as the main (group) project Emphasizes computer-human interface and the graphical display of information. Crucial to the project is the identification of a client with whom the group must work with throughout the month, designing specifications, implementing them, reviewing and evaluating, and testing. This is a real-life client who intends to host the site for the purposes of building a community.

Material Type:
Full Course
Lecture
Reading
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Philip Greenspun
The Structure and Interpretation of Computer Programs
Conditions of Use:
Remix and Share
Rating

An introduction to programming and the power of abstraction, using Abelson and ...

An introduction to programming and the power of abstraction, using Abelson and Sussman's classic textbook of the same name. Key concepts include: building abstractions, computational processes, higher-order procedures, compound data, data abstractions, controlling interactions, generic operations, self-describing data, message passing, streams and infinite data structures, meta-linguistic abstraction, interpretation of programming languages, machine model, compilation, and embedded languages.

Subject:
Linguistics
Material Type:
Assessment
Full Course
Homework/Assignment
Lecture
Lecture Notes
Reading
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Holly Yanco
John Pezaris
Systems
Conditions of Use:
Remix and Share
Rating

Topics on the engineering of computer software and hardware systems: techniques for ...

Topics on the engineering of computer software and hardware systems: techniques for controlling complexity, system infrastructure, networks and distributed systems, atomicity and coordination of parallel activities, recovery and reliability, privacy of information, impact of computer systems on society. Case studies of working systems and outside reading in the current literature provide comparisons and contrasts. The group project is to write an NSF systems proposal to fund a middle-ware product, for announcement RFP01-63.

Subject:
Engineering
Material Type:
Assessment
Case Study
Full Course
Homework/Assignment
Lecture
Lecture Notes
Reading
Syllabus
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Luis Rodriguez
Theory of Computation
Conditions of Use:
Remix and Share
Rating

A theoretical treatment of what can be computed and how fast it ...

A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course.

Material Type:
Full Course
Homework/Assignment
Lecture
Lecture Notes
Reading
Syllabus
Provider:
ArsDigita University
Provider Set:
ArsDigita University
Author:
Shai Simonson