Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
1 write an algorithm to determine if two general trees are identical make the algorithm as efficient as you can analyze
implement a city database using a bst to store the database records each database record contains the name of the city
1 give a permutation for the values 0 through 7 that will cause quicksort as implemented in section 75 to have its
graph f1n n log n f2n n 15 and f3n n 2 in the range 1 le n le 1000 to visually compare their growth rates typically
recall that a sorting algorithm is said to be stable if the original ordering for duplicate keys is preserved of the
a devise an algorithm to sort three numbers it should make as few comparisons as possible how many comparisons and
here is a variation on sorting the problem is to sort a collection of n nuts and n bolts by size it is assumed that for
use the unionfind algorithm to implement a solution to the following problem given a set of points represented by their
1 using induction prove that insertion sort will always produce a sorted array2 write an insertion sort algorithm for
when implementing insertion sort a binary search could be used to locate the position within the first i - 1 elements
figure 75 shows the best-case number of swaps for selection sort as thetan this is because the algorithm does not check
1 modify quicksort to find the smallest k values in an array of records your output should be the array modified so
imagine that there exists an algorithm splitk that can split a list l of n elements into k sub lists each containing
the discussion of quicksort in section 75 described using a stack instead of recursion to reduce the number of function
1 devise a sequential representation for huffman coding trees suitable for use as part of a file compression utility
1 write an algorithm to implement the transpose self-organizing list heuristic assuming that the list is implemented
compute the probabilities for the following situations these probabilities can be computed analytically or you may
1 what is the expected average number of pointers for a skip list node2 write a function to remove a node with given
implement both a standard thetan 3 matrix multiplication algorithm and strassens matrix multiplication algorithm see
1 implement the text compression system described in section 922 implement a system for managing document retrieval
implement the three self-organizing list heuristics count move-to-front and transpose compare the cost for running the
implement a binary search and the quadratic binary search of section 91 run your implementations over a large range of
1 write an algorithm for a deletion function for hash tables that replaces the record with a special value indicating a
write an algorithm to implement the move-to-front self-organizing list heuristic assuming that the list is implemented