Show how mergesort sorts the array See Answer →
a) Show the results of inserting the keys
See Answer →
Discuss five types of infectious diseases caused by microbes. Add a note on the spread or transmission of these diseases.
See Answer →What is mass communication? Discuss the technological advances in mass communication.
See Answer →Explain the concept of chemical evolution with the help of Miller’s experiment.
See Answer →Explain the application of science and technology in small scale industries.
See Answer →Explain the impact of the modern information technology on our life style and society.
See Answer →Mention four ways in which our societyhas benefitted from the artificial satellite programme
See Answer →Explain how the recent technological advances have benefitted the modern education system.Give suitable examples.
See Answer →Discuss in detail the evidences of human evolution giving suitable examples.
See Answer →Distinguish between nuclear fusion and nuclear fission and discuss briefly the working of a nuclear reactor.
See Answer →List the major endocrine glands and add a note on their functions.
See Answer →Draw a well labelled diagram of human brain cut along the medial plane.
See Answer →List and describe the developments in medicine during the Iron Age.
See Answer →Give an account of the scientific revolution during post renaissance period.
See Answer →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 →
a) Let and
be cyclic codes over
with generator polynomials
and
respectively. Prove that
if and only if
See Answer →
a) The maximum subsequence sum problem is defined as follows: If are in Z, find the maximum value
for all
We assume that the answer is 0 if all the
are negative or if the sum is empty. The following algorithm finds a solution to the problem. Here, we assume that
s are stored in the array A.
Maximum-Subsequence
1
2
3
4
5
6
7
8
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 →Let α be a root of in
a) Check whether α is a primitive element of If it is not a primitive element in
find a primitive element γ in
in terms of α. b) Make a table similiar to Table 5.1 on page 184 for
with the primitive element γ
c) Factorise over
d) Find all the possible generator polynomials of a [8,6] cyclic code.
See Answer →
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
ii) Show that
(Hint: Start with the relation
iii) Deduce that every repetiition code of odd length is perfect.
See Answer →