Explore

Simulation, Algorithm Analysis, and Pointers

Approx. 11 hours to complete

Save Course

Go to Course

Course Summary

This course teaches how to design, analyze, and implement efficient algorithms and data structures using C++ programming language. It covers topics such as pointers, linked lists, trees, hashing, sorting, and searching algorithms.

Key Learning Points

Learn how to analyze the performance of algorithms and data structures
Understand the principles of simulation and its applications
Gain practical experience in implementing and testing algorithms and data structures

Learning Outcomes

Ability to design and implement efficient algorithms and data structures
Understanding of simulation principles and its applications
Experience in analyzing and optimizing algorithm performance

Prerequisites or good to have knowledge before taking this course

Basic knowledge of programming concepts
Familiarity with C++ programming language

Course Difficulty Level

Intermediate

Course Format

Online self-paced
Video lectures
Hands-on assignments

Similar Courses

Data Structures and Algorithms
Algorithmic Toolbox
Design and Analysis of Algorithms

Notable People in This Field

Donald Knuth
Jon Bentley

Related Books

Description

This course is the fourth and final course in the specialization exploring both computational thinking and beginning C programming. Rather than trying to define computational thinking, we’ll just say it’s a problem-solving process that includes lots of different components. Most people have a better understanding of what beginning C programming means!

This course assumes you have the prerequisite knowledge from the previous three courses in the specialization. You should make sure you have that knowledge, either by taking those previous courses or from personal experience, before tackling this course. The required prerequisite knowledge is listed below. Prerequisite computational thinking knowledge: Algorithms and procedures; data collection, analysis, and representation; abstraction; and problem decomposition Prerequisite C knowledge: Data types, variables, constants; STEM computations; selection; iteration (looping); arrays; strings; and functions Throughout this course the computational thinking topics you'll explore are: automation, simulation, parallelization, and algorithm analysis.For the programming topics, you'll continue building on your C knowledge by implementing file input and output in your programs and by exploring pointers in more depth. Module 1: Learn how to read, write, and append to files. Explore automation Module 2: Discover the benefits of simulation and parallelization Module 3: Learn how to perform algorithm analysis to quantify algorithm complexity Module 4: Explore how to use pointers in more depth

Outline

File IO and Automation
Course Introduction
Navigating a Coursera Course
Meet the Instructor (optional)
Lesson Introduction
Why Files?
Reading a File
Writing a File
Appending to a File
Lesson Introduction
What is Automation?
Turning Up the Heat
Who You Gonna Call?
Who's Hungry?
CNC Machines
Robots
Driving
Visual Studio and Xcode File Locations
Exercise 1: File Caesar Cipher
File IO Lecture Code
Automation Exercise: Automating Basic Hygiene
Automation Topic Understanding Check
I, Robot Solution

Simulation and Parallelization
Lesson Introduction
What is Simulation?
Simulating Computers with Computers
Training
Real-World Systems
Fitness
Lesson Introduction
What is Parallelization?
Sandwiches in Parallel
Doing Math in Parallel
Building a Video Game in Parallel
Pipelines
Parallel Processing
Parallelization Activity
Simulation Topic Understanding Check
Parallelization Topic Understanding Check
Simulation and Parallelization Practice Quiz
Simulation and Parallelization Graded Quiz

Algorithm Analysis
Lesson Introduction
What is Algorithm Analysis?
Introduction to Big-O
Big-O Examples
Dynamic Array Operations
Bubble Sort
Selection Sort
Insertion Sort
Recursion
Recursive Binary Search
Merge Sort
Algorithm Analysis Lecture and Reading Code
Algorithm Analysis Practice Quiz
Algorithm Analysis Graded Quiz

Pointers
Lesson Introduction
Pointer Basics
Changing the Pointed to Value
Walking an Array with Pointers
Dynamic Memory Allocation
Getting More Memory
Pointers to Structs
Finishing Up
Pointers Lecture Code
Walking the Walk Solution

Summary of User Reviews

This course on simulation algorithm analysis and pointers has received positive reviews from many users. The course covers an in-depth analysis of simulation algorithms and pointers. One key aspect that many users thought was good was the comprehensive nature of the course material.

Pros from User Reviews

Comprehensive course material
Great instructor
Challenging assignments

Cons from User Reviews

Some videos are too long
Lack of practical examples
Not suitable for beginners

Recommended for you

Process Mining: Data science in Action

Process mining is the missing link between model-based process analysis and data-oriented analysis techniques. It is not sufficient to focus on data storage and data analysis....

Save Course

The Development of Mobile Health Monitoring Systems

This join course created by SPSU and ETU includes 5 modules dedicated to different stages of the system development. Its modules represent several widely separated fields of biomedical engineering....

Save Course

Comparing Genes, Proteins, and Genomes (Bioinformatics III)

Once we have sequenced genomes in the previous course, we would like to compare them to determine how species have evolved and what makes them different....

Save Course