Skip to main content

PLACEMENT PREPARATION PLAN

 Hey guys!😃



The placement season is the toughest part that one faces in his life where you lose all your faith and confidence. First importantly you need to have three things in your mind.
             1.The ability to face rejections.
             2.A lot of patience.
             3.Never ever give up
              Luck is also an important factor that you have to start believing .
Here comes the academic part you need to cover for your placements:

1.APTITUDE-



Aptitude is most probably the first round that you need to face in interviews. Without clearing this , you could not reach the next step towards placements. Aptitude is of three parts:
         1.Quantative Aptitude
         2.Logical Reasoning
         3.Verbal Ability

So make sure you practice it from scratch to intermediate level. I can suggest you RS Aggarwal book for practicing aptitude. 



2.CODING:






Coding is also plays major role in placements. You need to be familiar with some basic languages like C, C++, Java, Python before entering coding rounds. Eventhough C is outdated ,it is being asked in coding rounds to test  our knowledge on the concepts like DS. So make sure you learn C/C++ added with Java/Python. You can enhance your coding skills by working in online compilers like Hackathon, Codechef, Hackerrank etc. You have to master competitive programming and also be ready for MCQs in coding. Each company varies in conducting coding rounds. It can be Snippets, Competitive programming etc.



3.TECHNICAL:






This round tests our knowledge towards technical subjects. DS, OOPs, OS, Software Engineering, Computer Networks , DBMs etc. will come under technical subjects. Theoretically, you can prepare for these subjects. Technical HR's ask questions from these subjects.




4.RESUME:







Resume is basically the summary about yourself along with your qualifications. Start by selecting the right resume format. Make sure it's unique, professional, free of errors, easy to read and creative. By reading, it must give a positive impression on you. 



                                         

                                    I have tried to make it  simple and easy to understand . Hope you guys got a blueprint  These are the important strategies that one must follow to get placed in PRODUCT COMPANIES.
                                     Follow us for more updates. You can also follow us in Instagram @techypink



                                    

                                            

                                                                                    ALL THE BEST👍

 
Labels:

Comments

Post a Comment

Popular posts from this blog

POST ORDER TRAVERSAL -- HACKERRANK SOLUTIONS

  Complete the   function in the editor below. It received   parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the   function. Constraints   Nodes in the tree    Output Format Print the tree's postorder traversal as a single line of space-separated values. Sample Input 1 \ 2 \ 5 / \ 3 6 \ 4 Sample Output 4 3 6 5 2 1 Explanation The postorder traversal is shown. Solution #include   < stdio.h > #include   < string.h > #include   < math.h > #include   < stdlib.h > struct  node {           int  data;      struct  node *left;      struct  node *ri...
Post a Comment
Read more

HACKERRANK -- DELETE A NODE AT A GIVEN POSITION

  HACKERRANK --  DELETE A NODE AT A GIVEN POSITION Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example After removing the node at position  ,  . Function Description Complete the  deleteNode  function in the editor below. deleteNode  has the following parameters: -  SinglyLinkedListNode pointer llist:  a reference to the head node in the list -  int position:  the position of the node to remove Returns -  SinglyLinkedListNode pointer:  a reference to the head of the modified list Input Format The first line of input contains an integer  , the number of elements in the linked list. Each of the next   lines contains an integer, the node data values in order. The last line contains an integer,  , the position of the node to delete. Constraints , wh...
Post a Comment
Read more

TREE PREORDER TRAVERSAL -- HACKERRANK SOLUTIONS

  Complete the   function in the editor below, which has   parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the  preOrder  function. Constraints  Nodes in the tree  Output Format Print the tree's preorder traversal as a single line of space-separated values. Sample Input 1 \ 2 \ 5 / \ 3 6 \ 4 Sample Output 1 2 5 3 4 6 Explanation The preorder traversal of the binary tree is printed. Solution #include   < stdio.h > #include   < string.h > #include   < math.h > #include   < stdlib.h > struct  node {           int  data;      struct  node *left;      struct ...
Post a Comment
Read more