Question Discussion & Solution

Functional cohesion:

A module is said to possess functional cohesion, if different functions of the module co-operate to complete a single task.

Example of Functional cohesion

A module containing all the functions required to manage employees’ pay-roll displays functional cohesion

The disease Kala-Azar is caused by the protozoan Leishmania donovani

Leishmania donovani: 

• It is a parasitic protozoan belonging to the class Mastigophora or flagellata.
• It is a human parasite that is dimorphic (i.e. shows two forms) & digenetic in nature
• It causes the disease Kala-azar or Dumdum fever by sand fly (phelobotomus)
• The disease is spread by the bite of infected sand-fly
• It can affect the Skin (Cutaneous Leishmaniasis), the mucous membrane of the mouth, throat, and nose (Mucocutaneous Leishmaniasis), Liver, lymph nodes, spleen, and bone marrow (Visceral Leishmaniasis)
• Symptoms include: Cutaneous Leishmaniasis - Skin ulcers
• Mucocutaneous Leishmaniasis - Ulcers in mouth, throat, and nose, Nosebleed, Difficulty in breathing.
• Visceral Leishmaniasis - Weakness, weight loss, loss of appetite, enlarged spleen, liver, lymph nodes, a decrease in the production of blood cells.

Diagram showing the two different forms of Leishmania donovani

• Multiple Inheritance in C++ is one in which a class can inherit members from more than one class
• A class who inherit the property is derived class and class from whom it is inherited is base class or parent class

Example:

class X //base class

{

public:

 X() { cout << "X's constructor" ; }

};

 class Y //base class

{

public:

 Y() { cout << "Y's constructor "; }

};

 class C: public B, public A // Derived class: Multiple inheritance

{

public:

 Z() { cout << "Z's constructor" ; }

i) Point B is 3m North of point A.

ii) Point C is 3m West of point B.

iii) Point D is 5m South of point C.

iv) Point E is 7m East of point D.

Drawing the Diagram as per the given information:

Thus we can se direction of E is South-East with reference to point B.

Hence, the correct is "South-East".

Binary search algorithm:

Binary search algorithm is used to find an element in an already sorted array.

STEPS 1:

It finds the middle element of the array and compare the element with the element to be searched, if

it matches then return true.

STEPS 2:

If not, then divide the array into two halves in which if element to be search is less than middle

element then search takes place in left part otherwise search in right half.

STEP 3:

Repeat this process, until you get the element.

Explanation:

Best case of Binary search occurs when element to be searched is the middle element of the array.

Then in that case, it just simply compares the element with the middle element, if matches then return

true.  Comparing with the one element will take only O(1) time complexity.

Best Case: Search 35 in below give array

T(n) = O(1)