Discrete Mathematics Practice Test 9

1. What is the postfix expression of (A+B)-C*(D/E))+F?

2. Determine the density of a planar graph with 34 edges and 13 nodes.

3. Use Karnaugh map to find the simplified expression of the function: F = x’yz + xy + xy'z'.

4. Worst case complexity of Breadth First Search traversal __________

5. How many edges are there in a complete graph of order 9?

6. Prim’s algorithm can be implemented using _______

7. Which of the following can be embedded in an algebraically closed group?

8. If minimum cost edge of a graph is unique, then that edge will be added to any MST. Choose the correct option.

9. For an n-vertex undirected graph, the time required to find a cycle is ____________

10. Let G(V, E) be a directed graph where every edge has weight as either 1, 2 or 5, what is the algorithm used for the shortest path from a given source vertex to a given destination vertex to get the time complexity of O(V+E)?