Important shortcuts for Photoshop. (Windows)

-


Adobe Photoshop is a critical tool for designers, web developers, graphic artists, photographers, and creative professionals. It is widely used for image editing, retouching, creating image compositions, website mockups, and adding effects. Digital or scanned images can be edited for use online or in-print.


To use photoshop easier and faster way on a pc or laptop one should know the main shortcut keys on keyboard which are used many times while working.


 CTRL + O  :   To open new projects 

 CTRL + S  :   To save your file.
 
     CTRL + SHIFT + S  :  To save as your project.

 CTRL + J  :   To duplicate selected layer.

 CTRL + Z  :   To undo/redo one step through image state.
  
         ALT + CTRL + Z  :   To step backward through image states.
 
      CTRL + SHIFT+ Z  :   To step forward through image states.

 CTRL + E  :   To merge layers.

      [   :   To decrease brush feather.

     ]   :   To increase brush feather.

       SPACEBAR  :   To temporarily activate Hand tool. 

CTRL + 0  :   To fit in view.

    ENTER  :   To apply.

    CTRL + DEL  :  To highlight entire image.

       ALT + DEL  :  To remove current highlight.

         TAB  :   To show/hide all panels.

   CTRL +  :  To zoom in .

   CTRL  -  :   To zoom out.

        CTRL + G  :   To group layers.

  CTRL + SHIFT + G  :   To ungroup layers.

        ALT+ Rt. CLICK  :   To create/delete clipping mask between layers.

    CTRL + Rt. CLICK  :   To select/deselect multiple discontiguous layers.

  SHIFT + Rt. CLICK  :   To select/deselect multiple contiguous layers.
 
         CTRL + T  :   To transform selection.

   CTRL + TAB  :   To cycle through open documents.


You can view, edit, and summarize keyboard shortcuts in the Keyboard Shortcuts dialog box. To view this in Photoshop, select Edit > Keyboard Shortcuts or use the following keyboard shortcuts:
                                                                      Alt + Shift + Control + K (Windows)
 

Comments

Post a Comment

Popular posts from this blog

Compare the Triplet | HackerRank | Solution in C

-
  Compare the Triplet Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from  1  to  100  for three categories:  problem clarity ,  originality , and  difficulty . The rating for Alice's challenge is the triplet  a = (a[0], a[1], a[2]) , and the rating for Bob's challenge is the triplet  b = (b[0], b[1], b[2]) . The task is to find their  comparison points  by comparing  a[0]  with  b[0] ,  a[1]  with  b[1] , and  a[2]  with  b[2] . If  a[i] > b[i] , then Alice is awarded  1  point. If  a[i] < b[i] , then Bob is awarded  1  point. If  a[i] = b[i] , then neither person receives a point. Comparison points is the total points a person earned. Given  a  and  b , determine their respective comparison points. Example a = [1, 2, 3] b = [3, 2, 1] For elements *0*, Bob ...
Read more

STAIRCASE | HACKERRANK | PROBLEM SOLVING | SOLUTION IN C

-
Image
  STAIRCASE Staircase detail This is a staircase of size  :                #           ##      ### #### Its base and height are both equal to  . It is drawn using  #  symbols and spaces.  The last line is not preceded by any spaces. Write a program that prints a staircase of size  . Function Description Complete the  staircase  function in the editor below. staircase has the following parameter(s): int n : an integer Print Print a staircase as described above. Input Format A single integer,  , denoting the size of the staircase. Constraints  . Output Format Print a staircase of size   using  #  symbols and spaces. Note : The last line must have   spaces in it. Sample Input 6 Sample Output                          #  ...
Read more

SMALLEST NUMBER OF NOTES (FLOW005): Codechef solution in C++

-
     SMALLEST NUMBER OF NOTES Problem Code:  FLOW005 Consider a currency system in which there are notes of six denominations, namely, Rs. 1, Rs. 2, Rs. 5, Rs. 10, Rs. 50, Rs. 100. If the sum of Rs.  N  is input, write a program to computer smallest number of notes that will combine to give Rs.  N . Input Format The first line contains an integer  T , total number of testcases. Then follow  T  lines, each line contains an integer  N . Output Format For each test case, display the smallest number of notes that will combine to give  N , in a new line. Constraints 1  ≤   T   ≤  1000 1  ≤   N   ≤  1000000 Sample Input 1  3 1200 500 242 Sample Output 1  12 5 7 Explanation Test Case  1 1 :  There are  8 8  games remaining. Out of these  8 8  games, if RCB wins  2 2  games, loses  4 4  games and draws the remaining  2 2 ...
Read more