COMPUTER SCIENCE 3100 -- DATA STRUCTURES + ALGORITHMS Study Questions For Chapters 8 and 9 of Stubbs and Webre Add this material to what you study for the (comprehensive) Final Exam ====================================================================== Chapter Eight: Strings ====================================================================== Describe several ways of representing strings as Pacal or C data structures. ====================================================================== Define "fixed length" character representation. ====================================================================== Define even parity, odd parity. ====================================================================== Explain what embedded shift instructions are. Give an example that illustrates. ====================================================================== Starting with a list L of frequencies, draw a Huffman coding tree that represents a Huffman code for L. ====================================================================== Give the definitions from chapter 8 of Stubbs and Webre of the terms match, hit and miss. ====================================================================== Explain what the "obvious" string matching algorithm is. ====================================================================== Chapter Nine: Graphs ====================================================================== Discuss ways that directed or undirected graphs can be represented by adjaceny lists or adjacency matrices, especially the representations from Stubbs and Webre. ====================================================================== Given information about a specific graph and/or a specific graph operation, discuss the choice of representation of the graph that would tend to make the operation most efficient. (For example, the relative number of nodes and edges in a graph can make a difference in the ways that are convenient to represent it.) ====================================================================== Given a drawing of a graph and some information about the order in which one generates the neighbors of a node, mark the nodes according to the order they would be visited in a depth-first search or a breadth-first search. ====================================================================== Similar to the previous problem, given a drawing of a network, list in order the edges that might be chosen to generate a minimal cost spanning tree using the algorithm of chapter 9 of Stubbs and Webre. ======================================================================