Related InterviewSolutions

• The product of monic polynomials is monic.(a) True(b) False(c) Can’t Say(d) None of the mentionedThis question was addressed to me in an online interview.I want to ask this question from Polynomial and Modular Arithmetic- III topic in chapter Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security
• The polynomial x^4+1 can be represented as –(a) (x+1)(x^3+x^2+1)(b) (x+1)(x^3+x^2+x)(c) (x)(x^2+x+1)(d) None of the mentionedI have been asked this question in a national level competition.Enquiry is from Polynomial and Modular Arithmetic- III in portion Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security
• If f(x)=x^7+x^5+x^4+x^3+x+1 and g(x)=x^3+x+1, find f(x) – g(x).(a) x^7+x^5+x^4+x^3(b) x^6+x^4+x^2+x(c) x^4+x^2+x+1(d) x^7+x^5+x^4This question was posed to me in my homework.I'd like to ask this question from Polynomial and Modular Arithmetic- III topic in chapter Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security
• Find the HCF/GCD of x^6+x^5+x^4+x^3+x^2+x+1 and x^4+x^2+x+1.(a) x^4+x^3+x^2+1(b) x^3+x^2+1(c) x^2+1(d) x^3+x^2+1The question was posed to me during an internship interview.This interesting question is from Polynomial and Modular Arithmetic in section Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security
• If f(x)=x^3+x^2+2 and g(x)=x^2-x+1, find: f(x) + g(x)(a) x^3+2x^2-x+3(b) x^3+x^2+3(c) x^3+x+1(d) x^2+2x+4This question was posed to me in an online quiz.My query is from Polynomial and Modular Arithmetic- I in division Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security
• What do the above numbers correspond to?0 1 2 3 40 4 3 2 10 1 2 3 4– 1 3 2 4(a) Both Additive Inverses(b) Both Multiplicative Inverses(c) Additive and Multiplicative Inverse respectively(d) Multiplicative and Additive Inverses respectivelyThe question was asked in examination.I want to ask this question from Polynomial and Modular Arithmetic- I topic in division Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security
• Multiply 00100110 by 10011110 in GF(2^8) with modulus 100011011.The result is(a) 00101111(b) 00101100(c) 01110011(d) 11101111I have been asked this question during an interview.This interesting question is from Polynomial and Modular Arithmetic- III in section Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security
• Is x^3 + 1 reducible over GF(2)(a) Yes(b) No(c) Can’t Say(d) Insufficient DataI have been asked this question in an international level competition.Question is from Polynomial and Modular Arithmetic- IV in division Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security
• A Ring satisfies the properties(a) R-i to R-v(b) G-i to G-iv(c) G-i to R-v(d) G-i to R-iiiI have been asked this question by my school principal while I was bunking the class.This interesting question is from Groups Rings and Fields in portion Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security
• Find the 8-bit word related to the polynomial x^6 + x^5 + x^2 + x +1(a) 00010011(b) 11000110(c) 00100110(d) 01100111This question was posed to me in exam.Question is from Polynomial and Modular Arithmetic- I in chapter Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security