Question
Consider the following statement about recent
nomination in Board of Trade.      I.       Recent government has nominated 29 non-official members from large and small enterprises.    II.       It is a top advisory body on Internal trade.   III.       The Board is chaired by commerce and industry minister Piyush Goyal. Which of the above statement is/are not correct?Solution
Statement I is correct -: The government has nominated 29 non-official members from large and small enterprises and different sectors in the Board of Trade. The official members will include secretaries of department of revenue, department of commerce, ministry of health, agriculture, Deputy Governor of the Reserve Bank of India, and chairman Central Board of Indirect Taxes and Customs (CBIC), among others. Other non-official members include Pasha Patel, former member of Maharashtra Legislative Council, Pankaj Mahindroo, Chairman India Cellular and Electronics Association, Praveen Khandelwal, Secretary General Confederation of All India Traders (CAIT), Laghu Udyog Bharati Executive Member Om Prakash Mittal, GCMMF (Amul) Managing Director RS Sodhi, among others, according to notification issued by the Centre. Statement II is not correct -: It is a top advisory body on external trade Statement III is correct-: The Board, chaired by commerce and industry minister Piyush Goyal, advises the government on policy measures to improve the country's foreign trade.
Which of the following CPU scheduling algorithms is optimal for minimizing average waiting time but requires knowledge of future process execution times...
Which of the following sorting algorithms has the best average-case time complexity?
Output of below code
public class Prg {
public static void main(String args[]){
System.out.print("A" + "B" + 'A');
}
...What is the primary purpose of a digital signature in cryptography?
Which command is TCL command
The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
Which graph traversal technique is commonly used for topological sorting?
Which shortest-path algorithm is appropriate for graphs with non-negative weights and supports decrease-key efficiently for faster performance?
Depth-First Search (DFS) typically uses which data structure implicitly or explicitly?
What is the worst-case time complexity of Bubble Sort?
Relevant for Exams:
