Delete one edge from each graph to obitan 2 new graph.

How many cut edges in total of the new graph?

How many companisons are needed in order to locate the word “lemon” in the binary search tree of the
list mang, banana, apple, pear, coconut, strawberry, lemon?

3
Find the least number of vertices of a full 3 ary tree of height 3

10

What is the minimum number of vertices of a simple graph with 20 edges

5
Which of the following graphs have euler circuits ?

i.K

ii.C20

iii.W

i,ii,iii

which graph has cut vertices?

Y
Using Prim’s algorithm to find a minimal spanning tree. What is the list of edges chosen?

CE,BC,AB,BD,DZ

Find the least number of a balanced full binary tree of height 10.

513
How many connected components in the graph?

Find the length of the shorstest path from A to Z

9
What is the position of the letter f when using the postorder traversal?

10

The number of edges in a graph with 7 vertices, 2 of degree 4, 1 of degree 2 and 4 of degree 1, is______

7
Given two undirected graphs with adjacency matrices

Which graphs have euler cicuits

Fill in the blanks:

The adjacency matrix of the graph____has____1s

C4,8
How many cut verices and cut adges in the graph?

3 and 3

Draw a binary search tree for the sentence ‘the quick brown fox jumps over the lazy dog’

how many comparision are needed to locate the word ‘over’?

6
Which graphs exist?

None of the other choices is correct

How many non-isomorphic trees of 4 vertices?

Find the inorder traversal of the tree

e-c-h-a-n-m-s-t-y

Which of the following graphs has the most number of edges?

iii.K7

Use huffman coding to encode the message “glaciology”.what is the average number of bits required to
encode a charater?

Round your answer to 2 decimal places

D.2.80

Choose the correct statement about the graphs

G has hamilton path and h has a hamilton circuit
Given a prefix code represented by the binary tree.

Decode the message 010111011

Fun

How many internal vertices does a full 4-ary tree with 34 leaves have?

11
For what values of n does the graph Qn have hamilton circuits?

N>1

How many spanning tree does the following graph have?

40
Which graph are tree?

How many non-isomorphic simple graphs with 5 vertices and 3 edges?

4
Using prim’s algorithm to find a minimal spanning tree. What is the list of adges chosen?

CE,BC,AB,EZ,DZ

Apply the Dijkstra algorithm to find the shortest path from A to Z. what are the first three verices
chosen?
A.A,B,E

Which sequence can be the degree sequence of a simple graph?

2,2,3,3,4,4

To encode a message in which there are 9 distinct charaters {a,b,c,d,e,f,g,h,i}, we want to use a coding
scheme where the 8 characters a,b,c,d,e,f,g,h,i

a:000, b:111, c:010, d:011, e:100, f: 101, g:110, h:001

for this coding scheme to be a prefix code, which of the following strings can be used for the character
“I”
D. none

How many path of length 3 from B to A?

13

How many internal vertices in this tree ?

4

A complete bipartite graph with 15 edges has______

8 vertices
Which of the following proposition is true:

iii. if K4,5 has an euler path, then Q3 has a hamilton circuit

For which (m,n) does the graph Km,n have hamilton path but no hamilton circuits?

K3,2

What is the height of the spanning tree obtained from the complete bipartite graph K4,3 by depth-first
search, strarting at a vertex of degree 4?
6

Fin the In fix notation for the expression (x-y)|2+x*(y+5)

C.none
Use huffman coding to encode these symbols with given frequencies

A:0.3 b:0.15 c:0.25 d:0.2 e:0.1

What is the average number of bits required to encode a character?

2.25

There are 4 coins among which there is a conterfeit coin that is either heavier or lighter than the other.
With a balance scale. How many weighings are needed to determine the conterfeit coin?

2
Let g be a simple graph whose vertices are of degree 3. If g has 15 edges. How many vertices does g have

10

Let T be a full m-ary tree of height 4 with 63 leaves. Find m

3
How many internal vertices in a full 3-ary tree with 43 leaves?

21

Given a simple graph g with 8 edges. The complementaru graph of g, denoted by g’. is the graph on the
same vertices. And two vertices are adjacent in g’…… has 2 edges, how many vertices does g have ?

5
For what values of n does the graph W have hamilton circuit?

n>2

Compute the value of the prefix notation

*/15 7 + 1 1 3 + 2 + 1 1

5
How many vertices in a full 3-ary tree with 101 How many cut edges does this graph have?
leaves?
151
Are there two graphs isomorphic? If not, what is How many comperisons are needed in order to
the reason? locate/insert the word “SHARK” in the binary
search tree of the list
{SHE, SELLS, SEA, SHELLS, BY, THE, SEASHORE}

No, they are not isomorphic because they do not

have the same number of connected components
Which graph has NO Euler cirruits? Find the shortest distance between the vertices
…. Following weighted graph

W4 13
How many cut vertices does this graph have? which of the following graphs have euler circuit?
i.K5 iiC20 iiiW….

3 I , ii