WHEREIS COMMAND IN LINUX

 whereis command is used to find the location of the source/binary file of a command and manuals sections for a specified file in a Linux system. If we compare whereis command with find command they will appear similar to each other as both can be used for the same purposes but whereis command produces the result more accurately by consuming less time comparatively.


Syntax:


Example 1: Let%u2019s say, we want to find the location of apropos command then we need to execute the following command in the terminal:



Example 2: To find the location of lshw command.


Options:

-b: This option is used when we only want to search for binaries.

Example: To locate binary of a Linux command let%u2019s say gunzip.



-m : This option is used when we only want to search for manual sections.

Example: To locate man page of false command.



-B: This option is used to change or otherwise limit the places where whereis searches for binaries.

Example: To locate binary of lesspipe in the path, /bin.



-M: This option is used to change or otherwise limit the places where whereis searches for manual sections.

Example: To check the man page of intro that is only in a specific location i.e. /usr/share/man/man1.



-S: This option is used to change or otherwise limit the places where whereis searches for sources.

Example: To Find all files in /usr/bin which are not documented in /usr/man/man1 with source in /usr/src.



-V: Displays version information and exit.



-h: Displays this help and exit.

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