2014-05-18
Given a "real life" problems.
Originally Posted By: dburke
Some ideas for the Practice Final item: Given a "real life" problem, figure out which algorithm or data structure would be most helpful.
1) Given a roadmap with distances between points, find the shortest distance from one point to another. Model the roadmap as a graph with the points as vertices and the roads as edges.
2) Given two DNA sequences, determine whether they are similar. Find the longest common subsequence (LCS)
3) Parts explosion problem where there are n! possible parts assemblies. Use topological sorting.
1) Given a roadmap with distances between points, find the shortest distance from one point to another. Model the roadmap as a graph with the points as vertices and the roads as edges.
2) Given two DNA sequences, determine whether they are similar. Find the longest common subsequence (LCS)
3) Parts explosion problem where there are n! possible parts assemblies. Use topological sorting.
'''Originally Posted By: dburke'''
Some ideas for the Practice Final item: Given a "real life" problem, figure out which algorithm or data structure would be most helpful.<br><br>1) Given a roadmap with distances between points, find the shortest distance from one point to another. Model the roadmap as a graph with the points as vertices and the roads as edges.<br><br>2) Given two DNA sequences, determine whether they are similar. Find the longest common subsequence (LCS)<br><br>3) Parts explosion problem where there are n! possible parts assemblies. Use topological sorting.
(c) 2024 Yioop - PHP Search Engine