Skip to main content

Chakra Vyuh Bhedna, the only answer to how to crack group discussions!

 

Chakra Vyuh Bhedna, the only answer to how to crack group discussions!


Chakra Vyuh Bhedna, the only answer to how to crack group discussions!

Because of the pandemic, the placement drive was conducted virtually. And to add to the difficulty level, more than 200 students participated in the drive. The selection process consisted of an online test that included the aptitude and technical questions, which was followed by a group discussion. Both were elimination rounds. The shortlisted students were then called for the final round, the personal interview.

All about cracking group discussions and interviews

My strategy was to be attentive in the pre-placement talks by asking questions to them and even trying to answer their questions. This helped me to boost my self-confidence and made me perform well during the Group Discussion. For cracking group discussion, I practiced a simple and powerful technique called Chakra Vyuh Bhedna. It's a complete weapon to crack any GD. This technique has 4 parts. 

  1. Awareness of the topic
  2. Understanding PESTLE (Political, Economical, Social, Technical, Legal and Environmental) factors related to the topic
  3. Listening to what others are saying 
  4. Making a garland of flowers and beautifully concluding the topic 

Also, for GD, I downloaded and studied more than 50 reports including monthly reports of KPMG, McKinsey, Deloitte, CBRE, etc. related to infrastructure, crisis, and the economy.

For the interview, believe me, mocks and self-preparation helped me a lot. Moreover, self-awareness played a key role in nailing personal interviews apart from learning everything about the profile and the company. Because of this, I not only cleared the interview but even topped the merit list.

Making it into the Expressway company

APCO Infratech is a mid-sized company that recently bagged 8 Expressway projects. It's also known as Expressway company. My dream profile has always been Project Management. And I am lucky enough to fetch the profile of Management Trainee which will be followed by the profile of Assistant Manager in Contracts, Planning and Project Management at APCO Infratech. The team here is really good in management, knowledge, resources, and focus on learning aspects. The senior management has strong character and expertise in the infrastructure field.

Labels:

Comments

Post a Comment

Popular posts from this blog

C Program to Check Year is a Leap Year or Not

How to Check Year is a Leap Year or Not in C:- In this program we have to find the year is a leap year or not. Generally  we assume that year is exactly divisible by 4 is a leap year. But it is not only in this case 1900 is divisible by 4. But it  is not a leap so it that case we follows these conditions    It is exactly divisible by 100 If it is divisible by 100, then it should also exactly divisible by 4 And it is divisible by 400   These all conditions are true year is a leap year. ALGORITHMS:- Step 1 . Initialize variable “year” to find leap year. Step 2 . Take input from User. Step 3 . We use this condition ((year%4==0)&&            (year%100!=0)) || (year%400==0)) to check the year is Leap or not. S tep 4 . It is true display year i...
Post a Comment
Read more

Calculate the sum of elements in an array.

  HOW TO CALCULATE THE SUM OF THE ELEMENT IN A GIVEN ARRAY: - We will learn how to find the sum of elements in an array is an easy task when you know how to iterate through array elements. In this problem, we will explain your C approach to find the sum of array elements inputted by the user. Here is the solution to this query in C Languageguage.   ALGORITHMS: STEP 1:-   Input the size of the array and store the value in m and arr[m]. STEP 2 : - To store the sum of array elements, initialize a variable sum = 0. STEP 3: -To find the sum of all elements, iterate through each element  and add the current element to the sum. STEP 4: - Inside the loop add the current array element to sum i.e.                 sum = sum + arr[i] or sum += arr[i]. CODE:- #include <stdio.h> int  main() {      int  i,num,a[ 100 ],sum= 0 ;     printf( "Enter the value of number:...
Post a Comment
Read more

How to find the Tringle is Valid or Not in C

 How to find the Tringle is Valid or Not in C:- Code:- #include <stdio.h> int  main() {        int  side_1,side_2,side_3;        int  a,b,c;       printf( "enter the value of sides:" ); scanf( "%d\n %d\n %d" ,&side_1,&side_2,&side_3);       a= ((side_1*side_1)==((side_2*side_2)+(side_3*side_3)));       b= ((side_2*side_2)==((side_1*side_1)+(side_3*side_3)));       c= ((side_3*side_3)==((side_1*side_1)+(side_2*side_2)));       if  (a || b || c)      {         printf( "The triangle is valid" );      }       else      {...
Post a Comment
Read more