PIC10B/1 Winter 2014 Final Exam Study Guide

Size: px

Start display at page:

Download "PIC10B/1 Winter 2014 Final Exam Study Guide"

Lesley Robbins
6 years ago
Views:

1 PIC10B/1 Winter 2014 Final Exam Study Guide Suggested Study Order: 1. Lecture Notes (Lectures 1-24 inclusive) 2. Examples/Homework 3. Textbook The final exam will test 1. Your ability to read a program and understand what it does 2. Your ability to debug a program 3. Your ability to write C++ code snippets to accomplish small tasks 4. Your ability to write an entire C++ program, class, or template from scratch 5. Your understanding of the lecture notes, homework, examples, and homework readings Terms to know: All Terms to know in the Exam I and Exam II study guides. queue FIFO stack LIFO delimiter set traverse a collection multiset (bag) tree rooted tree binary tree n-ary tree hierarchy parent-child relationship root node parent node child node internal node external node (leaf) subtree path path length height of a tree binary search tree (BST) TreeNode tree traversal preorder traversal inorder traversal 1

2 postorder traversal expression tree prefix (Polish) notation infix notation postfix (Reverse Polish) notation map key value frequency counting pair multimap iterator priority queue prioritize HIFO Function call operator () heap C++ libraries and identifiers in those libraries we have used so far: iostream std::cin std::cout std::endl std::istream fail() clear() get() unget() peek() ignore() eof() std::ostream put() fstream std::ifstream close() std::ofstream close() sstream std::istringstream std::ostringstream str() 2

3 iomanip std::left std::right std::defaultfloat std::fixed std::scientific std::showpoint std::setprecision std::setw string std::string assert.h assert cstdlib NULL rand() srand(int seed) cmath STL libraries sqrt pow fabs ceil floor exp log log10 sin cos tan vector std::vector list std::list stack std::stack queue std::queue std::priority_queue set map std::set std::multiset std::map<k, V> 3

4 std::multimap<k, V> utility std::pair<k, V> make_pair C++ fundamental types short int long unsigned short unsigned int unsigned long float double bool char C++ classes string concatenation operator + concatenation-assignment operator += string and char orderings operator[] which returns char value at given index comparing string values using <, >, <=, >=, ==,!= length substr insert erase replace find c_str() cin >>, cout <<, getline(cin, ) C++ STL classes vector element access bracket operator[] capacity re clear front back 4

5 push_back pop_back list push_back begin end insert erase inner class list<t>::iterator operator* returns Node s value operator++ moves iterator to next node operator- - moves iterator to previous node queue push front pop stack push top pop set/multiset insert count begin end erase inner class set<t>::iterator or multiset<t>::iterator operator* returns Node s value operator++ moves iterator to next node operator- - moves iterator to previous node 5

6 map/multmap find begin end erase(key) erase(iteartor) lower_bound upper_bound equal_range max_ clear count(key) operator[] inner class set<t>::iterator or multiset<t>::iterator operator* returns Node s value operator++ moves iterator to next node operator- - moves iterator to previous node pair public member variables first second priority_queue push top pop upper inner class priority_queue<t>::iterator operator* returns Node s value operator++ moves iterator to next node operator- - moves iterator to previous node operators parenthesis () arithmetic +, -, *, /, % relational <, <=, >, >= comparison ==,!= logical &&,,! 6

7 increment (prefix and postfix) ++ decrement (prefix and postfix) -- assignment =, +=, -=, *=, /=, %= input >> output << ternary (? : ) of address of & dereferencing * arrow -> aka (* ). new delete delete [] casting static_cast<int>('a') escape sequences (char values) \n newline \t tab \r carriage return \\ backslash \" quotation mark \a ring system bell \0 null character control structures selection if if/else if/else/else switch repetition while do-while for Horstmann s graphics lecture will NOT be covered. 7

8 Things to know: Everything in the Exam I and Exam II Study Gudes. How to use the STL classes queue, stack, set, multiset, map, multimap, priority_queue. You should know the member functions listed for each STL class specified above. Be able to use the C++ STL iterators to visit/rprocess each element in vector, list, set/multiset, map/multimap, and priority_queue. You may be given a picture of particular STL container with iterators or pointers and must be able to use what you see in the picture to solve a problem. Such problems for example could include special cases of inserting, finding, or removing an item in the collection. Given a snippet of code involving an STL container, binary search tree, or heap. you should be able to draw a picture representing what the code does. How to list the nodes of a binary tree according to a preorder, inorder, or postorder traversal. Applications for each STL container and how to implement them. How to use a stack to evaluate postfix mathematical expressions. How to obtain prefix notation, infix notation, and postfix notation from traversing an expression tree. More to follow 8

PIC10B/1 Winter 2014 Exam I Study Guide

PIC10B/1 Winter 2014 Exam I Study Guide Suggested Study Order: 1. Lecture Notes (Lectures 1-8 inclusive) 2. Examples/Homework 3. Textbook The midterm will test 1. Your ability to read a program and understand