Question
Badri Narayan received the prestigious literary award
Sahitya Akademi Award, 2022 for ?Solution
Twenty-four writers across as many Indian languages were honoured with the Sahitya Akademi Award, 2022 at the beginning of the 39th โFestival of Lettersโ. Hindi author Badri Narayan and English writer Anuradha Roy were among those who received the prestigious literary award at a ceremony held at Kamani Auditorium on the inaugural day of the literary festival, organised by the Sahitya Akademi. While Mr. Narayan received the honour for his collection of poems titled Tumadi Ke Shabd, Ms. Roy was awarded for her novel All the Lives We Never Lived in English. The prestigious award comprises โน1 lakh in cash, an engraved copper plaque and a shawl. About Sahitya Akademi The Sahitya Akademi Award is a literary honour in India, which the Sahitya Akademi, India's National Academy of Letters, annually confers on writers of the most outstanding books of literary merit published in any of the 22 languages of the 8th Schedule to the Indian constitution as well as in English and Rajasthani language. Established in 1954, the award comprises a plaque and a cash prize of โน 1,00,000.
Which design pattern is most suitable for controlling access to a resource by limiting the number of clients that can use it concurrently?
The time complexity of binary search is:
In a binary tree, what is the maximum number of children a node can have?
Which type of AI is primarily used for adaptive mobile applications like virtual assistants?
Which of the following techniques is primarily used to address overfitting in machine learning models?
A data analysis algorithm requires processing data in a Last-In, First-Out (LIFO) manner. Which operation is used to get the most recently added element...
What type of relationship is represented by Aggregation in Object-Oriented Programming?
Consider the following sequence of stack operations:
PUSH(10) โ PUSH(20) โ PUSH(30) โ POP() โ PUSH(40) โ POP() โ POP()
What is...
Which of the following is true about triggers in a relational database?
Union-Find with path compression achieves nearly constant time because its complexity is: