Online Course – Certified Professional Internship in Fundamentals of Data Structures and Algorithms from University of Colorado Boulder

Discover the world of kindergarten reservations, children in the city center. A wide variety of educational programs and adventures await you here!

Suggested by: Coursera (What is Coursera?)

Start your Coursera.com free trial today
קורס אונליין - התמחות מקצועית מוסמכת ביסודות של מבני נתונים ואלגוריתמים של University of Colorado Boulder

Professional Certificate

Advanced

No prior knowledge required

Time to complete the course

7-day free trial

No unnecessary risks

Skills you will acquire in the course

  • In-depth understanding of data organization on a computer
  • Performing sorting, searching, and indexing operations effectively
  • Knowledge of data structures: arrays, spreadsheets, stacks, trees, and graphs
  • Algorithm development: sorting, searching, short paths and traversal algorithms
  • Solving data structure problems through algorithm analysis and design
  • Creating trees and graphs
  • Handling inaccessibility
  • Programming data structures and algorithms in Python

What you will learn in the course

Courses for which the course is suitable

  • Data Science Application Developer
  • Python programmer
  • Data Analyst
  • Software Engineer
  • Algorithm developer
  • Data Structures Expert
  • Information Systems Developer
  • Data Engineer
  • Data processing software developer
  • Data Science Researcher

Internship – 5-part course series

Developing data science applications quickly and efficiently requires a deep understanding of how data can be organized on a computer and how to perform operations such as sorting, searching, and indexing effectively. This course will teach the principles of data structures and algorithms with an emphasis on data science applications.

This specialization is intended for learners who are interested in programming applications that process large amounts of data (no data science expertise required), and are familiar with the basics of Python programming.

Topics taught:

  • Data structures: arrays, spreadsheets, stacks, trees, and graphs
  • Algorithms: Sorting, searching, shortest paths, and traversal algorithms

This specialization can be studied as an academic credit as part of the Master of Data Science or Master of Computer Science degrees offered by CU Boulder on the Coursera platform.

Links to degrees:

Applied Learning Project

Learners will solve data structure problems by analyzing and designing algorithms for searching, sorting, and indexing; creating trees and graphs; and dealing with inaccessibility. Courses also include algorithm design problems, as well as opportunities to program data structures/algorithms in the Python programming language.

Details of the courses that make up the specialization

Courses in algorithms and data structures

Course 1: Algorithms for searching, sorting, and indexing

Duration: 35 hours

Rating: 4.7 (354 ratings)

What you will learn:

  • Explanation of basic concepts in search and sorting algorithms
  • Describe heap data structures and analyze heap elements.
  • Design basic algorithms for implementing sorting and hashing functions

Skills you will acquire:

  • Algorithm design
  • Python programming
  • Data structure design
  • Algorithm analysis
  • Graph algorithms

Course 2: Trees and Graphs: Fundamentals

Duration: 34 hours

Rating: 4.7 (104 ratings)

What you will learn:

  • Defining basic tree data structures
  • Performing splits and creating graphs within a binary search tree structure
  • Describing strongly connected components in graphs

Skills you will acquire:

  • Algorithm design
  • Python programming
  • Data structure design
  • Tables of values
  • Algorithm analysis

Course 3: Dynamic Programming, Greedy Algorithms

Duration: 37 hours

Rating: 4.6 (125 ratings)

What you will learn:

  • Description of basic techniques for designing algorithms
  • Creating divide-and-conquer algorithms, dynamic programming, and greedy algorithms
  • Understanding unsolvable problems, P vs. NP

Skills you will acquire:

  • Algorithm design
  • Python programming
  • Data structure design
  • Unsolvable problems
  • Algorithm analysis

Course 4: Approximation Algorithms and Linear Programming

Duration: 48 hours

Rating: 4.9 (31 ratings)

What you will learn:

  • Formulation of linear and comprehensive programming problems
  • Develop a basic understanding of how linear programming problems are solved
  • Understanding how approximation algorithms calculate solutions

Skills you will acquire:

  • RSA (encryption system)
  • Quantum algorithms
  • Public key encryption

Course 5: Advanced Data Structures, RSA, and Quantum Algorithms

Duration: 44 hours

Rating: 4.4 (15 ratings)

What you will learn:

  • Exploring basic concepts in number theory for building the RSA encryption system
  • Testing the basics of quantum computing

Related products