Data Structures and Algorithms

• To use function templates to conveniently create a group of related (overloaded) functions
• To distinguish between function templates and function-template specializations
• To use class templates to create a group of related types
• To distinguish between class templates and class-template specializations
• To overload function templates
• To understand the relationships among templates, friends, inheritance and static members
• To search for a given value in a vector using binary search
• To sort a vector using the recursive merge sort algorithm
• To determine the efficiency of searching and sorting algorithms
• To form linked data structures using pointers, self-referential classes and recursion
• To create and manipulate dynamic data structures such as linked lists, queues, stacks and binary trees
• To use binary search trees for high-speed searching and sorting
• To understand various important applications of linked data structures
• To understand how to create reusable data structures with class templates, inheritance and composition
• To be able to use the template STL containers, container adapters and "near containers"
• To be able to program with the dozens of STL algorithm
• To understand how algorithms use iterators to access the elements of STL containers
• To become familiar with the STL resources available on the Internet and the World Wide Web