norhanms / algorithmic-toolbox-san-diego

✔ My Solutions of (Algorithmic-Toolbox ) Assignments from Coursera ( University of California San Diego ) With "Go In Depth" Part Which Contains More Details With Each of The Course Topics

Algorithmic Toolbox

🌟 Algorithmic Toolbox

This repository will contain my work from the Master Algorithmic Programming Techniques Specialization that was created by UC San Diego and delivered through Coursera. I will be implementing solutions in C++.

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.

📝 Table of Content

• Week-1 (pdf)

  • Sum of two Digits
  • Maximum Pairwise Product

• Week-2 (pdf)

  • Small Fibonacci Number
  • The Last Digit of a Large Fibonacci Number
  • Greatest Common Divisor
  • Least Common Multiple
  • Huge Fibonacci Number modulo m
  • Last Digit of a Sum of Fibonacci Numbers
  • Last Digit of a Partial Sum of Fibonacci Numbers
  • Last Digit of the Sum of Squares of Fibonacci Numbers

• Week-3 (pdf)

  • Money Change
  • Maximum Value of the Loot (Fractional Knapsack)
  • Maximum Advertisement Revenue (Maximum Dot Product)
  • Collecting Signatures (Covering Segments by Points)
  • Maximum Number of Prizes (Different Summands)
  • Maximum Salary (Largest Number)

• Week-4 (pdf)

  • binary search
  • majority element
  • improving quicksort
  • number of inversions
  • organizing a lottery
  • closest points

• Week-5 (pdf)

  • money change again
  • primitive calculator
  • edit distance
  • longest common subsequence of two sequences
  • longest common subsequence of three sequences

• Week-6 (pdf)

  • maximum amount of gold
  • partitioning souvenirs
  • maximum value of an arithmetic expression

💡📢 Go in Depth

I Have Added a New Part Go in Depth Which Will Contain The Course Covered Topics But With More Details ,And more Than One Method To Solve Each Problem

• Big O Notation
• Fibonacci-Numbers
• Greatest-Common-Divisor
• Least-Common-Multiple
• Fractional-Knapsack
• 0_1_KnapSack
• Linear Search
• Binary Search
• Polynomials Multiplication
• Selection Sort
• Merge Sort
• All Sorting Algorithms
• Binary Search Tree
• Binary Tree
• Bubble Sort
• Heap Sort
• Insertion Sort
• Minimum Spanning Tree
• Quick Sort
• Shell Sort
• Tower of Hanoi
• What's the stable sort

🎉🎈 Certification

License

This software is licensed under MIT License, See License for more information ©AbdallahHemdan.