NPTEL Computational Number Theory and Algebra Assignment 7 Answer
We Discuss About That NPTEL Computational Number Theory and Algebra Assignment 7 Answer
NPTEL Computational Number Theory and Algebra Assignment 7 Answer – Here All The Questions and Answers Provided to Help All The Students and NPTEL Candidate as a Reference Purpose, It is Mandetory to Submit Your Weekly Assignment By Your Own Understand Level.
Are you looking for the Assignment Answers to NPTEL Computational Number Theory and Algebra Assignment 7 Answer? If Yes You are in Our Great Place to Getting Your Solution, This Post Should be help you with the Assignment answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL Computational Number Theory and Algebra Assignment 7 Answer”
Table of Contents
NPTEL Computational Number Theory and Algebra Assignment
Algebra plays an important role in both finding algorithms, and understanding the limitations of computation. This course will focus on some of the fundamental algebraic concepts that arise in computation, and the algebraic algorithms that have applications in real life. The course will cover the problems of fast integer (or polynomial) multiplication (or factoring), fast matrix multiplication, primality testing, computing discrete logarithm, error-correcting codes, lattice- based cryptography, etc. The course intends to introduce both basic concepts and practical applications.
Next Week Assignment Answers
This course can have Associate in Nursing unproctored programming communication conjointly excluding the Proctored communication, please check announcement section for date and time. The programming communication can have a weightage of twenty fifth towards the ultimate score.
- Assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
- ( All assignments in a particular week will be counted towards final scoring – quizzes and programming assignments).Â
- Unproctored programming exam score = 25% of the average scores obtained as part of Unproctored programming exam – out of 100
- Proctored Exam score =50% of the proctored certification exam score out of 100
UNPROCTORED PROGRAMMING EXAM SCORE >=10/25 AND PROCTORED EXAM SCORE >= 20/50.Â
CHECK HERE OTHERS NPTEL ASSIGNMENTS ANSWERSÂ
BELOW YOU CAN GET YOUR NPTEL Computational Number Theory and Algebra Assignment 7 Answer 2022? :
Assignment not submitted
1 point
Consider unique decoding Reed Solomon code, RS: (Fq)k→(Fq)n(Fq)k→(Fq)n, which views a k-length message as a polynomial of degree k-1 in Fq[x]Fq[x]. Given any two codewords, in at least how many positions must they differ? (distance of code)
n/k
k/n
n-k+1
n-k-1
Ans – D
1 point
Alice uses Reed Solomon code, RS: (F7)3→(F7)5(F7)3→(F7)5 to communicate with Bob. For message (2,0,1), Alice sends codeword (1,3,2,5,5) to Bob and for message (0,1,4), Alice sends codeword (4,5,6,0,1) to Bob. Can you guess the codeword which Alice will send for the message (2,1,5)?
(4,5,3,5,4)
(5,1,1,5,6)
(3,2,4,2,3)
We cannot guess due to insufficient information
Ans – C
1 point
Consider Reed Solomon code, RS: (F3)2→(F3)3(F3)2→(F3)3, where a message (a,b) is viewed as polynomial ax+b in F3[x]F3[x] and its evaluations are sent as codewords. Suppose channel introduces at most one error. Consider the list decoding version which outputs all valid codewords that agree on at least 2 places. Which of the following is true?
For received code (0,0,1), list decoding outputs { (0,0,0), (2,0,1), (0,2,1) }.
For received code (1,1,0), list decoding outputs { (1,1,1), (2,1,0), (0,1,0) }.
Both of these.
None of these.
Ans – C
1 point
How many degree â„“â„“ polynomials are there in the finite field FpFp (p>2p>2 is prime)? How many of them are irreducible polynomials as shown in lectures?
pâ„“pâ„“ polynomials of degree â„“â„“ and at least pâ„“/2â„“pâ„“/2â„“ irreducible polynomials.
â„“â‹…pâ„“â„“â‹…pâ„“ polynomials of degree â„“â„“ and exactly pâ„“pâ„“ irreducible polynomials.
2pâ„“2pâ„“ polynomials of degree â„“â„“ and exactly pâ„“pâ„“ irreducible polynomials.
None of the above is correct.
Ans – B
1 point
Let f(x,y)f(x,y) be a square-free bivariate polynomial over the finite field FpFp, p>2p>2 is prime. If fmodyfmody is square-full, then which of the following is true?
There is a shift f to f(x+t,y), for some t>0, such that f mod y is square-free.
There is a shift f to f(x,y+t), for some t>0, such that f mod y is square-free.
There are shifts with respect to both x and y such that f mod y becomes square-free.
There may not be any shift at all which makes f mod y square-free.
Ans – B
1 point
Which of the following is true about Kaltofen’s bivariate factoring algorithm over finite fields (as shown in lectures)?
1. It reduces bivariate factoring to univariate factoring efficiently.
2. It uses Hensel’s lifting to achieve the above reduction.
Only 1.
Only 2.
Both 1 and 2.
Neither 1 nor 2.
Ans – D
Yhaa You have done it but next? if YOU Want to your Others NPTEL Computational Number Theory and Algebra Assignment 7 Answer Then Follow US HEREand Join Telegram.