1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Phoenix [80]
2 years ago
5

What reforms were made by the British government in India after the war of independence? write any three

Computers and Technology
1 answer:
mixas84 [53]2 years ago
8 0

Answer:

1. Indian Council Act

2. Morely-Minto Reforms

3. Rowlatt Act

Explanation:

Following the unsuccessful war of independence in Indian often referred to as the Indian Rebellion of 1857. There were various reforms established by the British government before the actual independence of India in 1947. Some of the reforms include:

1. Indian Council Act: this was established in 1861 under the regime of Lord Canning. The purpose is to contemplate an association of Indians with the administration at a higher level.

2. Morely-Minto Reforms: this was established in 1909 under the reign of Lord Minto II. The purpose is to Separate electorates to widen the gulf between Hindús and Muslims.

3. Rowlatt Act: this was established in 1919 under the administration of L. Chelmsford. These reforms favor the extraordinary powers given to suppress the freedom struggle with General Dyer as the Commandant.

You might be interested in
HELP I WILL MARK BRAINLIEST!!! I NEED ASAP!!!
Alex777 [14]

#This is a way without a loop

friends = list(map(str,input("Enter Names: ").split()))

print(sorted(friends))

#This is a way with a loop (for&&while)

friends = list(map(str,input("Enter Names: ").split()))

cool = True

while cool:

   cool = False

   for i in range(len(friends)-1):

       if friends[i] > friends[i+1]:

           coo = friends[i]

           friends[i] = friends[i+1]

           friends[i+1] = coo

           cool = True

print(friends)

4 0
4 years ago
A qualifier distinguishes the set of objects at the far end of the association based on the qualifier value.
Andrei [34K]

Answer:

True

Explanation: A qualifier is a term used in IT(information technology) and computer software. It is used to differentiate/ identify and select different sets of objects that are located at the far ends of a qualifier association.

A qualifier is usually used to identify an object from a set of closely related and similar objects, they are usually small boxes possibly with a rectangular shape.

7 0
3 years ago
Is mayonnaise technically an instrument?
stich3 [128]
No it doesn’t count as an instrument
7 0
3 years ago
Is designed to access a computer or operating system without the knowledge or permission of the user.
kramer

Answer:

Spyware

Explanation:

Spyware is a type of program that is installed with or without your permission on your personal computers to collect information about users, their computer or browsing habits tracks each and everything that you do without your knowledge and send it to remote user.

5 0
2 years ago
Is recursion ever required to solve a problem? What other approach can you use to solve a problem that is repetitive in nature?
Setler79 [48]

Answer:

No you can not tell that recursion is ever required to solve a problem.

Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.

Iteration is also another form of repetitive approach we follow to solve that kind of problems.

But the difference between recursion and iteration is :

  • In recursion we call the function repeatedly to return the result to next level.
  • In iteration certain bunch of instructions in a loop are executed until certain conditions met.

Explanation:

For example in the Fibonacci sequence problem, to find f_{n}, we need to compute f_{n-1} and f_{n-2} before that.

  • In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.

                           Fibonacci(n)

                           1. if(n==0 or n==1)

                           2.       return 1.

                           3.else

                           4.      return( Fibonacci(n-1)+Fibonacci(n-1) )

  • But in case of iteration we run a loop for i=2 to n, within which we add the value of current f_{i-1} and f_{i-2} to find the value of f_{i}

                           Fibonacci(n)

                           1. if(n<=2)

                           2.    result = 1

                           3.     else

                           4. result1 =1 and result2=1.

                           5.      {  result = result1 +result2.

                           6.         result1= result2.

                           7.         result2 = result.

                           8.      }

                           9.  output result.

8 0
3 years ago
Other questions:
  • What could prevent earmuffs from providing your ears good protection from noise?
    10·1 answer
  • Function prototypes and function definitions look similar because they have the same function heading. In a function prototype t
    14·1 answer
  • While inspecting an element in the DOM on my website using the Chrome Devtools I accidentally deleted the DIV that had all my au
    8·1 answer
  • A program that processes data submitted by the user. Allows a Web server to pass control to a software application, based on use
    11·1 answer
  • Information about hardware engineers?
    9·1 answer
  • Which of the following is true for an API?
    6·1 answer
  • 9. Which is an example of a function?<br>(1 Point)<br>=A1 +A2<br>=SUM(A1:A3)<br>=ADD(A1:A3)​
    14·2 answers
  • Write an algorithm to show whether a given number is even or odd.
    14·1 answer
  • Match the following pls help
    5·1 answer
  • 1.a computer can create an output based on the input of the user.
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!