Search Constraints
Number of results to display per page
Results for:
Affiliation
Delft University of Technology
Remove constraint Affiliation: Delft University of Technology
Polyu oer sim
No
Remove constraint Polyu oer sim: No
Year
2016
Remove constraint Year: 2016
1 - 7 of 7
Search Results
-
Courseware
This course is for all of those struggling with data analysis. You will learn: - Overcome data analysis challenges in your work and research - Increase your productivity and make better business decisions - Enhance your data analysis skills using spreadsheets - Learn about advanced spreadsheet possibilities like array formulas and pivottables - Learn about Excel 2013 features like PowerPivot & PowerMap - Learn to organize and test your spreadsheets
-
Courseware
This course covers the main tasks required from data analysts today, including importing, summarizing, interpreting, analyzing and visualizing data. It aims to equip you with the tools that will enable you to be an independent data analyst. Most techniques will be taught in Excel with add-ons and free tools available online. You will learn: - How to make data come to life with well-known types of visualizations such as line and bar graphs and new types of visualizations such as spark lines, contour plots and population pyramids. - How to create dashboards in Excel based on live data that can meet managerial and business needs. - How to connect data from different sources, such as the web and exports from your CRM, ERP, SAP or data warehouse. - Some hands-on data science and how to use actionable analysis tools. - Deep dive into known tools like PivotTables and introduce new ones like the analysis toolpak
-
Courseware
The purpose of this course is to learn how to specify the behavior of embedded systems and to experience the design of a provably correct system. In this course you will learn how to formally specify requirements and to prove (or disprove) them on the behaviour. With a practical assignment you will experience how to apply the techniques in practice.
- Subjects:
- Computing
- Keywords:
- Embedded computer systems
- Resource Type:
- Courseware
-
Courseware
Broadly speaking, functional programming is a style of programming in which the primary method of computation is the application of functions to arguments. Among other features, functional languages offer a compact notation for writing programs, powerful abstraction methods for structuring programs, and a simple mathematical basis that supports reasoning about programs. Functional languages represent the leading edge of programming language design, and the primary setting in which new programming concepts are introduced and studied. All contemporary programming languages such as Hack/PHP, C#, Visual Basic, F#, C++, JavaScript, Python, Ruby, Java, Scala, Clojure, Groovy, Racket, … support higher-order programming via the concept of closures or lambda expressions. This course will use Haskell as the medium for understanding the basic principles of functional programming. While the specific language isn’t all that important, Haskell is a pure functional language so it is entirely appropriate for learning the essential ingredients of programming using mathematical functions. It is also a relatively small language, and hence it should be easy for you to get up to speed with Haskell. Once you understand the Why, What and How that underlies pure functional programming and learned to “think like a fundamentalist”, we will apply the concepts of functional programming to “code like a hacker” in mainstream programming languages, using Facebook’s novel Hack language as our main example. This course assumes no prior knowledge of functional programming, but assumes you have at least one year of programming experience in a regular programming language such as Java, .NET, Javascript or PHP.
- Subjects:
- Computing
- Keywords:
- Haskell (Computer program language) Functional programming (Computer science)
- Resource Type:
- Courseware
-
Courseware
Are you ready to leave the sandbox and go for the real deal? Have you followed Data Analysis: Take It to the MAX() and Data Analysis: Visualization and Dashboard Design and are ready to carry out more robust data analysis? In this project-based course you will engage in a real data analysis project that simulates the complexity and challenges of data analysts at work. Testing, data wrangling, Pivot Tables, sparklines? Now that you have mastered them you are ready to apply them all and carry out an independent data analysis. For your project, you will pick one raw dataset out of several options, which you will turn into a dashboard. You will begin with a business question that is related to the dataset that you choose. The datasets will touch upon different business domains, such as revenue management, call-center management, investment, etc.
- Subjects:
- Computing
- Keywords:
- Visual analytics Information visualization Industrial management -- Data processing Dashboards (Management information systems)
- Resource Type:
- Courseware
-
Courseware
Computability Theory deals with one of the most fundamental questions in computer science: What is computing and what are the limits of what a computer can compute? Or, formulated differently: “What kind of problems can be algorithmically solved?” During the course this question will be studied. Firstly, the notion of algorithm or computing will be made precise by using the mathematical model of a Turing machine. Secondly, it will be shown that basic issues in computer science, like “Given a program P does it halt for any input x?” or “Given two program P and Q, are they equivalent?” cannot be solved by any Turing machine. This shows that there exist problems that are impossible to solve with a computer, the so-called “undecidable problems”. The book is in English, the recorded lectures and slides however, are in Dutch
- Subjects:
- Computing
- Keywords:
- Machine theory Computational complexity Computable functions
- Resource Type:
- Courseware
-
Courseware
This course treats various methods to design and analyze datastructures and algorithms for a wide range of problems. The most important new datastructure treated is the graph, and the general methods introduced are: greedy algorithms, divide and conquer, dynamic programming and network flow algorithms. These general methods are explained by a number of concrete examples, such as simple scheduling algorithms, Dijkstra, Ford-Fulkerson, minimum spanning tree, closest-pair-of-points, knapsack, and Bellman-Ford. Throughout this course there is significant attention to proving the correctness of the discussed algorithms. All material for this course is in English. The recorded lectures, however, are in Dutch.
- Subjects:
- Computing
- Keywords:
- Algorithms Data structures (Computer science)
- Resource Type:
- Courseware