I just broke the screen on my phone, and the way my insurance works, they're going to replace it with a new one...   However, I've spent a lot of time setting up everything in my phone, and would like to not have to do it again...   Is it possible to transfer EVERY SINGLE BIT OF DATA on my phone to my pc, and then restore it in a new one?
I know I'm asking for the close-to-impossible -- as a real full-backup certainly requires root permissions. But still there are many folks around not wanting to root their devices -- afraid of voiding their warranties or bricking their devices, or just not having their devices supported by any rooting method.  I also know there were a lot of questions asked already on this topic, and I checked all of them having the backup tag -- none covers the entire topic, all just have pieces, and especially people new to Android (but other non-power-users as well) would have a hard time figuring out the best way.  So I want a detailed canonical answer to the question:  Not involving root-solutions, how to achieve a backup as close as possible to a full backup?  Please do not give simple one-liner answers like "Use app xyz [full-stop]." If mentioning an app (and I doubt a single app would be the answer here), include what parts are covered by it -- as well as ideas on how to fill the gaps it leaves. (And to make it absolutely clear: I know the first thing coming to mind is Titanium Backup -- I use it myself, but this does not apply here: This question is strictly about methods for non-rooted devices!) Moreover, the answer should be as generic as possible in terms of applying to a wide range of devices (i.e. it should not be restricted to one device or manufacturer).  I already mentioned having investigated all questions here tagged backup. These will certainly be helpful providing details for answers here, so I will list up the topmost ones concerning my question:            All these provide some details for my question (so feel free to get inspired by them) -- but I feel there are still details missing. Also it would be helpful to have a summary -- say, an answer including the full description of "the maximum possible".  A last criterium: While I'd consider cloud-based solutions legit, I'd favour local solutions. If you can provide both: all the better. But some people value privacy quite high (I'm one of them), and thus would not trust their data to some cloud service.    Thanks to Ryan, we now have a solution for a really complete backup of all apps and their data -- which I didn't dare to hope for! The only disadvantage: His solution only works for less than 10% of all Android users; namely those whose devices are running at least with Android 4.x.  So again, I ask the close-to-impossible: Any solutions applicable at least on Gingerbread (2.3.x) or, better, even Froyo (2.2.x) -- so they cover the majority of current devices? These solutions may involve multiple tools (try to keep it as simple as possible though; think of your mother to follow your instructions ;)  And keep in mind: NO ROOT!    To further motivate high-quality answers (and hopefully avoid low-quality ones), I will be a harsh one here: As I rarely do, I will down-vote answers not fitting the mentioned criteria on one end -- but on the other end, I will setup a bounty for the best answer (which cannot be done immediately, but earliest after 2 days).
At the end of every day you will be required to write a review.   At the end of each day you will be required to write a review.   Which one of those sentences is better if this action will repeat itself every day for longer period of time, several weeks for example, maybe even months? Can there be an option to allocate rep from any site account for offering a bounty? I think it would be useful if we had an option when deciding to open a bounty on a question that we could choose to allocate rep from one site even though the bounty is being offered on another site.  For instance I would like to use my rep from SO for putting a bounty on a question that resides on SF. I don't have enough rep on SF to make it enticing. So when you click on "start a bounty" you get sliders for each site that you can pull your rep from, maybe make it where you need to burn up all your rep for the site that your asking the question on and then allocate more rep from other ones, if you have it.  thanks devinb for clearing up my question with your comments! " transfer rep INTO a bounty. But you can't transfer rep across accounts. So, the rep you'd 'lose' from SO would never actually go into your SF account, it would go straight onto a bounty on whatever question." – devinb Is there a way of moving unwanted villagers out faster? Tricks and tips for finding information in man pages Does anyone have any tricks and tips for finding information in man pages? The space $C^0([0;1],\mathbb{R})$ of all continuous, real-valued functions on $[0,1]$ is not reflexive. Let $a, b, \&amp; \, m$ be integers. Prove that if $2a + 3b \geq 12m + 1$, then $a \geq 3m + 1$ or $b \geq 2m + 1$.   My Attempt: I don't conceive apace how to contrive, from the one inequality in the antecedent, the two inequalities in the consequent. So a proof by contraposition may be more facile. The contrapositive is: $\text{If }  \color{Green}{a &lt; 3m + 1} \; \&amp; \; \color{#0073CF}{b &lt; 2m + 1}, \text{ then } 2a + 3b &lt; 12m + 1 \tag{*}.$  From $(*)$, $\color{Green}{2a} + \color{#0073CF}{3b} &lt; \color{Green}{6m + 2} \; + \;\color{#0073CF}{6m + 3} = 12m +5$. But this doesn't prove $(*)$.     Given Solution:  Assume that $a &lt; 3m+1$ and $b &lt; 2m+1.$ Since a and b are integers, $a ≤ 3m$ and $b ≤ 2m.$ Therefore, $2a + 3b ≤ 2(3m) + 3(2m) = 12m &lt; 12m+ 1,$ as desired. $\blacksquare$   What went wrong in my attempt? I understand the given solution but I persisted with the more natural and direct green and blue, instead of deviating to weak inequalities. Shouldn't both solutions work?  Source: Problem 4.19 on P102 (related to P90, Result 4.8) of Mathematical Proofs, 2nd ed by Chartrand et al.    $\large{\text{Supplement to Cameron Buie and pritam's Answers :}}$  What overriding, catholic lessons can be extrapolated from this example to generalise about inequalities?   Moreover, in order to circumvent the problem here (ie the loss of information from the weaker inequalities), should I always start with the strictest inequality? If so, should I always rework any weak inequality into the equivalent strict inequality?   For example, define $r \in \mathbb{R} $ and $n \in \mathbb{Z}$ and $g(...) \neq h(...)$. Then $ f(r) &lt; h(r) \require{enclose}      \enclose{updiagonalstrike}{\iff} f(r) \leq g(r).$ But $ f(n) &lt; h(n) \text{ MAY OR MAY NOT }\iff f(n) \leq g(n).$ Is $7$ the only prime followed by a cube? PSTricks error "Undefined control sequence  \c@lor@to@ps" There was a film from the 80s in which young people can teleport anywhere they can think of.   These guys are recruited to do studies with, maybe by the government or a secret company which wants the take advantage of their abilities.   I saw it on cable TV around 1990-1997.   Any clues? Given $\int_0^{\infty}e^{-x^2}dx = \frac{\sqrt{\pi}}{2}$, evaluate $\int_0^{\infty}e^{-a^2x^2-\frac{b^2}{x^2}}dx $ Given $$\int_0^{\infty}e^{-x^2}dx = \frac{\sqrt{\pi}}{2}$$ evaluate:   $$\int_0^{\infty}e^{-a^2x^2-\frac{b^2}{x^2}}dx. $$   I can find that  $$\left(ax+\frac{b}{x}\right)^2 = a^2x^2+2ab+\frac{b^2}{x^2}$$  therefore: $$\int_0^{\infty}e^{-a^2x^2-\frac{b^2}{x^2}}dx = e^{2ab}\int_0^{\infty}e^{-\left(ax+\frac{b}{x}\right)^2}dx$$  but I can't find any clue then. Including section titles in fancyhf headers Legendre's formula counts the number of positive integers less than or equal to a number $x$ which are not divisible by any of the first $a$ primes: $$\begin{align} &amp;\phi(x,a)=\lfloor x \rfloor-\sum_{p_i\le a}\left\lfloor \dfrac{ x }{(p_i)}\right\rfloor+\sum_{p_i&lt;p_j\le a}\left\lfloor\dfrac{ x}{(p_ip_j)}\right\rfloor-\sum_{p_i&lt;p_j&lt;p_k\le a}\left\lfloor \dfrac{x}{(p_ip_jp_k)}\right\rfloor+\dots \end{align}$$ then $\pi(x)=\phi\bigl(x,\pi (\sqrt{x})\bigr)+\pi (\sqrt{x})-1$ as given .  My question is, why does $\bigl\lfloor\phi(x,\lfloor\sqrt{x}\rfloor)+\sqrt{x}-1\bigr\rfloor$ also equal $\pi(x)?$ ffmpeg synchonization of libfdk_aac (or libfacc) and libx264 How to synchronize libfdk_aac and libx264 streams?  ffmpeg -i pipe_libfdk_aac.fifo -i pipe_libx264.fifo -c copy -f flv flv_stream_pipe_or_rtmp.output   I'm always receiving the same asych in all cases: saving file on file system, rtmp-using or raw pipe out. Is it possible to syncronize them?   ffmpeg version N-66924-gaba61b2 Copyright (c) 2000-2014 the FFmpeg developers built on Jan 15 2015 12:50:29 with gcc 4.6 (GCC) 20120106 (prerelease) configuration: --arch=arm --cpu=cortex-a8 --target-os=linux --enable-runtime-cpudetect --prefix=/data/data/info.guardianproject.ffmpeg/app_opt --enable-pic --disable-shared --enable-static --cross-prefix=/home/qwerty/work/android-ndk-r10b86/android-ndk-r10b/toolchains/arm-linux-androideabi-4.6/prebuilt/linux-x86/bin/arm-linux-androideabi- --sysroot=/home/qwerty/work/android-ndk-r10b86/android-ndk-r10b/platforms/android-3/arch-arm --extra-cflags='-I/home/qwerty/x264 -I/home/qwerty/ffmpeg_build/mp3/build/include -I/home/qwerty/faac/output/include -I/home/qwerty/ffmpeg_sources/fdk-aac/build/include -I/usr/local/include/ -mfloat-abi=softfp -mfpu=neon' --extra-ldflags='-L/home/qwerty/x264 -L/home/qwerty/ffmpeg_build/mp3/build/lib -L/home/qwerty/ffmpeg_sources/fdk-aac/build/lib -L/home/qwerty/faac/output/lib -L/usr/local/lib/ -lrtmp -lpolarssl' --enable-version3 --enable-gpl --enable-nonfree --disable-doc --enable-yasm --enable-decoders --enable-encoders --enable-muxers --enable-demuxers --enable-parsers --enable-protocols --enable-filters --enable-avresample --enable-librtmp --enable-libfaac --enable-libfdk_aac --enable-libmp3lame --disable-indevs --enable-indev=lavfi --disable-outdevs --enable-hwaccels --enable-ffmpeg --disable-ffplay --disable-ffprobe --disable-ffserver --disable-network --enable-libx264 --enable-zlib --enable-muxer=md5 libavutil      54. 10.100 / 54. 10.100 libavcodec     56.  8.100 / 56.  8.100 libavformat    56.  9.100 / 56.  9.100 libavdevice    56.  1.100 / 56.  1.100 libavfilter     5.  1.106 /  5.  1.106 libavresample   2.  1.  0 /  2.  1.  0 libswscale      3.  1.101 /  3.  1.101 libswresample   1.  1.100 /  1.  1.100 libpostproc    53.  3.100 / 53.  3.100 Short story (50s? 60s?) with a man trapped inside a sentient cave I'm trying some things with my shell. This includes the following command:  kill $$  My expectation was that the shell would log me out and terminate itself. But instead the bash persists without change.   Any idea why?  I ran this command on different environments (archlinux, debian). The behavior was always the same. When rolling percentages, do 1d100 and two d10s (percentiles) share the same probabilities? Compiler warning: null reference exception I have the following code in Visual Studio 2005.      Dim OutFile As System.IO.StreamWriter     Try         OutFile = New System.IO.StreamWriter(Filename)        // Do stuff with OutFile     Catch Ex As Exception        // Handle Exception     Finally        If OutFile IsNot Nothing Then OutFile.Close()     End Try   But VS2005 brings up the warning for the line "If OutFile IsNot.." that      Variable 'OutFile' is used before it has been assigned a value. A null reference exception could result at runtime.   Is there some way of removing this warning by subtly altering the code or is there just a better way of doing what I'm trying to do?  Thanks  Rob How to implement uniform grids Up until now, I implemented all-against-all collision detection in my games. It worked fine.  But I reached a point where implementing this kind of collision detection, makes the game run poorly, because there are two many objects to iterate through and check for collision.  I have searched this site and found something about 'uniform grids'. But I didn't completely understand what it is and how to implement it. Tried to Google it but nothing easy enough to understand came up.  I am a beginner to 2D-game programming. Do you mind trying to explain to uniform-grids, or link me to some good tutorial?  Thanks a lot Understanding DC-DC boost converters I’m currently working on a solar powered boat with a modest sized team of people. For our competition we are only allowed to have 3 12v batteries on board but we are allowed to have up to 52v at any point in our setup. We are hoping to kick up the speed of our outboard motor for the sprint portion of the completion and are looking into using a boost converter for this.   After doing a little research I’m a bit confused about how they fundamentally work. From what I can tell they take in a voltage and current and put out a higher voltage with a lower current with some level of efficiency. But it seems to be independent from the load( in this case the motor) which doesn’t make much sense to me because I thought the current would be determined by whatever my load is. How do loads actually interact with boost converters?( The simpler the better.)  For reference we are using the Saietta 119r motor system and I’m considering using the MPS MPQ3425 boost converter. Controlling Volume Mixer