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.

Awareness of the topic
Understanding PESTLE (Political, Economical, Social, Technical, Legal and Environmental) factors related to the topic
Listening to what others are saying
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.

Comments

HackerRank Tuples Solution in Python

HackerRank Tuples Solution in Python Task Given an integer,n, and n space-separated integers as input, create a tuple, t, of those n integers. Then compute and print the result of hash(t). Note: hash() is one of the functions in the __builtins__ module, so it need not be imported. Input Format The first line contains an integer,n, denoting the number of elements in the tuple. The second line contains n space-separated integers describing the elements in tuple t . Output Format Print the result of hash(t) . Sample Input 0 2 1 2 Sample OUTPUT- 3713081631934410656 n = int(input()) int_list = [int(i) for i in input().split()] int_tuple = tuple(int_list) print(hash(int_tuple))

How to check if the given number is Even or odd-

1. How to check if the given number is Even or odd- We can determine whether a number is even or odd. This can be tested using different methods. The test can be done using simple methods such as testing the number’s divisibility by 2. If the remainder is zero, the number is even. If the remainder is not zero, then the number is odd. The following algorithm describes how a C program can test if a number is even or odd. CODE:- #include <stdio.h> int main () { int num;//variable declaration printf("Enter any num: ");// take input from user scanf("%d",&num);// declare input if(num%2==0) { printf("The num %d is even",num); } else { printf("The num %d is odd",num); } return 0; } ALGORITHM:- Step 1. Start Step 2 . Enter a number. Step 3. If...

Binary to Decimal conversion program

3. Binary to Decimal conversion program using C language:- The C program converts binary number to decimal number that is equivalent. A decimal number can be attained by multiplying every digit of binary digit with a power of 2 and totaling each multiplication outcome. The power of the integer starts from 0 and counts to n-1 where n is assumed as the overall number of integers in a binary number. Ex:- ( 101100001 ) 2 =( 353 )10 ALGORITHMS:- Step 1: Start Step 3: The user is asked to enter a binary number as an input Step 4: Store the quotient and remainder of the binary number in the variable rem Step 5: Multiply every digit of the entered binary number beginning from the last with the powers of 2 correspondingly Step 6: Repeat the above step...

Code_with_chandan

Search This Blog