Hey..!!

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudo code below is invoked as height(root) to compute the height of a binary tree ro

What are the number of edges in a tree with number of vertices x

The line graph L(G) of a simple graph G is defined as follows: · There is exactly one vertex v(e) in L(G) for each edge e in G.· For any two edges e and e' in G, L(G) has an edge between v(e) and

Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three

What is the number of vertices of degree 2 in a path graph having n vertices,here n>2

The number of triangles whose vertices are at the vertices of an octagon but none of whose sides happen to come from the sides of the octagon is

What is the number of triangles that can be formed whose vertices are the vertices of an octagon but have only one side common with that of octagon

The top of a broken tree touches the ground at a distance of 15 m from its base. If the tree is broken at a height of 8 m from the ground, then the actual height of the tree is (mtr.)

After applying the below operations on a input sequence, what happens i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queu

Related Quizes

Quizes