Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
problem1 draw a simple undirected graph g that has 12 vertices 18 edges and 3 connected components why would it be
problemdraw a simple connected directed graph with 8 vertices and 16 edges such that the in-degree and out-degree of
problem1 show how to modify the pseudo-code for dijkstras algorithm for the case when the graph is directed and we
problem1 implement a compression and decompression scheme that is based on huffman coding2 create a class that
problem1 give an efficient algorithm for determining if a pattern p is a subsequence not substring of a text t what is
problemdesign a greedy algorithm for making change after someone buys some candy costing x cents and the customer gives
problemdefine the edit distance between two strings x and y of length n and m respectively to be the number of edits
problem1 let t be a text string of length n describe an on-time method for finding the longest prefix of t that is a
problem1 give an efficient algorithm for deleting a string from a compressed trie and analyze its running time2
problem1 given a string x of length n and a string y of length m describe an on m-time algorithm for finding the
problem1 give an example of a text t of length n and a pattern p of length m that force the brute-force pattern
problemshow the longest common subsequence array l for the two stringsx skullandbonesy lullabybabieswhat is a longest
problem1 draw the compact representation of the suffix trie for the string minimize minime2 what is the longest prefix
problem1 assuming that the characters in alphabet sigma can be enumerated and can be used to index arrays give an om
problem1 list the prefixes of the stringp aaabbaaa that are also suffixes of p2 draw a figure illustrating the
problem1 implement the randomized quick-sort and quick-select algorithms and design a series of experiments to test
problem1 implement an in-place version of insertion-sort and an in-place version of quick-sort perform benchmarking
problem1 implement merge-sort and deterministic quick-sort and perform a series of benchmarking tests to see which one
problem1 experimentally compare the performance of in-place quick-sort and a version of quick-sort that is not
problemthis problem deals with modification of the quick-select algorithm to make it deterministic yet still run in on
problembob has a set a of n nuts and a set b of n bolts such that each nut in a has a unique matching bolt in b
problem1 let a and b be two sequences of n integers each given an integer m describe an on log n -time algorithm for
problemlet s be a sequence of n elements on which a total order relation is defined recall that an inversion in s is a
problem1 given a sequence s of n elements on which a total order relation is defined describe an efficient method for
problemsuppose we are given two sequences a and b of n elements possibly containing duplicates on which a total order