Bypass Windows User Login



Bypass Microsoft Windows User Login    


Step I : Get any Linux Distribution live bootable disk (generally all Linux Distros comes         with live boot option).   
If you don't have bootable disk download it from the respective website. Although Ubuntu is most popular Linux distribution. You can download Ubuntu from :http://www.ubuntu.com/download/desktop   ( select the latest version according to your cpu artitecture viz. 32 bit or 64 bit). After download, you can burn it DVD or a USB flash drive).

Step II: Now reboot your PC and enter into BIOS menu by pressing particular function key depending on your your pc manufacturer ( for lenovo its F12 and for HP its F10). 
In the boot menu select DVD (if you want to boot from Linux DVD) or select USB name (if you want to boot from usb drive.
Step III : Select live boot option ( in some cases like linux mint, it automatically executes live boot without giving any option). Once the desktop loads, first of all open COMPUTER icon available on desktop region. (see the desktop region of linux mint)


After opening my computer,  open the disk on which your windows is loaded, then select windows folder ( see fig. below)

   Inside windows folder you will find 'system32' folder, just open it and rename sethc.exe to anything.exe and rename cmd.exe to sethx.exe
Step III: Start your PC after removing bootable device and wait for windows login screen to appeat.
Step IV: When windows login screen appear, press shift 5 times, then command prompt appears on the screen. 
Type the following : ( assuming that the username is Jack and password as 1234 )

net user Jack 1234
hit enter and exit command prompt.
Then just login without typing any password. 
THATS DONE................
try it .....have good luck...


 

Comments

Post a Comment

Popular posts from this blog

CodeChef : Breaking Bricks || Problem Code: BRKBKS

CodeChef : https://www.codechef.com/JAN20B/problems/BRKBKS Problem: For her next karate demonstration, Ada will break some bricks. Ada stacked three bricks on top of each other. Initially, their widths (from top to bottom) are W1,W2,W3. Ada's strength is S. Whenever she hits a stack of bricks, consider the largest k≥0 such that the sum of widths of the topmost k bricks does not exceed S; the topmost k bricks break and are removed from the stack. Before each hit, Ada may also decide to reverse the current stack of bricks, with no cost. Find the minimum number of hits Ada needs in order to break all bricks if she performs the reversals optimally. You are not required to minimise the number of reversals. Input The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. The first and only line of each test case contains four space-separated integers S, W1, W2 and W3. Output For each test case, pri
Keep reading

HackerRank Problem : Reverse and capitalise first alphabet of each word.

  Problem : ( Link : Click here to visit this problem on HackerRank. ) Reverse the words in a string and capitalize the first letter of each reversed word, preserving the capitalization in the original stri. For eg: "Hello World" would be transformed to "OlleH DlroW". Input : The first line of input would be the number of test cases followed by each string in a line. Output : Output should be the string with each word reversed and first letter of each reversed word capitalized. Each output string should be printed to a new line.   Sample Input Sample Output 1 Hello World OlleH DlroW ------------------------------------------------------------------------------------------------------------------------------------------------------------------------ Solution : ( in C++ ) #include   <iostream> #include   <string> #include   <algorithm> #include   <cctype> using   namespace std ; int main (
Keep reading

CodeChef (AUG17 LunchTime) : Mathison and pangrams - MATPAN

Problem: Mathison and pangrams Mathison recently inherited an ancient papyrus that contained some text. Unfortunately, the text was not a pangram . Now, Mathison has a particular liking for holoalphabetic strings and the text bothers him. The good news is that Mathison can buy letters from the local store in order to turn his text into a pangram. However, each letter has a price and Mathison is not very rich. Can you help Mathison find the cheapest way to obtain a pangram? Input  The first line of the input file will contain one integer, T , representing the number of tests. Each test will be formed from two lines. The first one contains 26 space-separated integers, representing the prices of all letters. The second will contain Mathison's initial text (a string of N lowercase letters). Output  The output file will contain T lines, one for each test. Each line will contain the answer for the corresponding test. Constraints : 1 ≤ T ≤ 10 1 ≤ N ≤ 50,0
Keep reading