Skip to content

Sergei-Morozov/UCSD-Data-Structures-and-Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

43 Commits
 
 
 
 
 
 
 
 

Repository files navigation

UNIVERSITY OF CALIFORNIA SAN DIEGO

NATIONAL RESEARCH UNIVERSITY HIGHER SCHOOL OF ECONOMICS

Courses:

Week 2

Programming Assignment 1: Introduction

Problem: Small Fibonacci Number
Problem: The Last Digit of a Large Fibonacci Number
Problem: Greatest Common Divisor
Problem: Least Common Multiple
Problem: Huge Fibonacci Number modulo m

Week 3

Programming Assignment 2: Greedy algorithms

Problem: Changing Money
Problem: Fractional Knapsack
Problem: Covering Segments by Points
Problem: Pairwise Distinct Summands

Week 4

Programming Assignment 4: Divide and conquer

Problem: Binary Search
Problem: Majority Element
Problem: Sorting: 3-Way Partition
Problem: Number of Inversions
Problem: Points and Segments

Week 5

Programming Assignment 5: Dynamic programming

Problem: Primitive Calculator
Problem: Take as Much Gold as Possible
Problem: Compute the Edit Distance Between Two Strings
Problem: Maximize the Value of an Arithmetic Expression
Problem: Longest Common Subsequence of Three Sequences

Week 1

Programming Assignment 1: Basic Data Structures

Problem: Check brackets in the code
Problem: Compute tree height
Problem: Network packet processing simulation

Week 2

Programming Assignment 2: Priority Queues and Disjoint Sets

Problem: Convert array into heap
Problem: Parallel processing
Problem: Merging tables

Week 3

Programming Assignment 3: Hash Tables and Hash Functions

Problem: Phone book
Problem: Hashing with chains
Problem: Find pattern in text

Week 4-Week 5

Programming Assignment 4-5: Trees

Problem: Tree traversal
Problem: Range sum in splay tree

Assignments in Python for Algorithms on Graphs on Coursera

Week 1

Programming Assignment 1: Decomposition of Graphs

Problem: Finding an Exit from a Maze
Problem: Adding Exits to a Maze

Week 2

Programming Assignment 2: Decomposition of Graphs

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

Week 3

Programming Assignment 3: Paths in Graphs

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

Week 4

Programming Assignment 4: Paths in Graphs

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

Week 5

Programming Assignment 5: Minimum Spanning Trees

Problem: Building Roads to Connect Cities
Problem: Clustering

Week 6

Programming Assignment 6: Advanced Shortest Paths

About

Coursera platform/UNIVERSITY OF CALIFORNIA SAN DIEGO

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages