Question

In: Psychology

Q no.3                                          &n

Q no.3                                                                                                                                     (5)

Impression Management Case Study

Recently you have been recruited at a well-known company. Your first job is to impress the boss with best impression management technique. You find out quickly your boss is “bossy”, who likes his authority and dislike when he is being challenged by employees. He expects his employees to given in best quality work on time and stay honest to their work roles and duties. One day during your first office meeting when your boss shared a new policy, you right away objected it and present a better an alternative policy. After when the meeting ended, your boss stick to his mentioned policy and rejected yours. You felt you made a mistake and made a bad impression on your boss and attendees. You though to yourself your boss never going to like you, and your will never get promotion so your life would be unsuccessful.

  • Pick an impression management technique from impression management taxonomy and give rational why is that technique would work in given case scenario?
  • Explain how would you implement that technique?
  • Identify and name cognitive error and how would you change it using cognitive restructuring technique.

Solutions

Expert Solution

Impression management techniques are those that help build an impression or restore a previous impression by an active measure that one seeks to implement. In the case above he must use the technique of Association. He could go to his boss and say something to effect of "After consideration I did realize that your plan is veritably the better suited one than what I had suggested and I respect that you took the decisions with full rigor." This would preserve the bosses ego and also initiate conformity, that he wishes.

The employee fell into the trap of one cognitive error which is labeled as magnification. Within this a person takes one instance, that is relatively small, and makes a very big deal about it than it deserves credit for. Which is the case above where he goes onto losing his job opportunities at the place and never bouncing back again and being unsuccessful for the rest of his life.

One way to restructure this thought process would be by questioning assumptions. This would help in thinking step by step and rationally to reach a better stated assumption.


Related Solutions

1. m •   (n • p) 2. (q   ⊃ ~t) • (~m v q) 3.   ~t...
1. m •   (n • p) 2. (q   ⊃ ~t) • (~m v q) 3.   ~t ⊃ z     : .     z
give a constructive proof of fn = Q^n + P^n/ Q - P , where Q...
give a constructive proof of fn = Q^n + P^n/ Q - P , where Q is the positive root and P is negative root of x^2 - x - 1= 0 fn is nth term of fibonacci sequence, f1 = 1 f2, f3 = f2 +f1, ... fn= fn_1 +fn_2 , n>2
Show that if P;Q are projections such that R(P) = R(Q) and N(P) = N(Q), then...
Show that if P;Q are projections such that R(P) = R(Q) and N(P) = N(Q), then P = Q.
Show that the map Q[X] → Q[X], sum^{n}{i=0}(a_nX^i) → sum^{n}{i=0}(a_n(2X + 3)^i) , is an automorphism...
Show that the map Q[X] → Q[X], sum^{n}{i=0}(a_nX^i) → sum^{n}{i=0}(a_n(2X + 3)^i) , is an automorphism of Q[X],
3)A random variable X~N(0,1). Find the value of q from the Normal Table such that P(X≤q)=0.2624....
3)A random variable X~N(0,1). Find the value of q from the Normal Table such that P(X≤q)=0.2624. (Round the result to 2 decimal places.) 4) A random variable X~N(0.11,0. 682 ). Find the probability P(X≤-0.98). (Round the result to 2 decimal places.) 5) A random variable T has t-distribution with degree of freedom 23. Find the t such that P(T≥t)=0.15. (Round the result to 4 decimal places.)
Let Q:= {1,2,...,q}. Let G be a graph with the elements of Q^n as vertices and...
Let Q:= {1,2,...,q}. Let G be a graph with the elements of Q^n as vertices and an edge between (a1,a2,...,an) and (b1,b2,...bn) if and only if ai is not equal to bi for exactly one value of i. Show that G is Hamiltonian.
Q: An existing asset A (defender), N*= 2 years for EUAC=$8,000. The cost at year 3...
Q: An existing asset A (defender), N*= 2 years for EUAC=$8,000. The cost at year 3 is 9,200 and expected to increased by 4% for the remaining life of the defender. A new asset B (challenger) that would provide the same function is available at N*= 5 years for EUAC=$10,000. Decide which year is eligible for replacement, using tax comparison with i= 10%.
A positive integer N is a power if it is of the form q^k, where q,...
A positive integer N is a power if it is of the form q^k, where q, k are positive integers and k > 1. Give an efficient algorithm that takes as input a number N and determines whether it is a square, that is, whether it can be written as q^2 for some positive integer q. What is the running time of your algorithm? write the pseudocode for the algorithm.
Prove that 3 divides n^3 −n for all n ≥ 1.
Prove that 3 divides n^3 −n for all n ≥ 1.
Prove or disprove that 3|(n 3 − n) for every positive integer n.
Prove or disprove that 3|(n 3 − n) for every positive integer n.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT