How to root micromax hd ,2,2+

-
Hey Guys! here i am going to tell you how to root your micromax canvas 2, cansvas hd , canvas 2+....and all the other models running the jellybean..
Before proceeding download the supersu.apk for your phone from the xda-developers.com and paste it into your sdcard.
step by step instruction:-
1: first switch off your phone (Make sure that your phone is charged around 75%).
2: Now turn it on by pressing
power+volume up+volume down  key simultaneously.
Above steps will get you into the recovery mode.
(in this tutorial we are not needing the custom clockwork recovery).. we are flashing with  recovery that are given by the provider...
3. Now in recovery, select the update from sdcard . (use the volume up and down button move through the list and press the power button to select the options..)

4. select the supersu.zip file from the sdcard that you've downloaded.( if you do no have the file visit xda-developers.com  and search with your phones respective model you'll get tons of articles..)
it will flash the superuser appplication into your phone which will grant you the root access.
5. Reboot, you've successfully rooted your phone now.

6. Browse to superuser application in your phone and update the binaries in the application.

congrats!!!now you've got the root privileges on your #canvas device.

 Here are the list of some top applications to be used on rooted phone:-

1. first one is romManager, one of my favorite application .. that will allow pretty much to customize everything on your phone (including the cool booting animation).
2. secondly i prefer Titanium Backup, pretty robust application to use for all back up and swapping memory.
3. being a linux lover i can not ignore the "Hulk" type allication...named "Busybox". Install it and install the packages... it is packed with most of the linux utilities that one can find helpful.
4. now that you've busybox on your phone one more thing is to download is a good terminal... download it from Google Playstore. and enjoy "busyboxing". 

Comments

Post a Comment

Popular posts from this blog

Contest Leaderboard: hackerrank problem (Level medium)

-
Problem Statement: You did such a great job helping Julia with her last coding contest challenge that she wants you to work on this one, too! The total score of a hacker is the sum of their maximum scores for all of the challenges. Write a query to print the hacker_id , name , and total score of the hackers ordered by the descending score. If more than one hacker achieved the same total score, then sort the result by ascending hacker_id . Exclude all hackers with a total score of from your result. Tables: Hackers: The hacker_id is the id of the hacker, and name is the name of the hacker.  Submissions: The submission_id is the id of the submission, hacker_id is the id of the hacker who made the submission, challenge_id is the id of the challenge for which the submission belongs to, and score is the score of the submission.   Solutions: select h.hacker_id,h.name,sum(sscore) from Hackers h inner join (select s.hacker_id,max(score) as sscore from Submissions s g
Read more

Placements: SQL Advance join (Hackerrank Problem)

-
Image
Problem: You are given three tables:  Students , Friends and Packages.   Students contains two columns: ID  and Name . Friends contains two columns: ID and Friend_ID ( ID of the ONLY best friend). Packages  contains two columns: ID and Salary (offered salary in $ thousands per month). Write a query to output the names of those students whose best friends got offered a higher salary than them. Names must be ordered by the salary amount offered to the best friends. It is guaranteed that no two students got same salary offer. Solution: select temp1.sn from (select S.ID si,S.Name sn,P.Salary ps from Students S join Packages P on S.ID=P.ID) temp1 join (select FF.ID fi,FF.Friend_ID fd,PP.Salary pps from Friends FF join Packages PP on FF.Friend_ID=pp.ID) temp2 on temp1.si=temp2.fi and temp1.ps<temp2.pps order by temp2.pps asc ; Explanation: As the problem states that we have to select the name of the friend whose salary is lesser than what his/her friend is ha
Read more

The Occupation: hackerrank problem

-
Problem Statement: Pivot the Occupation column in OCCUPATIONS so that each Name is sorted alphabetically and displayed underneath its corresponding Occupation . The output column headers should be Doctor , Professor , Singer , and Actor , respectively. Note: Print NULL when there are no more names corresponding to an occupation. Table:   'OCCUPATIONS' table contain the column 'Name' and 'Occupation' Solution: select doc,prof,singer,act from ( select row_number() over(partition by Occupation order by Name) ron,Name as n,Occupation as o from OCCUPATIONS ) pro pivot (max(n)  for o in ('Doctor' as doc,'Actor' as act,'Professor' as prof,'Singer' as singer))  order by ron asc; Explanation: in the above query statement i am using row_number() function with the 'partition by' clause to append one column that contains row_number for each row in the subquery. in the subquery while assigning row_number() we
Read more