Question Discussion & Solution

The correct answer is Kuchipudi Dance.

• Yamini Krishnamurti is related to Kuchipudi Dance.

Key Points 

• Yamini Krishnamurti is a Kuchipudi dancer.
• She also knows Bharatnatyam.
• A Passion For Dance is her autobiography.
• Kuchipudi:
  • It is the classical dance of Andhra Pradesh.
  • Kuchipudi derives its name from the Kuchipudi village of Andhra Pradesh.
  • Kuchipudi exhibits scenes from the Hindu Epics, legends and mythological tales through a combination of music, dance and acting.
  • Like other classical dances, Kuchipudi also comprises pure dance, mime and histrionics but it is the use of speech that distinguishes Kuchipudi’s presentation as dance-drama.
  • ‘At times, even though the dramatic situation did not demand, solo dancing was being presented to punctuate the presentation and to enhance the appeal. One such number is tarangam inspired by the Krishna-Leela tarangini of Teerthanarayana Yogi.
  • There are now two forms of Kuchipudi
    • The traditional musical dance drama 
    • The solo dance.
• Bharatnatyam is the classical dance of Tamil Nadu.

The correct answer is Parasite.

Key Points

• Cuscuta: 
  • ​It is a stem parasite. Hence, Option 2 is correct.
  • It is also known as Amarbel in India.
  • A parasitic plant is a plant that obtains all or part of its nutrition from another plant (the host) without contributing to the benefit of the host and, in some cases, causing extreme damage to the host.
  • The defining structural feature of a parasitic plant is the haustorium, a specialized organ that penetrates the host and forms a vascular union between the plants.

Additional Information

• Saprophytes are living organisms that live and feed on dead and decaying organisms.
• An autotroph is an organism that can produce its own food using light, water, carbon dioxide, or other chemicals. 
• Host plants are plants that an organism lives on and lives off of.

The correct answer is EEPROM.

Key Points

• Flash memory is a non-volatile computer storage chip,
• It is made up of EEPROM.
• EEPROM is the acronym of electrically erasable programmable read-only memory,
• EEPROM is a Programmable ROM that can be erased and reprogrammed using an electrical charge.
• It was first was developed by George Perlegos.
• It allows the user to update the computer BIOS without having to open the computer or remove any chips.
• It organized as arrays of floating-gate transistors.
• USB flash drive, Memory cards are the examples of flash memory storage.
• BIOS is stored in Flash memory chip.

Additional Information

• RDRAM is the acronym of Rambus Dynamic Random Access Memory.
  • It is a video RAM.
• MROM is the acronym of Mask ROM.
  • It is produced by arranging transistors before the semiconductor manufacturing process actually begins.
• SRAM is the acronym of Static random-access memory
  • It uses latching circuitry (flip-flop) to store each bit.
• PROM is the acronym of Programmable Read-Only Memory.
  • It can be modified only once by a user.

Preparing the family tree using the following symbols,

Given:

Mahendra is the son of Naman, who is the brother of Reema’s mother.

1) Mahendra is the son of Naman.

2) Naman is the brother of Reema’s mother.

We can draw following Family Tree from the information given above:

Hence, the Mahendra is the "Cousin" of Reema.

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)