Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be: (1) (1+x) is factor of G(x) (2) (1-x) is factor of G(x) (3) (1+x2) is factor of G(x) (4) x is factor of G(x)

Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be: (1) (1+x) is factor of G(x) (2) (1-x) is factor of G(x) (3) (1+x2) is factor of G(x) (4) x is factor of G(x)
by

1 Answer

Answer :

(1+x) is factor of G(x)
by

Related questions

Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error? a. G(x) contains more than two terms b. G(x) does not divide 1+x^k, for any k not exceeding the frame length c. 1+x is a factor of G(x) d. G(x) has an odd number of terms

Description : Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error? a. G(x) contains more than two terms b. G(x) does ... exceeding the frame length c. 1+x is a factor of G(x) d. G(x) has an odd number of terms

Last Answer : c. 1+x is a factor of G(x)

_______ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits. a. Hamming Code b. CRC c. VRC d. None of the above

Description : _______ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits. a. Hamming Code b. CRC c. VRC d. None of the above

Last Answer : b. CRC

The message 11001001 is to be transmitted using the CRC polynomial x3+1 to protect it from errors. The message that should be transmitted is (A) 110010011001 (B) 11001001 (C) 110010011001001 (D) 11001001011

Description : The message 11001001 is to be transmitted using the CRC polynomial x3+1 to protect it from errors. The message that should be transmitted is (A) 110010011001 (B) 11001001 (C) 110010011001001 (D) 11001001011

Last Answer : (D) 11001001011

Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2

Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2

Last Answer : (2) t 

If the frame to be transmitted is 1101011011 and the CRC polynomial to be used for generating checksum is x 4+ x + 1, then what is the transmitted frame? a. 11010110111011 b. 11010110111101 c. 11010110111110 d. 11010110111001

Description : If the frame to be transmitted is 1101011011 and the CRC polynomial to be used for generating checksum is x 4+ x + 1, then what is the transmitted frame? a. 11010110111011 b. 11010110111101 c. 11010110111110 d. 11010110111001

Last Answer : c. 11010110111110

The message 11001001 is to be transmitted using the CRC polynomial x^3 + 1 to protect it from errors. The message that should be transmitted is: a. 11001001000 b. 11001001011 c. 11001010 d. 110010010011

Description : The message 11001001 is to be transmitted using the CRC polynomial x^3 + 1 to protect it from errors. The message that should be transmitted is: a. 11001001000 b. 11001001011 c. 11001010 d. 110010010011

Last Answer : b. 11001001011

Using factor theorem, factorise the polynomial x3 + x2 - 4x - 4. -Maths 9th

Description : Using factor theorem, factorise the polynomial x3 + x2 - 4x - 4. -Maths 9th

Last Answer : Solution :-

Can you Factor the polynomial x2-xy-132y2?

Description : Can you Factor the polynomial x2-xy-132y2?

Last Answer : (x + 11y)(x - 12y)

FOR WHAT VALUE OF K, THE POLYNOMIAL X2+(4-K)X+2 IS DIVISIBLE BY X-2 -Maths 9th

Description : FOR WHAT VALUE OF K, THE POLYNOMIAL X2+(4-K)X+2 IS DIVISIBLE BY X-2 -Maths 9th

Last Answer : As the given polynomial divisible by x-2 means the polynomial satisfies for the value x=2 So putting x=2 in x²+(4-k)x+2 yields 0 ⇒2²+(4-k)2+2=0 ⇒4+8-2k+2=0 ⇒ 2k=14 ⇒ k= ... ;-3x+2 if factorized yields (x-1)(x-2). Thus is divisible by x-2 as well as divisible by x-1.

FOR WHAT VALUE OF K, THE POLYNOMIAL X2+(4-K)X+2 IS DIVISIBLE BY X-2 -Maths 9th

Description : FOR WHAT VALUE OF K, THE POLYNOMIAL X2+(4-K)X+2 IS DIVISIBLE BY X-2 -Maths 9th

Last Answer : The value of 'k' is 4

If the sum of the zeroes of the polynomial p(x) = (k2 – 14) x2 – 2x – 12 is 1, then find the value of k. -Maths 9th

Description : If the sum of the zeroes of the polynomial p(x) = (k2 – 14) x2 – 2x – 12 is 1, then find the value of k. -Maths 9th

Last Answer : p(x) = (k2 – 14) x2 – 2x – 12 Here a = k2 – 14, b = -2, c = -12 Sum of the zeroes, (α + β) = 1 …[Given] ⇒ − = 1 ⇒ −(−2)2−14 = 1 ⇒ k2 – 14 = 2 ⇒ k2 = 16 ⇒ k = ±4

Find the polynomial of least degree which should be subtracted from the polynomial x4 + 2x3 – 4x2 + 6x – 3 so that it is exactly divisible by x2 – x + 1. -Maths 10th

Description : Find the polynomial of least degree which should be subtracted from the polynomial x4 + 2x3 – 4x2 + 6x – 3 so that it is exactly divisible by x2 – x + 1. -Maths 10th

Last Answer : Here, p(x) = x4 + 2x3 - 4x2 + 6x - 3, g(x) = x2 - x +1 On dividing p(x) by g(x) Therefore (x-1) must be subtracted from the polynomial p(x) to make it divisible by g(x).

The start and stop bits are used in serial communication for (A) error detection (B) error correction (C) synchronization (D) slowing down the communication

Description : The start and stop bits are used in serial communication for (A) error detection (B) error correction (C) synchronization (D) slowing down the communication

Last Answer : (C) synchronization 

Let g(x) = 2x and h(x) = x2 + 4. Evaluate (h ∘ g)(−5)?

Description : Let g(x) = 2x and h(x) = x2 + 4. Evaluate (h ∘ g)(−5)?

Last Answer : 104

The original ASCII code used…bits of each byte, reserving that last bit for error checking a. 5 b. 6 c. 7 d. 8

Description : The original ASCII code used…bits of each byte, reserving that last bit for error checking a. 5 b. 6 c. 7 d. 8

Last Answer : c. 7

The original ASCII code used…bits of each byte, reserving that last bit for error checking a. 5 b. 6 c. 7 d. 8

Description : The original ASCII code used…bits of each byte, reserving that last bit for error checking a. 5 b. 6 c. 7 d. 8

Last Answer : c. 7

In CRC based design, a CRC Team consists of : (a) one or two users representatives (b) several programmers (c) project co-ordinators (d) one or two system analysts

Description : In CRC based design, a CRC Team consists of : (a) one or two users representatives (b) several programmers (c) project co-ordinators (d) one or two system analysts Codes : (A) (a) and (c) (B) (a), (b), (c) and (d) (C) (a), (c) and (d) (D) (a), (b) and (d)

Last Answer : Answer: C

. In cyclic redundancy checking, the divisor is _______the CRC. A) The same size as B) one bit less than C) one bit more than D) none of the above

Description : . In cyclic redundancy checking, the divisor is _______the CRC. A) The same size as B) one bit less than C) one bit more than D) none of the above

Last Answer : one bit more than

Which one of the following is not a definition of error ? (A) It refers to the discrepancy between a computed, observed or measured value and the true, specified or theoretically correct value. (B) It refers to the actual output of a software and the correct output. (C) It refers to a condition that causes a system to fail. (D) It refers to human action that results in software containing a defect or fault.

Description : Which one of the following is not a definition of error ? (A) It refers to the discrepancy between a computed, observed or measured value and the true, specified or theoretically correct value. (B) It ... to fail. (D) It refers to human action that results in software containing a defect or fault. 

Last Answer : The input, or clock pulse.

Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. a. t + 1 b. t c. t - 2 d. t / 2

Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. a. t + 1 b. t c. t - 2 d. t / 2

Last Answer : b. t

If α, β are the zeroes of the polynomial x2 – 16, then αβ(α + β) is (a) 0 (b) 4 (c) -4 (d) 16

Description : If α, β are the zeroes of the polynomial x2 – 16, then αβ(α + β) is (a) 0 (b) 4 (c) -4 (d) 16

Last Answer : (a) 0

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 

Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Description : Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Last Answer : (C) 76/30

A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Description : A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes ... (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Last Answer : C

Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct? (A) θ(f(n) * g(n)) = min(f(n), g(n)) (B) θ(f(n) * g(n)) = max(f(n), g(n)) (C) θ(f(n) + g(n)) = min(f(n), g(n)) (D) θ(f(n) + g(n)) = max(f(n), g(n))

Description : Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct? (A) θ(f(n) * g(n)) = min(f(n), g(n)) (B) θ(f(n) * g(n)) = max(f(n), g(n)) (C) θ(f(n) + g(n)) = min(f(n), g(n)) (D) θ(f(n) + g(n)) = max(f(n), g(n))

Last Answer : (D) θ(f(n) + g(n)) = max(f(n), g(n))

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)

Use the Factor Theorem to determine whether g(x) is a factor of p(x) in each of the following cases: (i) p(x) = 2x3+x2–2x–1, g(x) = x+1 -Maths 9th

Description : Use the Factor Theorem to determine whether g(x) is a factor of p(x) in each of the following cases: (i) p(x) = 2x3+x2–2x–1, g(x) = x+1 -Maths 9th

Last Answer : Solution: p(x) = 2x3+x2–2x–1, g(x) = x+1 g(x) = 0 ⇒ x+1 = 0 ⇒ x = −1 ∴Zero of g(x) is -1. Now, p(−1) = 2(−1)3+(−1)2–2(−1)–1 = −2+1+2−1 = 0 ∴By factor theorem, g(x) is a factor of p(x

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

Match the following mechanisms for interrupting the execution of a process and their uses. i) Interrupt a) Call to an operating system function ii) Trap b) Reaction to an asynchronous external event iii) Supervisor Call c) Handling of a error or an exception condition A) i-a, ii-b, iii-c B) i-c, ii-a, iii-b C) i-b, ii-c, iii-a D) i-a, ii-c, iii-b

Description : Match the following mechanisms for interrupting the execution of a process and their uses. i) Interrupt a) Call to an operating system function ii) Trap b) Reaction to an asynchronous external event iii) Supervisor Call c) Handling of a error ... -a, iii-b C) i-b, ii-c, iii-a D) i-a, ii-c, iii-b

Last Answer : C) i-b, ii-c, iii-a

Can a US presidential election ever occur in an odd-numbered year?

Description : Can a US presidential election ever occur in an odd-numbered year?

Last Answer : No cause it happens every 4 years so it will never be on a odd year.

If you were spin a spinner numbered 1-10 what would is the probability of getting an odd number?

Description : If you were spin a spinner numbered 1-10 what would is the probability of getting an odd number?

Last Answer : It is 0.5

Nine playing cards are numbered 2 to 10. A card is selected at random. What is the probability that the card will be an odd number? a. 1/9 b. 2/9 c. 4/9 d. 3/7

Description : Nine playing cards are numbered 2 to 10. A card is selected at random. What is the probability that the card will be an odd number? a. 1/9 b. 2/9 c. 4/9 d. 3/7

Last Answer : c. 4/9

In the Ethernet frame, the_______field contains error detection information. A) CRC B) preamble C) address D) none of the above

Description : In the Ethernet frame, the_______field contains error detection information. A) CRC B) preamble C) address D) none of the above

Last Answer : CRC

Which error detection method consists of just one redundant bit per data unit? A) Simple parity check B) Two-dimensionalparity check C) CRC D) Checksum

Description : Which error detection method consists of just one redundant bit per data unit? A) Simple parity check B) Two-dimensionalparity check C) CRC D) Checksum

Last Answer : Simple parity check

Which error detection method usesone's complement arithmetic? A) Simple parity check B) Two-dimensionalparity check C) CRC D) Checksum

Description : Which error detection method usesone's complement arithmetic? A) Simple parity check B) Two-dimensionalparity check C) CRC D) Checksum

Last Answer : Checksum

Which error detection method uses one's complement arithmetic? A. Simple parity check B. Two-dimensional parity check C. CRC D. Checksum

Description : Which error detection method uses one's complement arithmetic? A. Simple parity check B. Two-dimensional parity check C. CRC D. Checksum

Last Answer : D. Checksum

A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is P1 || P2 || P3 || ..... || Pk if and only if: (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i ≤ j (D) Pi || Pj for all i ≥ j

Description : A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is  P1 || P2 || P3 || ..... || Pk if and only if: (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i ≤ j (D) Pi || Pj for all i ≥ j

Last Answer : (A) Pi || Pj for all i ≠ j Explanation: Bernstein's Condition: 1. If process Pi writes to a memory cell Mi, then no process Pj can read the cell Mi. 2. If process Pi read from a memory ... Mi. 3. If process Pi writes to a memory cell Mi, then no process Pj can write to the cell Mi.

A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave

Description : A fuzzy set A on R is ................. iff A(λx1 + (1 – λ)x2) ≥ min [A(x1), A(x2)] for all x1, x2 ∈ R and all λ ∈ [0, 1], where min denotes the minimum operator. (A) Support (B) α-cut (C) Convex (D) Concave 

Last Answer : (C) Convex 

An artificial neurons receives n inputs x1, x2,...,xn with weights w1,w2,...,wn attached to the input links. The weighted sum ............... is computed to be passed on to a non-linear filter ϕ called activation function to release the output. (A) Σ wi (B) Σ xi (C) Σ wi + Σ xi (D) Σ wi . Σ xi

Description : An artificial neurons receives n inputs x1, x2,...,xn with weights w1,w2,...,wn attached to the input links. The weighted sum ............... is computed to be passed on to a non-linear filter ϕ called activation function to release the output. (A) Σ wi (B) Σ xi (C) Σ wi + Σ xi (D) Σ wi . Σ xi

Last Answer : (D) Σ wi . Σ xi

Consider the two class classification task that consists of the following points: Class C1: [1 1.5] [1 -1.5] Class C2: [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: (A) x1+x2+1.5=0 (B) x1+x2-1.5=0 (C) x1+1.5=0 (D) x1-1.5=0

Description : Consider the two class classification task that consists of the following points: Class C1: [1 1.5] [1 -1.5] Class C2: [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: (A) x1+x2+1.5=0 (B) x1+x2-1.5=0 (C) x1+1.5=0 (D) x1-1.5=0

Last Answer : (C) x1+1.5=0 

A perceptron has input weights W1 = -3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for the input x1 = 1.3 and x2 = 2.2? (A) -2.65 (B) -2.30 (B) 0 (D) 1

Description : A perceptron has input weights W1 = -3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for the input x1 = 1.3 and x2 = 2.2? (A) -2.65 (B) -2.30 (B) 0 (D) 1

Last Answer : Answer: C

Consider the following LPP: Min. Z = x1+x2+x3

Description : Consider the following LPP: Min. Z = x1+x2+x3 Subject to 3x1 + 4x3 ≤ 5 5x1 + x2 + 6x3 =7 8x1 + 9x3 ≥ 2 x1, x2, x3 ≥ 0 The standard form of this LPP shall be: (1) Min. Z = x1 + x2 + x3 + 0x4 + 0x5 Subject ... + 4x3 + x4 = 5; 5x1 + x2 + 6x3 + x6 = 7; 8x1 + 9x3 - x5 + x7 = 2; x1 to x7 ≥ 0

Last Answer : Answer: 1

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

IPv4 and IPv6 are addresses used to identify computers on the internet. Find the correct statement out of the following: (A) Number of bits required for IPv4 address is more than number of bits required for IPv6 address. (B) Number of bits required for IPv4 address is same as number of bits required for IPv6 address. (C) Number of bits required for IPv4 address is less than number of bits required for IPv6 address. (D) Number of bits required for IPv4 address is 64.

Description : IPv4 and IPv6 are addresses used to identify computers on the internet. Find the correct statement out of the following: (A) Number of bits required for IPv4 address is more than number of bits required for ... of bits required for IPv6 address. (D) Number of bits required for IPv4 address is 64. 

Last Answer : (C) Number of bits required for IPv4 address is less than number of bits required for IPv6 address.

With respect to a loop in the transportation table, which one of the following is not correct? (1) Every loop has an odd no. of cells and at least 5. (2) Closed loops may or may not b square in shape. (3) All the cells in the loop that have a plus or minus sign, except the starting cell, must be occupied cells. (4) Every loop has an even no. of cells and at least four.

Description : With respect to a loop in the transportation table, which one of the following is not correct? (1) Every loop has an odd no. of cells and at least 5. (2) Closed loops may or may not b square in ... starting cell, must be occupied cells. (4) Every loop has an even no. of cells and at least four.

Last Answer : Every loop has an odd no. of cells and at least 5.

Find the transmitted code if the frame is (MSB) 1101011011 (LSB) and generator polynomial is x4 + x + 1.A. 1101011011 1110 B. 1101011111 1110 C. 1101011011 1111 D. 1101011011

Description : Find the transmitted code if the frame is (MSB) 1101011011 (LSB) and generator polynomial is x4 + x + 1. A. 1101011011 1110 B. 1101011111 1110 C. 1101011011 1111 D. 1101011011

Last Answer : A. 1101011011 1110

Let x be the mean of x1, x2,….,xn and y be the mean of y1, y2, ……,yn the mean of z is x1, x2,….,xn , y1, y2, ……,yn then z is equal to -Maths 9th

Description : Let x be the mean of x1, x2,….,xn and y be the mean of y1, y2, ……,yn the mean of z is x1, x2,….,xn , y1, y2, ……,yn then z is equal to -Maths 9th

Last Answer : NEED ANSWER

Let x be the mean of x1, x2,….,xn and y be the mean of y1, y2, ……,yn the mean of z is x1, x2,….,xn , y1, y2, ……,yn then z is equal to -Maths 9th

Description : Let x be the mean of x1, x2,….,xn and y be the mean of y1, y2, ……,yn the mean of z is x1, x2,….,xn , y1, y2, ……,yn then z is equal to -Maths 9th

Last Answer : According to question find the value of z

For total internal reflection to occur, which condition must be satisfied? a) N1 = N2 b) N1 > N2 c) N1 < N2 d) N1 x N2=1

Description : For total internal reflection to occur, which condition must be satisfied? a) N1 = N2 b) N1 > N2 c) N1 < N2 d) N1 x N2=1

Last Answer : b) N1 > N2