MarufHassan/coursera-data-structures-algorithms

Java assignment of Coursera Data Structures and Algorithms Specialization class

Coursera: Data Structures and Algorithms Specialization

Programming assignments for Data Structures and Algorithms Specialization.

About this Specialization

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice.

The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine.

COURSE 1: Algorithmic Toolbox

Assignment	Name	Score
Week 1	Programming Challenges	100/100
Week 2	Algorithmic Warmup	100/100
Week 3	Greedy Algorithms	100/100
Week 4	Divide and Conquer	100/100
Week 5	Dynamic Programming 1	100/100
Week 6	Dynamic Programming 2	67/100

• Programming Challenges

  • Sum of Two Digits
  • Maximum Pairwise Product

• Algorithmic Warmup

  • Fibonacci Number
  • Last Digit of a Large Fibonacci Number
  • Greatest Common Divisor
  • Least Common Multiple
  • Fibonacci Number Again
  • Last Digit of the Sum of Fibonacci Numbers
  • Last Digit of the Sum of Fibonacci Numbers Again
  • Last Digit of the Sum of Squares of Fibonacci Numbers

• Greedy Algorithms

  • Money Change
  • Maximum Value of the Loot
  • Maximum Advertisement Revenue
  • Collecting Signatures
  • Maximum Number of Prizes
  • Maximum Salary

• Divide and Conquer

  • Binary Search
  • Majority Element
  • Improving Quick Sort
  • Number of Inversions
  • Organizing a Lottery
  • Closest Points

• Dynamic Programming 1

  • Money Change Again
  • Primitive Calculator
  • Edit Distance
  • Longest Common Subsequence of Two Sequences
  • Longest Common Subsequence of Three Sequences

• Dynamic Programming 2

  • Maximum Amount of Gold
  • Partitioning Souvenirs
  • Maximum Value of an Arithmetic Expression

COURSE 2: Data Structures

Assignment	Name	Score
Week 1	Basic Data Structures	100/100
Week 3	Priority Queues and Disjoint Sets	100/100
Week 4	Hash Tables	100/100
Week 6	Binary Search Trees	60/100

• Basic Data Structures

  • Check brackets in the code
  • Compute tree height
  • Network packet processing simulation
  • Extending stack interface

• Priority Queues and Disjoint Sets

  • Convert array into heap
  • Parallel processing
  • Merging tables

• Hash Tables

  • Phone book
  • Hashing with chains
  • Find pattern in text

• Binary Search Trees

  • Binary tree traversals
  • Is it a binary search tree?
  • Is it a binary search tree? Hard version
  • Set with range sums
  • Rope

COURSE 3: Algorithms on Graphs

Assignment	Name	Score
Week 1	Decomposition of Graphs 1	100/100
Week 2	Decomposition of Graphs 2	100/100
Week 3	Paths in Graphs 1	100/100
Week 4	Paths in Graphs 2	100/100

• Decomposition of Graphs 1

  • Finding an Exit from a Maze
  • Adding Exits to a Maze

• Decomposition of Graphs 2

  • Checking Consistency of CS Curriculum
  • Determining an Order of Courses
  • Checking Whether Any Intersection in a City is Reachable from Any Other

• Paths in Graphs 1

  • Computing the Minimum Number of Flight Segments
  • Checking whether a Graph is Bipartite

• Paths in Graphs 2

  • Computing the Minimum Cost of a Flight
  • Detecting Anomalies in Currency Exchange Rates
  • Exchanging Money Optimally

COURSE 4: Algorithms on Strings

Assignment	Name	Score
Week 1	Suffix Trees	60/100
Week 2	Burrows-Wheeler Transform and Suffix Arrays	100/100

• Suffix Trees

  • Construct a Trie from a Collection of Patterns
  • Implement TrieMatching
  • Extend TrieMatching
  • Construct the Suffix Tree of a String
  • Find the Shortest Non-Shared Substring of Two Strings

• Burrows-Wheeler Transform and Suffix Arrays

  • Construct the Burrows–Wheeler Transform of a String
  • Reconstruct a String from its Burrows–Wheeler Transform
  • Implement BetterBWMatching
  • Construct the Sufx Array of a String

This is only for discussion and communication. Please don't use this for submission of assignments.