Search result for Mathematics for computer science specialization Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 102 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Mathematics for Computer Science
by Omar Karakchi , Dr Matthew Yee-King- 4.1
-
![]()
![]()
![]()
![]()
![]()
Approx. 38 hours to complete
This is designed to give you part of the mathematical foundations needed to work in computer science in any of its strands, from business to visual digital arts, music, games. For this we prepared computing and everyday life problems for you to solve using these tools, from sending secret messages to designing computer graphics....
Discrete Mathematics
by Miran Fattah- 4.5
-
![]()
![]()
![]()
![]()
![]()
19 hours on-demand video
Master Discrete Math for Computer Science and Mathematics Students The goal of this course is to build the mathematical foundation for computer science courses such as data structures, algorithms, relational and database theory, and for mathematics courses such as linear and abstract algebra, combinatorics, probability, logic and set theory, and number theory....
$21.99
Delivery Problem
by Alexander S. Kulikov- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
We’ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. We still don’t have provably efficient algorithms for this difficult computational problem and this is the essence of the P versus NP problem, the most important open question in Computer Science....
Algorithms for Searching, Sorting, and Indexing
by Sriram Sankaranarayanan- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 34 hours to complete
This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters. Algorithms for Searching, Sorting, and Indexing can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform....
Guided Tour of Machine Learning in Finance
by Igor Halperin- 3.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 24 hours to complete
Simultaneously, while this course can be taken as a separate course, it serves as a preview of topics that are covered in more details in subsequent modules of the specialization Machine Learning and Reinforcement Learning in Finance. The course is designed for three categories of students: Specialization Objectives Specialization Prerequisites Gradient Descent for Neural Networks...
Managing, Describing, and Analyzing Data
by Wendy Martin- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
This course can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics....
Paradox and Infinity
by Agustín Rayo , Cosmo Grant , David Balcarras- 0.0
-
![]()
![]()
![]()
![]()
![]()
12 Weeks
Please see the FAQ section below for additional information. Note: learners who do well in Paradox will have typically taken at least a couple of college-level classes in mathematics or computer science. On the other hand, Paradox does not presuppose familiarity with any particular branch of mathematics or computer science....
$99
Related searches
Convex Optimization
by Stephen Boyd , Henryk Blasinski- 0.0
-
![]()
![]()
![]()
![]()
![]()
8 Weeks
Candidate in Computer Science at Stanford University. , summa cum laude, in Mathematics and Computer Science from the University of Pennsylvania and an M. in Computer Science from Stanford University. He has served as a TA for EE364a at Stanford. She has served as a TA and as an instructor for EE364a at Stanford....
Convex Optimization
by Stephen Boyd , Henryk Blasinski- 0.0
-
![]()
![]()
![]()
![]()
![]()
8 Weeks
Candidate in Computer Science at Stanford University. , summa cum laude, in Mathematics and Computer Science from the University of Pennsylvania and an M. in Computer Science from Stanford University. He has served as a TA for EE364a at Stanford. She has served as a TA and as an instructor for EE364a at Stanford....
Discrete Mathematics: Open Doors to Great Careers
by Richard Han- 4.5
-
![]()
![]()
![]()
![]()
![]()
4.5 hours on-demand video
Would you like to learn a mathematics subject that is crucial for many high-demand lucrative career fields such as: You need to learn discrete mathematics because it is a required mathematical subject for your chosen career field such as computer science or electrical engineering. Practice problems are provided for you, and detailed solutions are also provided to check your understanding....
$11.99
