Laboratory Exercises, C++ Programming

More documents

Recommendations

Info

30 Programming with the STL find_if(v.begin(), v.end(), bind2nd(first_equal(), name)) first equal is a functor (a class) that takes two parameters, a pair and a host name, and compares the first component of the pair with the name. b) Implement a class MapNameServer that uses a map to store the name/address pairs. The average search time in this implementation will be considerably better than that for the vector implementation. c) It is possible that the map implementation of the name server is sufficiently efficient, but you shall also try a third implementation. Implement a class HashNameServer that uses a hash table to store the name/address pairs. Use a vector of vector’s to store the name/address pairs. 8 The hash table implementation is open for experimentation: you must select an appropriate size for the hash table and a suitable hash function. 9 It can also be worthwhile to exploit the fact that most (in fact all, in the test program) computer names start with “www.”. Without any greater difficulty, you should be able to improve the search times that you obtained in the map implementation by about 50%. Use the program nstest.cc to check that the insert/remove/lookup functions work correctly. Then, use the program nstime.cc to measure and print the search times for the three different implementations, using the file nameserverdata.txt as input (the file contains 25,143 name/address pairs 10 ). A2. Examples of average search times in milliseconds for a name server with 25,143 names are in the following table. vector 0.185 map 0.00066 hash 0.00029 25,143 100,000 Search the Internet for information about search algorithms for different data structures, or use your knowledge from the algorithms and data structures course, and fill in the blanks in the table. Write a similar table for your own implementation. 2 Bitsets, Subscripting, and Iterators 2.1 Bitsets To manipulate individual bits in a word, C++ provides the bitwise operators & (and), | (or), ^ (exclusive or), and the shift operators > (shift right). The STL class bitset generalizes this notion and provides operations on a set of N bits indexed from 0 through N-1. N may be arbitrary large, indicating that the bitset may occupy many words. For historical reasons, bitset doesn’t provide any iterators. We will develop a simplified version of the bitset class where all the bits fit in one word, and extend the class with iterators so it becomes possible to use the standard STL algorithms with the class. Our goal is to provide enough functionality to make the following program work correctly: 8 GNU STL contains a class hash map (in newer versions unordered map), a map implementation that uses a hash table. You should not use any of these classes in this assignment. 9 Note that a good hash function should take all (or at least many) of the characters of a string into account and that "abc" and "cba" should have different hash codes. For instance, a hash function that merely adds the first and last characters of a string is not acceptable. 10 It was difficult to find a file with real name/address pairs, so the computer names are common words from a dictionary file, with www. first and .se or similar last. The IP addresses are running numbers.
Programming with the STL 31 int main() { using namespace std; using namespace cpp_lab4; } // Define an empty bitset, set some bits, print the bitset Bitset bs; bs[3] = true; bs[0] = bs[3]; copy(bs.begin(), bs.end(), ostream_iterator(cout)); cout
Page 1: LUND INSTITUTE OF TECHNOLOGY C++ Pr
Page 4 and 5: 4 The GNU Compiler Collection and C
Page 10 and 11: 10 The GNU Compiler Collection and
Page 12 and 13: 12 Tools for Practical C++ Developm
Page 24 and 25: 24 Strings and Streams char type is
Page 26 and 27: 26 Strings and Streams A2. The Siev
Page 28 and 29: 28 Strings and Streams A3. The file
Page 32 and 33: 32 Programming with the STL An outl

Laboratory Exercises, C++ Programming

Create successful ePaper yourself

Delete template?

Save as template?