Mega Star Cheeranjeevi : All you need to Know

-



Chiranjeevi is a famous Indian actor, a well-known film producer, and a successful former politician, who works in Telugu cinema. 

Chiranjeevi starred in over 150 feature films in Telugu, as well as many films in Hindi, Tamil, and Kannada. In a film career spanning over four decades.

He had won many awards in his courier. These awards include three Andhra Pradesh State Nandi Awards, a Raghupathi Venkaiah Award, and nine Filmfare Awards South. In 2006, he was honored with the Padma Bhushan, India's third-highest civilian award, for his contributions to Indian cinema and was presented with an honorary doctorate from Andhra University. He served as the Minister of Tourism for the Government of India from 2012 and 2014.

Punadirallu (1978)

Chiranjeevi's acting career started with his first film "Punadhirallu" in 1978. In 1987, he starred in "Swayamkrushi" which was a huge success. Swayamkrushi was dubbed into Russian and was screened at the Moscow International Film Festival. Chiranjeevi won the 1988 Indian Express Best Actor Award and the state Nandi Award for Best Actor awards for his performance in the film. In 1988 he co-produced the film "Rudraveena" which won the National Film Award for Best Feature Film on National Integration.

Gharana Mogudu (1992)

Gharana Mogudu, directed by K. Raghavendra Rao and starring Chiranjeevi in 1992 was the first south Indian film to collect over 10 crores at the box office. This film was screened at the 1993 International Film Festival of India in the mainstream section. It made Chiranjeevi the highest-paid actor in India at the time catapulting him to the cover pages of national weekly magazines in India.

Aapadbandhuvudu(1992)

The entertainment magazines Filmfare and India Today named him "Bigger than Bachchan", a reference to Bollywood's Amitabh Bachchan. News magazine The Week hailed him as "the new money machine". He was paid ₹1.25 crore, the highest fee for any Indian actor, for the 1992 film Aapadbandhavudu. In 2002, Chiranjeevi was given the Samman Award for being the highest Income Taxpayer for the 1999–2000 assessment year by the Minister of State for Finance. He is the first Indian actor to start a personal website on the internet. A poll conducted by CNN-IBN in 2006 named Chiranjeevi the most popular star in the Telugu film industry.

Praja Rajyam Party



In 2008, Chiranjeevi founded the Praja Rajyam Party and contested in the 2009 Andhra Pradesh election. The party won 18 out of 294 seats and was later merged into the Indian National Congress in 2011. Chiranjeevi was appointed as the Minister of State with independent charge for the Ministry of Tourism on 27 October 2012 and served until 15 May 2014. In 2013, he inaugurated the Incredible India Exhibition, a joint participation of the Ministry of Tourism and Ministry of Information and Broadcasting at the 66th Cannes Film Festival. Chiranjeevi represented Incredible India at the 14th International Indian Film Academy Awards ceremony held in Macau. In 2013, IBN LIVE named him as one of "the men who changed the face of the Indian Cinema".

Chiranjeevi at the World Travel Awards, 2012

He established the Chiranjeevi Charitable Trust (CCT), which incorporates the Chiranjeevi Blood and Eye Banks, on October 2, 1998. It is the biggest recipient of blood and eye donations in the state. Over 68,000 blood donations and 1,414 eye donations have been made through the trust. Since its inception, the CCT's blood bank has assisted more than 80,000 people, while the eye bank has assisted about 1,000 people in the state of Andhra Pradesh. Approximately 350,000 people have donated their eyes to CCT, providing 1600 people with sight. The AP State Government has given CCT the "Best Voluntary Blood Bank Award" for the previous four years. Abdul Kalam, who was India's president at the time, launched the Chiranjeevi Charitable Foundation (CCF) at Jubilee Hills Check Post in Hyderabad

Comments

Post a Comment

Popular posts from this blog

Multiply Strings Leetcode 43 question Correct Solution

-
 Question : Given two non-negative integers  num1  and  num2  represented as strings, return the product of  num1  and  num2 , also described as a string. Note:  You must not use any built-in BigInteger library or directly convert the inputs to integers. Constraints: 1 <= num1.length, num2.length <= 200 num1  and  num2  consist of digits only. Both  num1  and  num2  do not contain any leading zero, except the number  0  itself. /**  * @param {string} num1  * @param {string} num2  * @return {string}  */ var add = function ( a , b ){     // length of a should be smaller     if ( a . length > b . length ) return add ( b , a );     // iterate a     let i = a . length - 1 , j = b . length - 1 , carry = 0 , currAns = '' ;     while ( i >= 0 ){         // get nums        ...
Read more

In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute.

-
Image
Q1 (12 points) In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute. On the answer sheet, enter the values for nij, i = 1, 2, 3, j = 1, 2, 3, 4. Q1. Solution: Aim: Each entry denotes the largest integer n such that f(n) milliseconds do not exceed t. FIRST ROW........................................... i) Solving n11 :   Here , f(n) = 100n + 200 And t = 1 second. so,    where n is an integer   : [t = 1second = 1000ms]  Ans:  ii) Solving n12 Here , f(n) = 100n + 200 And t = 1minute = 60sec = 60000ms Ans :  iii) Solving n13 Here , ...
Read more

Longest Palindromic Substring Solution

-
Image
 Question:  Given a string  s , return  the longest palindromic substring  in  s . Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb" Solution : Let us create a Table. If the string size is n, then the table will have n rows and n columns. The element a(i, j) of the table will determine whether the substring from index i to j is a palindrome or not. So in this way, we will calculate the maximum length of the palindromic substring.  Now to fill this table we will use the following algorithm:  STEP 1: Create a Table, Where the Row index is the start of the palindrome substring and the column index is the end of the palindromic substring. STEP 2:  Fill the diagonal of the table with 1. Because (i, i) is itself a palindrome of length 1. STEP 3: Fill (i, i+1) by checking adjacent characters. If they are equal then 1, else 0. STEP 4: For every Distance other su...
Read more