Algorithms Exam 2

Suppose my_queue contains the symbols % $ @ ! # in order from front to rear. After three pop operations, which symbol is at the front of the queue?

• $

• @

• !

• #

The predecessor of a node is called its __________.

• sibling

• parent

• child

• descendant

Consider the following set of operations performed against a string type queue called

my_queue. my_queue.push("First Come");

my_queue.push("First Serve");

cout << my_queue.front() << endl;

Which string is output?

• First

• First Come

• First Serve

• Serve

A set of nodes T is a binary tree if either of the following is true:

â ¢ __________

â ¢ If T is not empty, it has a root node r with 0, 1, or 2 binary subtrees whose roots are connected to r by a branch.

• T is complete

• T is balanced

• T is full

• T is empty

Which of the following is a stack operation?

• front

• top

• insert

• back

Using the algorithm for converting an infix expression to a postfix expression, how is(14 + 5) - 8 * 4 / 2 represented in postfix form:

• 14 5 8 4 2 + - * /

• 14 5 + 8 4 * 2 / -

• 14 5 + 8 * / 2 -

• 14 5 8 + - 2 * /

Using the algorithm for converting an infix expression to a postfix expression, how is

(14 + 5) - 8 * 4 / 2

represented in postfix form?

• 14 5 8 4 2 + - * /

• 14 5 + 8 4 * 2 / -

• 14 5 + 8 * / 2 -

• 14 5 8 + - 2 * /

A set of nodes T is a binary tree if either of the following is true:

â ¢ __________

â ¢ If T is not empty, it has a root node r with 0, 1, or 2 binary subtrees whose roots are connected to r by a branch.

• T is complete

• T is balanced

• T is full

• T is empty

Binary search must be performed on a(n) __________ array.

• Sorted

• linked

• binary

• none of the above

Suppose that circular_queue, which is based on a circular array, stores the items 1, 1, 2, 3, 5, 8 in order from front to rear. If the first two items are deleted, which element does the rear marker point to?

• 2

• 3

• 5

• 8