Data Structures and Algorithms

This repository will contain my work from the Master Algorithmic Programming Techniques Specialization that was created by UC San Diego and delivered through Coursera.

About This Specialization

The Specialization covers algorithmic techniques for solving problems arising in computer science applications. It is a mix of theory and practice: you will not only design algorithms and estimate their complexity, but you will get a deeper understanding of algorithms by implementing them in the programming language of your choice (C, C++, C#, Haskell, Java, JavaScript, Python2, Python3, Ruby, and Scala).

This Specialization is unique, because it offers two real-world projects. Advanced Shortest Paths project is offered in the end of the Algorithms on Graphs course. In this project, you'll deal with road network analysis and social network analysis. You'll learn how to compute the fastest route between New York and Mountain View thousands of times faster than classic algorithms and close to those used in Google Maps. Through Genome Assembly culminating project at the end of the Specialization, you'll learn how to assemble genomes from millions of short pieces and how algorithms fuel recent developments in personalized medicine.

Data Structures

Assignments for Data Structures on Coursera with time and memory results from grader

Week 1

Prgramming Assignment: Basic Data Structures

Problem: Check brackets in the code

• Python: Max time used: 0.10/1.00, max memory used: 15974400/536870912

Problem: Compute tree height

• Python: Max time used: 0.10/1.00, max memory used: 15974400/536870912

Problem: Network packet processing simulation

• Python: Max time used: 0.93/8.00, max memory used: 50212864/536870912

Week 2

Prgramming Assignment: Priority Queues and Disjoint Sets

Problem: Convert array into heap

• Python: Max time used: 0.10/1.00, max memory used: 15974400/536870912

Problem: Parallel processing

• Python: Max time used: 1.03/6.00, max memory used: 41918464/536870912

Problem: Merging tables

• Python: Max time used: 1.20/6.00, max memory used: 157966336/536870912

Week 3

Prgramming Assignment: Hash Tables and Hash Functions

Problem: Phone book

• Python: Max time used: 0.68/6.00, max memory used: 98324480/671088640

Problem: Hashing with chains

• Python: Max time used: 0.75/7.00, max memory used: 24621056/536870912

Week 4

Prgramming Assignment: Binary Search Trees

Problem: Binary tree traversals

• C++: Max time used: 0.07/1.00, max memory used: 28282880/536870912

Problem: Set with range sums

• C++: Max time used: 0.13/1.00, max memory used: 35995648/536870912