August 2023

Russia-Africa Economic and Humanitarian Summits

Russia-Africa Economic and Humanitarian Summits

Russia-Africa Economic and Humanitarian Summits: On July 27-28, 2023, St. Petersburg, Russia, held the Second Summit of the Russia-Africa Economic and Humanitarian Forum, a historic event that highlighted Russia’s increasing relations with African countries. This summit marked the second time such events of this magnitude were held, indicating the significance and commitment of both parties […]

Russia-Africa Economic and Humanitarian Summits Read More »

Aishwary Pratap Singh Tomar clinches Gold medal at FISU Games

Aishwary Pratap Singh Tomar clinches Gold medal at FISU Games

Aishwary Pratap Singh Tomar clinches Gold medal at FISU Games: Aishwary Pratap Singh Tomar, along with compound archers Avneet Kaur, Sangampreet Singh Bisla, and the men’s 10m air rifle team, achieved remarkable victories by securing gold medals at the FISU World University Games 2023 in Chengdu, the People’s Republic of China. With these accomplishments, India’s

Aishwary Pratap Singh Tomar clinches Gold medal at FISU Games Read More »

Indian-origin author Chetna Maroo’s debut novel on Booker Prize longlist

Indian-origin author Chetna Maroo’s debut novel on Booker Prize longlist

Indian-origin author Chetna Maroo’s debut novel on Booker Prize longlist: London-based Indian-origin author Chetna Maroo’s debut novel ‘Western Lane’ is among 13 books to make the cut for the 2023 Booker Prize longlist revealed. Kenya-born Maroo’s novel, set within the context of the British Gujarati milieu, has been praised by the Booker judges for its

Indian-origin author Chetna Maroo’s debut novel on Booker Prize longlist Read More »

For Σ = {𝑎, 𝑏}, let us consider the regular language 𝐿 = { 𝑥 |𝑥 = 𝑎2+3𝑘 or 𝑥 = 𝑏10+12𝑘, 𝑘 ≥ 0}. Which one of the following

For Σ = {𝑎, 𝑏}, let us consider the regular language 𝐿 = { 𝑥 |𝑥 = 𝑎2+3𝑘 or 𝑥 = 𝑏10+12𝑘, 𝑘 ≥ 0}. Which one of the following

Q. For Σ = {𝑎, 𝑏}, let us consider the regular language 𝐿 = { 𝑥 |𝑥 = 𝑎2+3𝑘 or 𝑥 = 𝑏10+12𝑘, 𝑘 ≥ 0}. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for 𝐿 ? (A) 3 (B) 5 (C) 9 (D) 24 Ans:

For Σ = {𝑎, 𝑏}, let us consider the regular language 𝐿 = { 𝑥 |𝑥 = 𝑎2+3𝑘 or 𝑥 = 𝑏10+12𝑘, 𝑘 ≥ 0}. Which one of the following Read More »

ISRO injects Chandrayaan-3 into translunar orbit

ISRO injects Chandrayaan-3 into translunar orbit

ISRO injects Chandrayaan-3 into translunar orbit: The Chandrayaan-3 spacecraft, India’s third lunar exploration mission, has made an important accomplishment by entering the moon’s sphere of influence. This successful entry was made possible through a TransLunar Injection (TLI) executed by the Indian Space Research Organisation (ISRO). The next critical stage is the August 5 Lunar Orbit

ISRO injects Chandrayaan-3 into translunar orbit Read More »

Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?

Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?

Q. Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? (A) B+ Tree is a height-balanced tree (B) Non-leaf nodes have pointers to data records (C) Key values in each node are kept in sorted order (D) Each leaf

Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? Read More »

Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the number of different Hamiltonian cycles in 𝐺 is equal to

Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the number of different Hamiltonian cycles in 𝐺 is equal to

Q. Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the number of different Hamiltonian cycles in 𝐺 is equal to Ans: Option D Solution: A simple circuit in a graph G that passes through every vertex exactly once is called a Hamiltonian circuit. In Hamiltonian cycle is a

Let 𝐺 be an undirected complete graph on 𝑛 vertices, where 𝑛 > 2. Then, the number of different Hamiltonian cycles in 𝐺 is equal to Read More »

Scroll to Top