Solve your IGNOU Doubts
Solve your IGNOU Doubts
Question:

Show how mergesort sorts the array See Answer →

Question:

a) Show the results of inserting the keys
See Answer →

Question:

Discuss five types of infectious diseases caused by microbes. Add a note on the spread or transmission of these diseases.

See Answer →
Question:

What is mass communication? Discuss the technological advances in mass communication.

See Answer →
Question:

Explain the concept of chemical evolution with the help of Miller’s experiment.

See Answer →
Question:

Explain the application of science and technology in small scale industries.

See Answer →
Question:

Explain the impact of the modern information technology on our life style and society.

See Answer →
Question:

Mention four ways in which our societyhas benefitted from the artificial satellite programme

See Answer →
Question:

Explain how the recent technological advances have benefitted the modern education system.Give suitable examples.

See Answer →
Question:

Discuss in detail the evidences of human evolution giving suitable examples.

See Answer →
Question:

Distinguish between nuclear fusion and nuclear fission and discuss briefly the working of a nuclear reactor.

See Answer →
Question:

List the major endocrine glands and add a note on their functions.

See Answer →
Question:

Draw a well labelled diagram of human brain cut along the medial plane.

See Answer →
Question:

List and describe the developments in medicine during the Iron Age.

See Answer →
Question:

Give an account of the scientific revolution during post renaissance period.

See Answer →
Question:

a) For the set of keys {3, 7, 9, 4, 6, 8, 12} draw binary search trees of height 2, 3, 4, 5 and 6. 
b) Using Fig. 6.3 in page 134 of the book as a model, illustrate the operation of Build-Max-Heap on the array See Answer →

Question:

a) Let Image ignouassignments-ignouacademy-com--p-ignou-71150 and Image ignouassignments-ignouacademy-com--p-doubts-25235 be cyclic codes overF_{q} with generator polynomials g_{1}(x) and g_{2(x),}respectively. Prove that Image ignouassignments-ignouacademy-com--p-doubts-69831

\subseteq Image ignouassignments-ignouacademy-com--p-ignou-36228 if and only if g_{2(x)} |g_{1}(x).

 

See Answer →
Question:

a) The maximum subsequence sum problem is defined as follows: If a_1,a_2,...,a_n are in Z, find the maximum value \sum_{k=i}^{j}a_i, for all i,\, j,1\leq i\leq j\leq n. We assume that the answer is 0 if all the a_i are negative or if the sum is empty. The following algorithm finds a solution to the problem. Here, we assume that a_i s are stored in the array A.

Maximum-Subsequence(A,MaxSum)

1      Sum\leftarrow 0,MaxSum\leftarrow0

2      for\, i\leftarrow1\: to\: n

3                   do 

                       Sum=Sum+A[i]

                       if Sum>MaxSum

6                               then MaxSum\leftarrow\, Sum

7                               else\: if\, Sum<0

8                                               then\, Sum=0

State precisely a loop invariant for the for loop in line 2–8. Prove that your loop invariant holds and hence conclude that the algorithm works.

b) Analyse the algorithm and find an upper bound for the run time of the above algorithm.

See Answer →
Question:

Let α be a root of x^{2}+1=0inF_{9.}

a) Check whether α is a primitive element of F_{9.} If it is not a primitive element in F_{9.} find a primitive element γ in F_{9.} in terms of α. b) Make a table similiar to Table 5.1 on page 184 for F_{9.} with the primitive element γ

 c) FactoriseX^{8}- 1 over F_{3.}

d) Find all the possible generator polynomials of a [8,6] cyclic code.

 

See Answer →
Question:

d) The aim of this exercise is to show that every binary repetition code of odd length is perfect

i) Find the value of t and d for a perfect code of length 2m+1, m\epsilon

ii) Show that

\sum_{i=0}^{m\binom{2m+1}{i=2^{2m}\sum _{i=0}^{m}\binom{2m+1}{i}=2^{2m}

(Hint: Start with the relation

2^{2m+1}=\sum _{i=0}^{2m+1}\binom{2m+1} )

iii) Deduce that every repetiition code of odd length is perfect.

 

See Answer →
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★
Top
📞
Call Support Instant phone assistance
🟢
WhatsApp Chat Fast live messaging
Email Us Business enquiries & support