CMSC-341, Spring 1999, Sections 101 and 201
Final Exam Questions Notes
The following questions will not be used:
27, 28, 34
Here is an additional graph question:
Given a drawing of an undirected weighted graph, show the
construction of a minimum spanning tree (in stages) using
Prim's Algorithm. Repeat using Kruskal's algorithm.
Here are some STL questions that might be used:
- List the three basic components of the Standard Template Library.
Give a short description of each and explain how they relate to each
other.
- Explain the difference between a sequence container and an
associative container.
- What are STL adaptors?
- Explain what does each of the following STL operations does:
push_front(),
push_back(),
pop_front(),
pop_back()
- Determine the output of a simple code segment.