Courses tagged with "Evaluation" (733)

If you invest in financial markets, you may want to predict the price of a stock in six months from now on the basis of company performance measures and other economic factors. As a college student, you may be interested in knowing the dependence of the mean starting salary of a college graduate, based on your GPA. These are just some examples that highlight how statistics are used in our modern society. To figure out the desired information for each example, you need data to analyze. The purpose of this course is to introduce you to the subject of statistics as a science of data. There is data abound in this information age; how to extract useful knowledge and gain a sound understanding in complex data sets has been more of a challenge. In this course, we will focus on the fundamentals of statistics, which may be broadly described as the techniques to collect, clarify, summarize, organize, analyze, and interpret numerical information. This course will begin with a brief overview of the discipline of stat…

This course will introduce you to the field of computer science and the fundamentals of computer programming. Introduction to Computer Science I is specifically designed for students with no prior programming experience, and taking this course does not require a background in Computer Science. This course will touch upon a variety of fundamental topics within the field of Computer Science and will use Java, a high-level, portable, and well-constructed computer programming language developed by Sun Microsystems (now Oracle), to demonstrate those principles. We will begin with an overview of the course topics as well as a brief history of software development. We will cover basic object-oriented programming terminology and concepts such as objects, classes, inheritance, and polymorphism, as well as the fundamentals of Java, its primitive data types, relational operators, control statements, exception handling, and file input /output. By the end of the course, you should have a strong understanding of the fundam…

This course is a continuation of the first-semester course titled CS101: Introduction to Computer Science I [1]. It will introduce you to a number of more advanced Computer Science topics, laying a strong foundation for future academic study in the discipline. We will begin with a comparison between Java - the programming language utilized last semester - and C++, another popular, industry-standard programming language. We will then discuss the fundamental building blocks of Object-Oriented Programming, reviewing what we learned last semester and familiarizing ourselves with some more advanced programming concepts. The remaining course units will be devoted to various advanced topics, including the Standard Template Library, Exceptions, Recursion, Searching and Sorting, and Template Classes. By the end of the class, you will have a solid understanding of Java and C++ programming, as well as a familiarity with the major issues that programmers routinely address in a professional setting. [1] http://www.saylor.

In the first unit, we will learn the mechanics of editing and compiling a simple program written in C++.  We will begin with a discussion of the essential elements of C++ programming: variables, loops, expressions, functions, and string class.  Next, we will cover the basics of object-oriented programming: classes, inheritance, templates, exceptions, and file manipulation.  We will then review function and class templates and the classes that perform output and input of characters to/from files.  This course will also cover the topics of namespaces, exception handling, and preprocessor directives.  In the last part of the course, we will learn some slightly more sophisticated programming techniques that deal with data structures such as linked lists and binary trees. This course contains a number of sample programs and review exercises.  Through these exercises, students should better learn how to write functions, use the string class, and write elementary data structures such as linked lists and bina…

Modéliser un problème, concevoir un algorithme de résolution et en proposer une implémentation correcte. Du problème à sa solution, ce cours combine approches pragmatique, pratique et théorique de l'informatique.

This course was the first in a two-part series covering some of the algorithms underlying bioinformatics. It has now been split into three smaller courses.

In this class you will learn the basic principles and tools used to process images and videos, and how to apply them in solving practical problems of commercial and scientific interests.

This cross-disciplinary course deals with the undetermined, the unpredictable- or what appears to be such. Learn about the usefulness of randomness in communication and computation, the intrinsic randomness of quantum phenomena, the unpredictability of the weather, and the implications of the neural activity of the brain on our "free will".

When we use programming for problem-solving purposes, data must be stored in certain forms, or Data Structures, so that operations on that data will yield a specific type of output.  Imagine, for example, that a non-profit is having trouble staying afloat and needs an increase in donation.  It decides it wants to keep track of its donors in a program in order to figure out who is contributing and why.  You would first need to define the properties that would define those donors: name, address, amount donated, date of donation, and so on.  Then, when the non-profit wants to determine how to best reach out to their donors, it can create a model of the average donor that contributes to the non-profitsay, for example, based on size of gift and locationso that it can better determine who is most receptive to its mission.  In this case, size of gift and location are the “data” of the donor model.  If the non-profit were to use this model, it would be identifying real donors by first generating an abstract…

This course has been designed to provide you with a clear, accessible introduction to discrete mathematics. Discrete mathematics describes processes that consist of a sequence of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. As you progress through the units of this course, you will develop the mathematical foundations necessary for more specialized subjects in computer science, including data structures, algorithms, and compiler design. Upon completion of this course, you will have the mathematical know-how required for an in-depth study of the science and technology of the computer age.

Modern computer technology requires an understanding of both hardware and software, as the interaction between the two offers a framework for mastering the fundamentals of computing. The purpose of this course is to cultivate an understanding of modern computing technology through an in-depth study of the interface between hardware and software. In this course, you will study the history of modern computing technology before learning about modern computer architecture and a number of its important features, including instruction sets, processor arithmetic and control, the Von Neumann architecture, pipelining, memory management, storage, and other input/output topics. The course will conclude with a look at the recent switch from sequential processing to parallel processing by looking at the parallel computing models and their programming implications.

Software engineering is a discipline that allows us to apply engineering and computer science concepts in the development and maintenance of reliable, usable, and dependable software. The concept of software engineering was first discussed at the 1968 NATO Science Committee in Germany. Today, many practitioners still debate over the term software engineering, often arguing that this discipline does not meet the criteria of engineering; rather, it should be called software development. There are several areas to focus on within software engineering, such as design, development, testing, maintenance, and management. Software development outside of the classroom is a very complex process, mostly because real-world software is much larger and more complex. The purpose of this course is to present software engineering as a body of knowledge. The course is designed to present software engineering concepts and principles in parallel with the software development life cycle. The course will begin with an introducti…

Dieser Kurs vermittelt einen Überblick über die Grundlagen des Maschinellen Sehens an Hand der Extraktion von 3D-Information aus dem Stereokamerabild einer Szene.

Learn how to model social and economic networks and their impact on human behavior. How do networks form, why do they exhibit certain patterns, and how does their structure impact diffusion, learning, and other behaviors? We will bring together models and techniques from economics, sociology, math, physics, statistics and computer science to answer these questions.

Learn how to design secure systems and write secure code.

This course serves as an introduction to the basic principles that govern all aspects of our networked lives. We will learn about companies like Google and technologies like the Internet in a way that requires no mathematics beyond basic algebra.

This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings.

This course focuses on the fundamentals of computer algorithms, emphasizing methods useful in practice.  We look into the algorithm analysis as a way to understand behavior of computer programs as a function of its input size.  Using the big-O notation, we classify algorithms by their efficiency.  We look into basic algorithm strategies and approaches to problem solving.  Some of these approaches include the divide and conquer method, dynamic programming, and greedy programming paradigms.  Sorting and searching algorithms are discussed in detail as they form part of a solution to a large number of problems solved using computers.  We also provide an introduction to the graph theory and graph algorithms as they are also used in many computer-based applications today.  We conclude the course with a look into a special class of problems called the NP-complete problems.

This course will introduce you to modern operating systems.  We will focus on UNIX-based operating systems, though we will also learn about alternative operating systems, including Windows.  The course will begin with an overview of the structure of modern operating systems.  Over the course of the subsequent units, we will discuss the history of modern computers, analyze in detail each of the major components of an operating system (from processes to threads), and explore more advanced topics in the field, including memory management and file input/output.  The class will conclude with a discussion of various system-related security issues.

The Internet has become one of the most important components of our life. We browse the Web, check e-mails, make VoIP phone calls, and have video conferences via computers. All of these applications are made possible by networking computers together, and this complex network of computers is usually referred to as the Internet. This course is designed to give you a clear understanding of how networks, from in-home local area networks, or LANS, to the massive and global Internet, are built and how they allow us to use computers to share information and communicate with one another. Unit 1 introduces you to an explanation of what computer networks are as well as to some basic terminology fundamental to understanding computer networks. You will also familiarize yourself with the concept of layers, which compose the framework around which networks are built. Next, Unit 2 explains the concept of protocols. A computer communication (or network) protocol defines rules and conventions for communication between netwo…