The longest common subsequence of the sequences X=<A, B, C, B, D, A, B> and Y=<B, D, C, A, B, A> has length (A) 2 (B) 3 (C) 4 (D) 5

The longest common subsequence of the sequences X= and Y= has length (A) 2 (B) 3 (C) 4 (D) 5

by

1 Answer

Answer :

(C) 4
by

Related questions

Given two sequences X and Y: X = <a, b, c, b, d, a, b> Y = <b, d, c, a, b, a> The longest common subsequence of X and Y is: (A) <b, c, a> (B) <c, a, b> (C) <b, c, a, a> (D) <b, c, b, a>

Description : Given two sequences X and Y: X = Y = The longest common subsequence of X and Y is: (A) (B) (C) (D)

Last Answer : Answer: D Explanation: A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. A sequence G is said to be a ... common subsequences to both X and Y. However, the longest common subsequence of X and Y is 

Can you arrange the numbers from 1 to 100 so there is no ascending or descending subsequence of length greater than 10?

Description : Can you arrange the numbers from 1 to 100 so there is no ascending or descending subsequence of length greater than 10?

Last Answer : I’m not sure if I’m misunderstanding your question. Why not just arrange them in 5 number sequences from the beginning and the end of the numbers. 1–5 95–100 6–11 89–94 etc

Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, 259, 363, 364 (B) 3, 400, 388, 220, 267, 383, 382, 279, 364 (C) 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364

Description : Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, ... 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364 

Last Answer : (C) 926, 203, 912, 241, 913, 246, 364

A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A[0][0][0]+w(y*z*p+z*q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Description : A three dimensional array in C' is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer): (A) &A[0][0][0]+w(y*z*q+z*p+r) (B) &A ... *q+r) (C) &A[0][0][0]+w(x*y*p+z*q+r) (D) &A[0][0][0]+w(x*y*q+z*p+r)

Last Answer : Answer: B

Compound "X" undergoes the following sequences of reactions to form "Y" compound "Y"is -

Description : Compound "X" undergoes the following sequences of reactions to form "Y" compound "Y"is -

Last Answer : Compound "X" undergoes the following sequences of reactions to form "Y" compound "Y"is - A. B. C. D.

The coding sequences in lac operon include (A) i gene (B) i gene, operator locus and promoter (C) z, y and a genes (D) i, z, y and a genes

Description : The coding sequences in lac operon include (A) i gene (B) i gene, operator locus and promoter (C) z, y and a genes (D) i, z, y and a genes

Last Answer : Answer : D

How many times does the following code segment execute int x=1, y=10, z=1; do{y--; x++; y-=2; y=z; z++} while (y>1 && z<10); A) 1 B) 10 C) 5 D) infinite

Description : How many times does the following code segment execute int x=1, y=10, z=1; do{y--; x++; y-=2; y=z; z++} while (y>1 && z

Last Answer : A) 1

The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is (A) (W' + X') (Y' + Z') (X' + Z) (B) (W' + X') (Y' + Z') (X' + Z') (C) (W' + X') (Y' + Z) (X' + Z) (D) (W' + X') (Y + Z') (X' + Z)

Description : The simplified function in product of sums of Boolean function F(W, X, Y, Z) = Σ(0, 1, 2, 5, 8, 9, 10) is (A) (W' + X') (Y' + Z') (X' + Z) (B) (W' + X') (Y' + Z') (X' + Z') (C) (W' + X') (Y' + Z) (X' + Z) (D) (W' + X') (Y + Z') (X' + Z)

Last Answer : (A) (W' + X') (Y' + Z') (X' + Z)

The correct way to round off a floating number x to an integer value is (A) y = (int)(x+0.5) (B) y = int(x+0.5) (C) y = (int)x+0.5 (D) y = (int)((int)x+0.5)

Description : The correct way to round off a floating number x to an integer value is (A) y = (int)(x+0.5) (B) y = int(x+0.5) (C) y = (int)x+0.5 (D) y = (int)((int)x+0.5)

Last Answer : (A) y = (int)(x+0.5)

Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and (4, 5), if clipped against this window will connect the points (A) (0, 1) and (2, 3) (B) (0, 1) and (3, 3) (C) (0, 1) and (4, 3) (D) (0, 1) and (3, 2)

Description : Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and (4, 5), if clipped against this window will connect the points (A) (0, 1) and (2, 3) (B) (0, 1) and (3, 3) (C) (0, 1) and (4, 3) (D) (0, 1) and (3, 2)

Last Answer : (A) (0, 1) and (2, 3)

Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), (6,1), (11,0.3)} (B) {(2,0.6), (3,1), (6,1), (11,0.3)} (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Description : Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), ... 6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Last Answer : (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)}

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

Assume that variable x resides at memory location 1234, y at 1111 and p at 2222. Int x=1, y=2, *p; p=&x; y=*p; What will be the value of y after execution of above code? A) 2 B) 1 C) 1234 D) 1111

Description : Assume that variable x resides at memory location 1234, y at 1111 and p at 2222. Int x=1, y=2, *p; p=&x; y=*p; What will be the value of y after execution of above code? A) 2 B) 1 C) 1234 D) 1111

Last Answer : C) 1234

Reflexivity property says that X Y is true if Y is …………………. A) Subset of X B) Null set of X C) Super set of Y D) Subset of Y

Description : Reflexivity property says that X Y is true if Y is …………………. A) Subset of X B) Null set of X C) Super set of Y D) Subset of Y

Last Answer : A) Subset of X

If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Description : If we convert ∃u ∀v ∀x ∃y (P(f(u),v, x, y) → Q(u,v,y)) to ∀v ∀x (P(f(a),v, x, g(v,x)) → Q(a,v,g(v,x))) This process is known as (A) Simplification (B) Unification (C) Skolemization (D) Resolution

Last Answer : (C) Skolemization

If f(x, y) is a digital image, then x, y and amplitude values of f are (A) Finite (B) Infinite (C) Neither finite nor infinite (D) None of the above

Description : If f(x, y) is a digital image, then x, y and amplitude values of f are (A) Finite (B) Infinite (C) Neither finite nor infinite (D) None of the above

Last Answer : (A) Finite

In homogenous coordinate system (x, y, z) the points with z = 0 are called (A) Cartesian points (B) Parallel points (C) Origin point (D) Point at infinity

Description : In homogenous coordinate system (x, y, z) the points with z = 0 are called (A) Cartesian points (B) Parallel points (C) Origin point (D) Point at infinity

Last Answer : (D) Point at infinity

A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true

Description : A Boolean operator Ө is defined as follows: 1Ө1=1, 1Ө0=0, 0Ө1=0 and 0Ө0=1 What will be the truth value of the expression (xӨy)Өz = xӨ(yӨz)? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true

Last Answer : (B) Always true

When the following code is executed what will be the value of x and y? int x = 1, y=0; y = x++; (A) 2, 1 (B) 2, 2 (C) 1, 1 (D) 1, 2

Description : When the following code is executed what will be the value of x and y? int x = 1, y=0; y = x++; (A) 2, 1 (B) 2, 2 (C) 1, 1 (D) 1, 2

Last Answer : (A) 2, 1

What will be the output of the following logic diagram? (A) x OR y (B) x AND y (C) x NOR y (D) x XNOR y

Description : What will be the output of the following logic diagram?  (A) x OR y (B) x AND y (C) x NOR y (D) x XNOR y

Last Answer : (C) x NOR y

The sum of products expansion for the function F(x, y, z) = (x + y)z’ is given as (A) x’y’z + xyz’ + x’yz’ (B) xyz + xyz’ + xy’z’ (C) xy’z’ + x’y’z’ + xyz’ (D) xyz’ + xy’z’ + x’yz’

Description : The sum of products expansion for the function F(x, y, z) = (x + y)z’ is given as (A) x’y’z + xyz’ + x’yz’ (B) xyz + xyz’ + xy’z’ (C) xy’z’ + x’y’z’ + xyz’ (D) xyz’ + xy’z’ + x’yz’

Last Answer : (D) xyz’ + xy’z’ + x’yz’ Explanation: Use Boolean identities to expand the product and simplify. F(x, y, z)=(x + y)z’  =xz’+yz’ Distributive law  =x1z’+1yz’ Identity law  =x(y+y’)z’+(x+x’)yz’ Unit property =xyz’+xy’z’+xyz’+x’yz’ Distributive law  =xyz’+xy’z’+x’yz’ Idempotent law 

For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Description : For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page ... fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Last Answer : (C) √2xz 

Consider a full-adder with the following input values: (a) x=1, y=0 and Ci(carry input) = 0 (b) x=0, y=1 and Ci = 1 Compute the values of S(sum) and C0 (carry output) for the above input values. (A) S=1 , C0= 0 and S=0 , C0= 1 (B) S=0 , C0= 0 and S=1 , C0= 1 (C) S=1 , C0= 1 and S=0 , C0= 0 (D) S=0 , C0= 1 and S=1 , C0= 0

Description : Consider a full-adder with the following input values: (a) x=1, y=0 and Ci(carry input) = 0 (b) x=0, y=1 and Ci = 1 Compute the values of S(sum) and C0 (carry output) for the above input values. (A) S=1 , C0= 0 and ... C0= 1 (C) S=1 , C0= 1 and S=0 , C0= 0 (D) S=0 , C0= 1 and S=1 , C0= 0

Last Answer : (A) S=1 , C0= 0 and S=0 , C0= 1

The end points of a given line are (0, 0) and (6, 18). Compute each value of y as x steps from 0 to 3, by using equation of straight line : (A) For x=0, y=0; x=1, y=3; x=2, y=6; x=3, y=9 (B) For x=0, y=1; x=1, y=3; x=2, y=4; x=3, y=9 (C) For x=0, y=2; x=1, y=3; x=2, y=6; x=3, y=9 (D) For x=0, y=0; x=1, y=3; x=2, y=4; x=3, y=6

Description : The end points of a given line are (0, 0) and (6, 18). Compute each value of y as x steps from 0 to 3, by using equation of straight line : (A) For x=0, y=0; x=1, y=3; x=2, y=6; x=3, y=9 (B) For x=0, y=1; x=1, y=3; x=2, ... x=1, y=3; x=2, y=6; x=3, y=9 (D) For x=0, y=0; x=1, y=3; x=2, y=4; x=3, y=6

Last Answer : Answer: A

There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state. (A) 64 (B) 256 (C) 1024 (D) 5832

Description : There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state. (A) 64 (B) 256 (C) 1024 (D) 5832

Last Answer : Answer: D

How many solutions are there for the equation x+y+z+u=29 subject to the constraints that x≥1, y≥2, z≥3 and u≥0? (A) 4960 (B) 2600 (C) 23751 (D) 8855

Description : How many solutions are there for the equation x+y+z+u=29 subject to the constraints that x≥1, y≥2, z≥3 and u≥0? (A) 4960 (B) 2600 (C) 23751 (D) 8855

Last Answer : (B) 2600

In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp. Image It shows which of the following depth first forest? (A) {a,b,e} {c,d,f,g,h} (B) {a,b,e} {c,d,h} {f,g} (C) {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Description : In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.  It shows which of the following depth first forest? (A ... {a,b,e} {f,g} {c,d} {h} (D) {a,b,c,d} {e,f,g} {h}

Last Answer : Answer: A

Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x knowing y; and I(x;y) is the information transmission. Which of the following does not define the channel capacity of a discrete memoryless channel?

Description : Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty ... (H(x) - H(x|y))]  p(x) (D) max H(x|y)  p(x)

Last Answer : (D) max H(x|y)   p(x)

Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further, Shx and Shy are shearing factors in x and y directions. If we perform the y-direction shear relative to x=xref then the transformed point is given by ............

Description : Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further, Shx and Shy are shearing factors in x and y directions. If we perform the y-direction shear relative to x=xref then the transformed point is given by ............ 

Last Answer : (C) x’ = x y’ = Shy(x - xref) + y

Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d<0, then d=4x+6 and x=x+1 (4) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Description : Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d

Last Answer : If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Consider following schedules involving two transactions: S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X) S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X) Which of the following statement is true? (1) Both S1 and S2 are conflict serializable. (2) S1 is conflict serializable and S2 is not conflict serializable. (3) S1 is not conflict serializable and S2 is conflict serializable. (4) Both S1 and S2 are not conflict serializable.

Description : Consider following schedules involving two transactions: S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X) S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X) Which of the following ... . (3) S1 is not conflict serializable and S2 is conflict serializable. (4) Both S1 and S2 are not conflict serializable.

Last Answer : S1 is not conflict serializable and S2 is conflict serializable.

Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is (A) 5 (B) 10 (C) 8 (D) 9

Description : Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is (A) 5 (B) 10 (C) 8 (D) 9

Last Answer : Answer: Marks to all

The product ("X") of the following sequences of reactions is

Description : The product ("X") of the following sequences of reactions is

Last Answer : The product ("X") of the following sequences of reactions is A. B. C. D.

What is the difference between length() and length?

Description : What is the difference between length() and length?

Last Answer : A: length() function is used to find the number of characters present in a String, whereas, length keyword is used to find the number if cells in an array.

Which of the following methods belong to the string class? A) length( ) B) compare To ( ) C) equals ( ) D) All of them

Description : Which of the following methods belong to the string class? A) length( ) B) compare To ( ) C) equals ( ) D) All of them

Last Answer : D) All of them

Which of the following methods belong to the string class? A) length( ) B) compare To ( ) C) equals ( ) D) All of them

Description : Which of the following methods belong to the string class? A) length( ) B) compare To ( ) C) equals ( ) D) All of them

Last Answer : D) All of them

The …………….. policy segments the disks request queue into sub queues of the length N. A) SCAN B) C-SCAN C) N-Step SCAN D) FSCAN

Description : The …………….. policy segments the disks request queue into sub queues of the length N. A) SCAN B) C-SCAN C) N-Step SCAN D) FSCAN

Last Answer : C) N-Step SCAN

A simple cabling method, known as the ……………… topology allows about 30 computers on a maximum cable length of about 600 feet. A) Ring B) Bus C) Star D) Mesh

Description : A simple cabling method, known as the ……………… topology allows about 30 computers on a maximum cable length of about 600 feet. A) Ring B) Bus C) Star D) Mesh

Last Answer : B) Bus

………………….. implies that all subnets obtained from the same subnet mask. A) Static subnetting B) Dynamic subnetting C) Variable length subnetting D) Both B and C

Description : ………………….. implies that all subnets obtained from the same subnet mask. A) Static subnetting B) Dynamic subnetting C) Variable length subnetting D) Both B and C

Last Answer : A) Static subnetting

........ implies that all subnets obtained from the same network use the subnet mask. A) Static subnetting B) Dynamic Subnetting C) Variable length subnetting D) Both B and C

Description : ........ implies that all subnets obtained from the same network use the subnet mask. A) Static subnetting B) Dynamic Subnetting C) Variable length subnetting D) Both B and C

Last Answer : A) Static subnetting

A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table: using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits

Description : A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table:  using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits

Last Answer : (D) 2,24,000 bits 

While estimating the cost of software, Lines of Code (LOC) and Function Points (FP) are used to measure which one of the following? (A) Length of code (B) Size of software (C) Functionality of software (D) None of the above

Description : While estimating the cost of software, Lines of Code (LOC) and Function Points (FP) are used to measure which one of the following? (A) Length of code (B) Size of software (C) Functionality of software (D) None of the above

Last Answer : (B) Size of software

What is the size of the 'total length' field in IPv 4 datagram ? (A) 4 bits (B) 8 bits (C) 16 bits (D) 32 bits

Description : What is the size of the 'total length' field in IPv 4 datagram ? (A) 4 bits (B) 8 bits (C) 16 bits (D) 32 bits

Last Answer : (C) 16 bits 

Which of the following is used for the boundary representation of an image object? (A) Quad Tree (B) Projections (C) Run length coding (D) Chain codes

Description : Which of the following is used for the boundary representation of an image object? (A) Quad Tree (B) Projections (C) Run length coding (D) Chain codes

Last Answer : (D) Chain codes

The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Description : The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12

Last Answer : (D) 12

The IEEE-754 double-precision format to represent floating point numbers, has a length of ........... bits. (A) 16 (B) 32 (C) 48 (D) 64

Description : The IEEE-754 double-precision format to represent floating point numbers, has a length of ........... bits. (A) 16 (B) 32 (C) 48 (D) 64

Last Answer : (D) 64

The number of strings of length 4 that are generated by the regular expression (0+1 +|2+3 + )*, where | is an alternation character and {+, *} are quantification characters, is: (A) 08 (B) 09 (C) 10 (D) 12

Description : The number of strings of length 4 that are generated by the regular expression (0+1 +|2+3 + )*, where | is an alternation character and {+, *} are quantification characters, is: (A) 08 (B) 09 (C) 10 (D) 12

Last Answer : (C) 10

What is the probability that a randomly selected bit string of length 10 is a palindrome? (A) 1/64 (B) 1/32 (C) 1/8 (D) ¼

Description : What is the probability that a randomly selected bit string of length 10 is a palindrome? (A) 1/64 (B) 1/32 (C) 1/8 (D) ¼

Last Answer : (B) 1/32

Which of the following are not regular? (A) Strings of even number of a’s. (B) Strings of a’s, whose length is a prime number. (C) Set of all palindromes made up of a’s and b’s. (D) Strings of a’s whose length is a perfect square. (1) (A) and (B) only (2) (A), (B) and (C) only (3) (B), (C) and (D) only (4) (B) and (D) only

Description : Which of the following are not regular? (A) Strings of even number of a's. (B) Strings of a's, whose length is a prime number. (C) Set of all palindromes made up of a's and b's. (D) Strings of a's whose length is a ... ) (A), (B) and (C) only (3) (B), (C) and (D) only (4) (B) and (D) only

Last Answer : (B), (C) and (D) only

The maximum size of the data that the application layer can pass on to the TCP layer below is ......... (1) 216 bytes (2) 216 bytes + TCP header length (3) 216 bytes - TCP header length (4) 215 bytes

Description : The maximum size of the data that the application layer can pass on to the TCP layer below is ......... (1) 216 bytes (2) 216 bytes + TCP header length (3) 216 bytes - TCP header length (4) 215 bytes

Last Answer : Answer: Marks to all