Blog

A matrix organizational structure is a combination of what (2) types structures?

Beginning with an empty Binary Search Tree, insert the following keys into the tree: A, C, X, J, N, T, E Give post-order of the resulting tree

Beginning with an empty Binary Search Tree, insert the following keys into the tree: A, C, X, J, N, T, E Give post-order of the resulting tree

How many cells are used to represent a graph with n vertices and m edges, when using an adjacency matrix representation.

What is the output of the following program? [First] [Second] [Third]

Using the following recursive function, what does fun(100, 1) return?

Which of the following operation is not efficient for a singly linked list?

You are given the following undirected graph. [Breadth] List the vertices in Breadth-first Search starting at vertex A: [Depth] List the vertices in Depth-first Search starting at vertex A:

Enter the characters below in the order they are listed into an initially empty Binary Search Tree. How many comparisons are needed to locate the letter “T”? I         P         M         H         N         V         T         C         D         E

Consider the following graph. Assume the adjacency lists are in sorted order: explore 0-1 before 0-6 or 0-7 (numerical order). Perform breadth-first traversal on the graph below.