Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
1 for each of the three self-organizing list heuristics count move-to-front and transpose describe a series of record
graph the equations tn log2 n and tn n loge n which gives the better performance binary search on a sorted list or
1 modify the binary search routine of section 35 to implement interpolation search assume that keys are in the range 1
1 create a graph showing expected cost versus the probability of an unsuccessful search when performing sequential
section 851 suggests that an easy modification to the basic 2-way mergesort is to read in a large chunk of data into
1 assume that you have a b-tree whose internal nodes can store up to 100 children and whose leaf nodes can store up to
implement the dictionary adt of section 44 for a large file stored on disk by means of the b-tree of section 105 assume
a draw the adjacency matrix representation for the graph of figure 1125b draw the adjacency list representation for the
1 modify the algorithm for single-source shortest paths to actually store and return the shortest paths rather than
design a format for storing graphs in files then implement two functions one to read a graph from a file and the other
1 prove that a tree is a bipartite graph2 prove that any tree can be two-colored3 write an algorithm that deterimines
1 does either prims or kruskals algorithm work if there are negative edge weights2 consider the collection of edges
1 write an algorithm to find a maximum cost spanning tree that is the spanning tree with highest possible cost2 when
1 write an algorithm to determine whether an undirected graph of v vertices contains a cycle your algorithm should run
revise the bst class of section 54 to use the splay tree rotations your new implementation should not modify the
implement the memmanager adt shown at the beginning of section 123 do not use separate memory for the free list but
1 a show the result of building a pr quadtree from the following points inserted in the order given assume the tree is
when performing a region search on a pr quadtree we need only search those subtrees of an internal node whose
revise the bst class of section 54 to use the avl tree rotations your new implementation should not modify the original
a chocolate company decides to promote its chocolate bars by including a coupon with each bar a bar costs a dollar and
use the pr quadtree to implement an efficient solution to problem 65 that is store the set of points in a pr quadtree
implement a city database using the bintree each database record contains the name of the city a string of arbitrary
1 state the greatest possible lower bound that you can for the all-pairs shortest paths problem and justify your
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