Naresh Harishchandra Patil

Naresh Harishchandra Patil (born 7 April 1957) is an Indian judge and former Chief Justice of the Bombay High Court.

The Honorable Mr. Justice

Naresh Harishchandra Patil

CJ
Chief Justice of the Bombay High Court
In office
24 October 2018  6 April 2019
Appointed byRam Nath Kovind
Nominated byRanjan Gogoi
Judge of Bombay High Court
In office
12 October 2001  23 October 2018
Nominated bySam Piroj Bharucha
Appointed byK. R. Narayan
Personal details
Born (1957-04-07) 7 April 1957
Bombay, Bombay State, India
NationalityIndian
Alma materBombay University

Career

In 1979, Patil graduated in the faculty of law from the Government Law College, Mumbai under the Bombay University.[1] He was enrolled as an advocate in 1980 and started practise in the District Court at Latur from 1980 to 1982. After that he worked as lawyer in the Bombay High Court. Patil was appointed as Honorary Assistant to the Government Pleader in Aurangabad Bench by the Government of Maharashtra in 1983. In 1988 he became Additional Standing Counsel for the Government of India. Patil appeared several time on behalf of the Government and Government undertaking Corporation, Councils, Election Commission, Railways and for various statutory bodies in his career.[1] He was elevated as permanent Justice of the Bombay High Court on 12 October 2001[2][3] and became the acting Chief Justice in August 2018.[4][5] On 24 October 2018, He was appointed as Chief Justice of the Bombay High Court.[6] On 6 April 2019, He retired and he succeeded Justice Pradeep Nandrajog

gollark: I put in `const raw = polynomial(seq([2, 3, 5, 7, 11, 13, 17, 19, 23, 29]))`.
gollark: (x - 3) * -1 / 2.14708725e+8 * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) / 3.72736e+7 * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) * -1 / 1.3934592e+7 * (x - 3) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) / 1.01376e+7 * (x - 3) * (x - 5) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) * -5 / 3.5831808e+7 * (x - 3) * (x - 5) * (x - 7) * (x - 13) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) / 6.7584e+6 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 17) * (x - 19) * (x - 23) * (x - 29) + (x - 2) * -1 / 1.24416e+7 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 19) * (x - 23) * (x - 29) + (x - 2) / 2.193408e+7 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 23) * (x - 29) + (x - 2) * -1 / 2.322432e+8 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 29) + (x - 2) / 7.685922816e+9 * (x - 3) * (x - 5) * (x - 7) * (x - 11) * (x - 13) * (x - 17) * (x - 19) * (x - 23)
gollark: What are your 10 favourite primes?
gollark: As far as I'm aware, this generates something like O(n²) output terms.
gollark: Fine, I'll... feed it some primes? How many primes?

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.