Question
Who among the following is/are eligible to get
registered as a citizen of India? 1. A person of Indian origin who is ordinarily resident in any country or place outside undivided India. 2. A person who is married to a citizen of India and is ordinarily resident in India for two years. 3. A person of full age and capacity who was earlier an Indian citizen, and is ordinarily resident in India for twelve months. Select the correct answer using the code given below.ÂSolution
 Under the Citizenship Act of 1955, the Central Government may, on an application, register as a citizen of India any person (not being an illegal migrant) if he belongs to any of the following categories, namely:-
- A person of Indian origin who is ordinarily resident in India for seven years before making an application for registration;
- A person of Indian origin who is ordinarily resident in any country or place outside undivided India;
- A person who is married to a citizen of India and is ordinarily resident in India for seven years before making an application for registration;
- Â minor children of persons who are citizens of India;
- A person of full age and capacity whose parents are registered as citizens of India;
- A person of full age and capacity who, or either of his parents, was earlier citizen of independent India, and is ordinarily resident in India for twelve months immediately before making an application for registration;
- A person of full age and capacity who has been registered as an overseas citizen of India cardholder for five years, and who is ordinarily resident in India for twelve months before making an application for registration.Â
Which of the following problems cannot be solved using greedy algorithms for optimal result?
Which command is TCL command
Which of the following sorting algorithms is considered stable (i.e., preserves the relative order of equal elements)?
What is the default replication factor in HDFS?
A bank's customer database has 1,000,000 sorted records. Compare the maximum number of comparisons needed by Linear Search vs Binary Search to find a sp...
Counting Sort is an efficient sorting algorithm when the range of input elements (k) is not significantly larger than the number of elements (n). What i...
Which sorting algorithm is not stable by default?
The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
What is the space complexity of Bubble Sort?
Which of the following is NOT a characteristic of the SJF (Shortest Job First) scheduling algorithm?   Â