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>

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>
by

1 Answer

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 subsequence of X and Y, if Z is a subsequence of both X and Y. Here X =< a, b, c, b, d, a, b>, the sequences , , are subsequences of X. Given a second sequence of symbols Y = , then , ,< b,c,b,a> are common subsequences to both X and Y. However, the longest common subsequence of X and Y is 

by

Related questions

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

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

Last Answer : (C) 4

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

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

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 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 

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)}

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

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

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

Given a Pandas series called Sequences, the command which will display the first 4 rows is .... (a) print(Sequences.head(4)) -Technology

Description : Given a Pandas series called Sequences, the command which will display the first 4 rows is .... (a) print(Sequences.head(4)) -Technology

Last Answer : (a) print(Sequences.head(4))

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)} 

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.

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

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

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)

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 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)

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

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

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

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)

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.

Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Description : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Last Answer :  (D) m + n – 1

Let R and S be two fuzzy relations defined as: Image Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Description : Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Last Answer : (A) 6x + 7, 6x + 11 Explanation: fog(x)=f(g(x))=f(3x+2)=2(3x+2)+3=6x+7 gof(x)=g(f(x))=g(2x+3)=3(2x+3)+2=6x+11

Big - O estimate for f(x) = (x + 1) log(x2 + 1) + 3x2 is given as (A) O(xlogx) (B) O(x2) (C) O(x3) (D) O(x2logx)

Description : Big - O estimate for f(x) = (x + 1) log(x2 + 1) + 3x2 is given as (A) O(xlogx) (B) O(x2) (C) O(x3) (D) O(x2logx)

Last Answer : (B) O(x2)

Given that (292)10 = (1204)x in some number system x. The base x of that number system is (A) 2 (B) 8 (C) 10 (D) None of the above

Description : Given that (292)10 = (1204)x in some number system x. The base x of that number system is (A) 2 (B) 8 (C) 10 (D) None of the above

Last Answer : (D) None of the above Explanation: 6|292 6|48| 4 6|8| 0 6|1| 2 6|1| 1 Solution: (1204)6 So here, x=6

Given that x=7.5, j=-1.0, n=1.0, m=2.0 the value of --x+j == x>n>=m is: (A) 0 (B) 1 (C) 2 (D) 3

Description : Given that x=7.5, j=-1.0, n=1.0, m=2.0 the value of --x+j == x>n>=m is: (A) 0 (B) 1 (C) 2 (D) 3

Last Answer : (A) 0 

The sum of the seek time, and the rotational delay is called the ……………….. A) reached time B) access time C) arrived time D) common time

Description : The sum of the seek time, and the rotational delay is called the ……………….. A) reached time B) access time C) arrived time D) common time

Last Answer : B) access time

…………………. is a group of interested components working together towards a common goal by accepting inputs and producing outputs in an organized transformation process. A) System B) Network C) Team D) System Unit

Description : …………………. is a group of interested components working together towards a common goal by accepting inputs and producing outputs in an organized transformation process. A) System B) Network C) Team D) System Unit

Last Answer : A) System

In ……………………. mode, a common technique in packet-switched networks consists of wrapping a packet in a new one. A) Tunneling B) Encapsulation C) Both A and B D) None of the above

Description : In ……………………. mode, a common technique in packet-switched networks consists of wrapping a packet in a new one. A) Tunneling B) Encapsulation C) Both A and B D) None of the above

Last Answer : C) Both A and B

The most important and common protocols associated TCP/IP internetwork layer are. i) Internet protocol(IP) ii) Internet control Message Protocol(ICMP) iii) Bootstrap Protocol (BooTP) iv) Dynamic Host Configuration Protocol (DHCP) v) Address Resolution Protocol (ARP) A) i, ii, iii and iv only B) i, iii, iv and v only C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Description : The most important and common protocols associated TCP/IP internetwork layer are. i) Internet protocol(IP) ii) Internet control Message Protocol(ICMP) iii) Bootstrap Protocol (BooTP) iv) Dynamic Host Configuration Protocol (DHCP) v) ... C) ii, iii, iv and v only D) All i, ii, iii, iv and v

Last Answer : D) All i, ii, iii, iv and v

The most important and common protocols associated TCP/IP internetwork layer are. i) Internet Protocol (IP) ii) Internet Control Message Protocol (ICMP) iii) Bootstrap Protocol (BOOTP) iv) Dynamic Host Configuration Protocol (DHCP) V) Address Resolution Protocol (ARP) A) i, ii, iii, and iv only B) ii, iii, iv and v only C) i, iii, iv and v only D) All i, ii, iii, iv and v only

Description : The most important and common protocols associated TCP/IP internetwork layer are. i) Internet Protocol (IP) ii) Internet Control Message Protocol (ICMP) iii) Bootstrap Protocol (BOOTP) iv) Dynamic Host Configuration Protocol (DHCP) V) ... C) i, iii, iv and v only D) All i, ii, iii, iv and v only

Last Answer : D) All i, ii, iii, iv and v only

All of the following statements about eukaryotic promoters are true except (A) They may be located upstream or down stream from the structural gene (B) They have two consensus sequences (C) One consensus sequence binds RNA polymerase (D) Mutations in promoter region can decrease the efficiency of transcription of the structural gene

Description : All of the following statements about eukaryotic promoters are true except (A) They may be located upstream or down stream from the structural gene (B) They have two consensus sequences ( ... (D) Mutations in promoter region can decrease the efficiency of transcription of the structural gene

Last Answer : Answer : A

All of the following statements about bacterial promoters are true except (A) They are smaller than eukaryotic promoters (B) They have two consensus sequences upstream from the transcription star site (C) TATA box is the site for attachment of RNA polymerase (D) TATA box has a high melting temperature

Description : All of the following statements about bacterial promoters are true except (A) They are smaller than eukaryotic promoters (B) They have two consensus sequences upstream from the transcription star site (C) ... is the site for attachment of RNA polymerase (D) TATA box has a high melting temperature

Last Answer : Answer : D

Introns in genes (A) Encode the amino acids which are removed during post-translational modification (B) Encode signal sequences which are removed before secretion of the proteins (C) Are the non-coding sequences which are not translated (D) Are the sequences that intervene between two genes

Description : Introns in genes (A) Encode the amino acids which are removed during post-translational modification (B) Encode signal sequences which are removed before secretion of the proteins (C) Are the non-coding sequences which are not translated (D) Are the sequences that intervene between two genes

Last Answer : Answer : C

How are sequences of memories stored in the brain?

Description : How are sequences of memories stored in the brain?

Last Answer : I don’t think the current state of our science of the brain/mind can explain that yet…

How many triangles will there be after n number of sequences?

Description : How many triangles will there be after n number of sequences?

Last Answer : I drew two more iterations of the pattern and added 9, then 12 more triangles. Your first two drawings showed 3 then 6. So the first 4 iterations go 3, 6, 9, 12 if that continues, it seems the pattern ... , 19, 31 and you'll have to give me a moment to come up with the formula for that sequence.

How do you memorise short numerical sequences?

Description : How do you memorise short numerical sequences?

Last Answer : We had the same when I worked at an Apple Premium Reseller, for example 24690 was a iPod Usb Cable. The way I learned them all was that we had written them down on small labels on the register. It took time, but i learned the most important ones eventually.