Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T),then(A) |S| = 2|T|(B) |S| = |T|-1(C) |S| = |T|(D) |S| = |T|+1

Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the n

1.	Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T),then(A) \|S\| = 2\|T\|(B) \|S\| = \|T\|-1(C) \|S\| = \|T\|(D) \|S\| = \|T\|+1
Answer» None

Discussion

No Comment Found

Related InterviewSolutions

Choose the most appropriate word from the options given below to the complete the following sentence:His rather casual remarks on politics ___________ his lack of seriousness about the subject.(A) masked(B) belied(C) betrayed(D) suppressed
Given digits 2, 2, 3, 3, 3, 4, 4, 4, 4 how many distinct 4 digit numbers greater than 3000 can be formed?(A) 50(B) 51(C) 52(D) 54
#include<stdio.h>int f(int *a, int n){if(n <= 0) return 0;else if(*a % 2 == 0) return *a + f(a+1, n-1);else return *a - f(a+1, n-1);}int main(){int a[] = {12, 7, 13, 4, 11, 6};printf("%d", f(a, 6));getchar();return 0;}(A) -9(B) 5(C) 15(D) 19
A computer system has an L1 cache, an L2 cache, and a main memory unit connected as shown below. The blocksize in L1 cache is 4 words. The blocksize in L2 cache is 16 words. The memory access times are 2 nanoseconds. 20 nanoseconds and 200 nanoseconds for L1 cache, L2 cache and main memory unit respectively.When there is a miss in L1 cache and a hit in L2 cache, a block is transferred from L2 cache to L1 cache. What is the time taken for this transfer?(A) 2 nanoseconds(B) 20 nanoseconds(C) 22 nanoseconds(D) 88 nanoseconds
A main memory unit with a capacity of 4 megabytes is built using 1M × 1-bit DRAM chips. Each DRAM chip has 1K rows of cells with 1K cells in each row. The time taken for a single refresh operation is 100 nanoseconds. The time required to perform one refresh operation on all the cells in the memory unit is:-A.100 nanosecondsB.100×210 nanosecondsC.100×220 nanosecondsD.3200×220 nanoseconds(A) A(B) B(C) C(D) D
Which data structure in a compiler is used for managing information about variables and their attributes?(A) Abstract syntax tree(B) Symbol table(C) Semantic stack(D) Parse Table
P is a 16-bit signed integer. The 2’s complement representation of P is (F87B)16.The 2’s complement representation of 8*P(A) (C3D8)16(B) (187B)16(C) (F878)16(D) (987B)16
Let w be any string of length n is {0,1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?(A) n-1(B) n(C) n+1(D) 2n-1
Which of the following concurrency control protocols ensure both conflict serialzability and freedom from deadlock?I. 2-phase lockingII. Time-stamp ordering(A) I only(B) II only(C) Both I and II(D) Neither I nor II
Suppose the predicate F(x, y, t) is used to represent the statement that person x can fool person y at time t. which one of the statements below expresses best the meaning of the formula ∀x∃y∃t(¬F(x, y, t))?(A) Everyone can fool some person at some time(B) No one can fool everyone all the time(C) Everyone cannot fool some person all the time(D) No one can fool some person at some time

Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T),then(A) |S| = 2|T|(B) |S| = |T|-1(C) |S| = |T|(D) |S| = |T|+1

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment