(Updated November 30) *************** I will ask you to describe certain specific implementations of certain data structures in detail. This might include a detailed description of how to implement a queue as a linked list (not doubly linked), how to implement a search structure in various ways, how to implement a stack as an array, how to implement a sparse array as a search structure, for example. *************** I will expect you to know a number of terms, such as "sparse matrix," "balanced binary search tree," "priority queue," "strong component," "abstract data type," "acyclic digraph," "linked list," and many others. You might be asked to identify the name (as a multiple choice question) or to define a term, or there might be a question (perhaps a true/false question) which requires knowlege of the definition of one of these terms. *************** I expect you to be familiar with a number of specific algorithms and data structures we discussed in class. Here is a partial list: Stack Queue Heap Binary Search Tree AVL Tree Hash Table List Linked List (not the same as just "list") Tree Sparse Array Binary Search Linear Search Bubblesort Insertion Sort Selection Sort Quicksort Heapsort Mergesort Polyphase Mergesort Union/Find DFS BFS Inorder, Preorder, or Postorder Traversal *************** I might ask you to write an implementation of a particular Abstract Data Type, such as "Stack of Integer" including code for the needed operators *************** I will ask you to give me the asymptotic time complexity of several code fragments. For example, if I give you the code fragment below, you should give O(n log n) as the answer: for (int i=1; i