computer science quiz

Topological sorting is a linear ordering of vertices such that for every directed edge uv, vertex u comes before v in the ordering. This type of sorting is possible for any type of graph

False

One difference between a queue and a stack is

Queues use two ends of the structure; stacks use only one

Prim's and Kruskal's algorithms will always return the same Minimum Spanning tree

True

The operation for adding a Node to a stack is traditionally called

push

A hash table of size 512 uses separate changing as a hashing method. What is the maximum number of entries that can be placed in the table?

there is no maximum

Which tree traversal visits the left subtree of the current node first, then the current node itself, and finally the right subtree of the current node.

inorder traversal

Given the Node objects p and q, which boolean expression indicates whether the values in the nodes are the same.

p.value == q.value