Data Structures and Algorithm Analysis - Computer Science at ...

Sec. 16.6 Projects 533value depth5 220 030 02 025 126 331 016.7 If we had a linked list that would never be modified, we can use a simplerapproach than the Skip List to speed access. The concept would remain thesame in that we add additional pointers to list nodes for efficient access to theith element. How can we add a second pointer to each element of a singlylinked list to allow access to an arbitrary element in O(log n) time?16.8 What is the expected (average) number of pointers for a Skip List node?16.9 Write a function to remove a node with given value from a Skip List.16.10 Write a function to find the ith node on a Skip List.16.6 Projects16.1 Complete the implementation of the Skip List-based dictionary begun in Section16.2.2.16.2 Implement both a standard Θ(n 3 ) matrix multiplication algorithm and Strassen’smatrix multiplication algorithm (see Exercise 14.16.3.3). Using empiricaltesting, try to estimate the constant factors for the runtime equations ofthe two algorithms. How big must n be before Strassen’s algorithm becomesmore efficient than the standard algorithm?