MAKING A BOOTABLE DRIVE IN LINUX CLI

 If you have used windows you might be familiar with a tool called RUFUS. It was widely used for creating bootable usb drives and was easy to use. In linux we also have many such similar tools to do that particular task but what if you want to do the same using CLI below is the easy processes to create a bootable usb using CLI .


dd tool is one of the most used command by Linux professionals  it is generally by default available in nearly all Linux distributions. dd stands for Data Duplicator and is used for converting and copying data block by block. 

First unmount the drive 
use lsblk to locate your drive the unmount it 



Format your external drive
usr mkfs to format your drive, you can format it according to your need into vfat,ntfs or ext4 here we will use ext4



Copy the .iso file 
Then use dd to copy the .iso file into the formatted drive
here if = Input file
of = Output file




Monitoring the progress
Now dd process can take a lot of time depending upon your image size to monitor the progress you can use
kill -USR1 pid 
and you can get pid of dd using 
pgrep ^dd






Comments

Post a Comment

Popular posts from this blog

OOP Assignment 3 helping materials

 Following is the code that will help you in the assignment for the addition of the arrays using operator overloading and returning an object. #include<iostream> using namespace std; int num; struct add {     int ar[20]; }; add operator+(add &a1,add &a2) {     add a3;     for(int i=0;i<num;i++)         a3.ar[i]=a2.ar[i]+a1.ar[i];     return a3; } int main() {     add a1,a2,a3;     cout<<"How many elements to be stored (max 20) : ";     cin>>num;     cout<<"Enter elements of array a1 : ";     for(int i=0;i<num;i++)         cin>>a1.ar[i];     cout<<"Enter elements of array a2 : ";     for(int i=0;i<num;i++)         cin>>a2.ar[i];     a3=a1+a2;     cout<<"Addition of two arrays : ";     for(int i=0;i<num;i++)   ...
Read more

Square root Algorithm in C++

 Here is the way you can find the square root of any number by writing your own code in c++.  #include<iostream> using namespace std; double sqrt(double num){ double stop_condition = 0.00000001; double guess = num/2; while((guess-num/guess) > stop_condition){ guess = (guess+num/2)/2; } return guess; } int main(){ double num = 4; cout<<"The result is: "<<sqrt(num)<<endl; return 0; }
Read more

OOP lab 7 task solution

  #include <iostream> using namespace std ; class position { public: int x ; int y ; position (){ x = 0 ; y = 0 ; } position operator + ( position & p_any ){ position p1 ; p1 . x = this -> x + p_any . x ; p1 . y = this -> y + p_any . y ; return p1 ; } }; int main (){ position p1 ; cout<< "Enter the intial values of x and y cordinates: " ; cin>> p1 . x >> p1 . y ; position p2 ; cout<< "Enter the new values for x and y to be shifted: " ; cin>> p2 . x >> p2 . y ; position p3 ; p3 = p1 + p2 ; cout<< "The initial values were: " << p1 . x << " " << p1 . y <<endl; cout<< "The new values are: " << p3 . x << " " << p3 . y <<endl; } // from now onward this is the second task #in...
Read more