EdX

Basics of Mathematical Modeling of Systems (edX)

Basics of Mathematical Modeling of Systems (edX)

Basics of scientific visualization in mathematical modeling of systems – the course teaches the basics of scientific visualization of data obtained as a result of mathematical modeling of various systems and processes using C#. The aim of the course is to familiarize the listeners with approaches in scientific visualization of the results obtained from mathematical modeling of various systems and processes using C# with concrete examples.

Class Deals by MOOC List - Click here and see EdX's Active Discounts, Deals, and Promo Codes.

A successful study of the course forms a holistic view of mathematical modeling algorithms and data structures for object description and the ability to use them in professional activity. A prototype of the program is being created for dynamic script execution. The basics of image processing are studied. An algorithm for dynamic programming in various problems is considered. The basics of client-server applications are discussed.
The course was created as part of the project on the modern educational program development provided by Ministry of Science and Higher Education (Russia).

What you'll learn

  • A prototype of the program is being created for dynamic script execution.
  • We study working with image files and the basics of image processing.
  • An algorithm for dynamic programming in various problems is considered.
  • The basics of client-server applications are discussed.

Syllabus

Introduction
History of mathematical modeling.
Basic algorithms and data structures.
Evolution of programming languages.

Lesson 1. Creating a prototype program for dynamic script execution.
1.1 Introduction of dynamic script execution.
1.2 Designing the user interface of MathPanel app.
1.3 Methods for logging and console output.
1.4 Dynamic compilation using C#.
1.5 A template for MathPanel scripts.
1.6 Handler for the « Image » button.
1.7 Polishing the prototype.

Lesson 2. Bitmaps and working with image files.
2.1 An example of slideshow.
2.3 BitmapSimple class – an array of ARGB values.
2.4 Saving a BitmapSimple to a file.
2.5 Loading a BitmapSimple from a file.
2.6 BitmapSimple with a gradient.
2.7 Adding noise.
2.8 Grayscaling and smoothing.
2.9 Filterind and Sobel-filter.
2.10 Working with alpha-channel.

Lesson 3. Method of dynamic programming.
3.1 Implementing the text animation.
3.2 The task of optimal alignment of strings or objects .
3.3 How does the method of dynamic programming work ?
3.4 The code review.
3.5 Comparing two strings.
3.6 Comparing two text files.
3.7 Comparing arrays of objects.
3.8 Comparing image files.

Lesson 4. Drawing on html-canvas.
4.1 Html-canvas.
4.2 Introduction to canvas API.
4.3 Reviewing « graphix.js » library.
4.4 A simple test container for the library.
4.5 QuadroEqu class to simplify data preparation.
4.6 Drawing via script samples.

Conclusion
Modeling the movement of an absolutely elastic ball.
The simulation of cell colonies - the game «Life».
Event modeling (exit from the maze).

Go to Class
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Related Courses

Introduction to Object-Oriented Programming with Java III: Exceptions, Data Structures, Recursion, and GUIs (edX) EdX
Georgia Institute of Technology,GTx

Introduction to Object-Oriented Programming with Java III: Exceptions, Data Structures, Recursion, and GUIs (edX)

Learn how to create and use exceptions, data structures, recursion, and graphical user-interfaces (GUIs). This course provides students with the knowledge to handle and even create exceptions to achieve graceful error handling in programs. They will also create and utilize data structures, including lists and files. Students will also learn about recursion and how it can be a useful approach to repetition in a program. Finally, students will learn how to develop basic graphical user interfaces (GUIs) using JavaFX.

Self Paced
Self-Paced
Graphic Design Essentials (edX) EdX
LCI Education

Graphic Design Essentials (edX)

Acquire the essential skills to become a working Graphic Designer from the basics of color theory to presenting a project to a client. This online course from LaSalle College Vancouver will introduce you to the basics of design, graphic and visual communication, image making, typography and the overall creative process, starting from the client mandate to the final presentations.

Self Paced
Self-Paced
Advanced Linear Algebra: Foundations to Frontiers (edX) EdX
University of Texas at Austin,UTAustinX

Advanced Linear Algebra: Foundations to Frontiers (edX)

Learn advanced linear algebra for computing. Linear algebra is one of the fundamental tools for computational and data scientists. In Advanced Linear Algebra: Foundations to Frontiers (ALAFF), you will build your knowledge, understanding, and skills in linear algebra, practical algorithms for matrix computations, and the analysis of the effects of floating-point arithmetic as performed by computers.

Self Paced
Self-Paced
Data Structures and Algorithm Design Part I | 数据结构与算法设计(上) (edX) EdX
Tsinghua University,TsinghuaX

Data Structures and Algorithm Design Part I | 数据结构与算法设计(上) (edX)

Learn the basics of data structures and methods to design algorithms and analyze their performance. 本课程旨在围绕各类数据结构的设计与实现,揭示其中的规律原理与方法技巧;同时针对算法设计及其性能分析,使学生了解并掌握主要的套路与手段。

Self Paced
Self-Paced
Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms (edX) EdX
Georgia Institute of Technology,GTx

Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms (edX)

Learn more complex tree data structures, AVL and (2-4) trees. Investigate the balancing techniques found in both tree types. Implement these techniques in AVL operations. Explore sorting algorithms with simple iterative sorts, followed by Divide and Conquer algorithms. Use the course visualizations to understand the performance.

Self Paced
Self-Paced
Algorithms and Data Structures Capstone (edX) EdX
University of California, San Diego,UC San DiegoX

Algorithms and Data Structures Capstone (edX)

Synthesize your knowledge of algorithms and biology to build your own software for solving a biological challenge. Building a fully-fledged algorithm to assemble genomes from DNA fragments on a real dataset is an enormous challenge with major demand in the multi-billion dollar biotech industry. In this capstone project, we will take the training wheels off and let you design your own optimized software program for genome sequencing.

Self Paced
Self-Paced
Advanced Bayesian Statistics Using R (edX) EdX
University of Canterbury,UCx

Advanced Bayesian Statistics Using R (edX)

Now that you know the basics of Bayesian inference, dive deeper to explore its richness and flexibility more fully. Let’s take a closer look at modeling latent variables, Bayesian model averaging, generalised linear models, and MCMC methods. Advanced Bayesian Data Analysis Using R is part two of the Bayesian Data Analysis in R professional certificate.

Self Paced
Self-Paced
Fundamentals of Python (edX) EdX
SDA_Bocconi,SDA Bocconi School of Management

Fundamentals of Python (edX)

We will equip you with everything you need to properly start using Python in your daily work activities. You will learn how to install Python and work with it through different graphical front-ends. You will then learn how to define objects and how to recognize different characteristics and functionalities. Finally, you will learn how to make Python execute a series of instructions in a sequential order through loops, as well as how to write your own functions.

Self Paced
Self-Paced
Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues (edX) EdX
Georgia Institute of Technology,GTx

Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues (edX)

Work with the principles of data storage in Arrays, ArrayLists & LinkedList nodes. Understand their operations and performance with visualizations. Implement low-level linear, linked data structures with recursive methods, and explore their edge cases. Extend these structures to the Abstract Data Types, Stacks, Queues and Deques.

Self Paced
Self-Paced
Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps (edX) EdX
Georgia Institute of Technology,GTx

Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps (edX)

Become familiar with nonlinear and hierarchical data structures. Study various tree structures: Binary Trees, BSTs and Heaps. Understand tree operations and algorithms. Learn and implement HashMaps that utilize key-value pairs to store data. Explore probabilistic data structures like SkipLists. Course tools help visualize the structures and performance.

Self Paced
Self-Paced