Wipro says may ask some staff to go on leave, no layoffs

The company's CFO Jatin Dalal and President & Chief Human Resources Organisation (CHRO) Saurabh Govil spoke to CNBC-TV18 soon after the company declared its fourth-quarter earnings.
"There are many indications to show that the pandemic is worse than the global financial meltdown," said Dalal. "In 15 days alone, due to just the discontinued operations, we have seen a 0.7-0.8% hit to the business".

Govil said that the company could look at various options to cut costs. "We will look at if people can go on furloughs and leaves. If sub-contractor costs can come down and if we can deploy people there. We will have to cut costs wherever possible. These are tough times and we may have to take tough decisions."

Wipro's fourth-quarter net profit 6 percent sequentially to Rs 2,345 crore. Revenues rose marginally to Rs 15,296 crore. It also suspended its formal guidance citing uncertainty.
The outbreak of the novel coronavirus pandemic prompted the company to quickly get its employees to work from home.

CEO Abidali Neemuchwala said in a press conference that even with 93% employees working from home, the company was able to see its utilisation rise by 3 percent.

"We have provided stability to customers, it has reflected in annual customer satisfaction. Wiproites have adopted to new normal. Virtual collaborations have increased significantly," he said. "We have created models where employee performance can be as strong as it is when in office."
Still, the hit to revenues means the company has had to suspend all hirings, promotions and increment.

Wipro said it would honour all campus offers made so far in FY20 even though the on-boarding may be delayed. 

During the third quarter, Wipro had said it had doubled its campus hirings to 6,000 this year.
Yet, the outlook on FY21 remains unclear. "There is no reason why the company cant hire freshers this year, considering the long-term relationship with colleges but the decision on how many will be taken and when it will be done only after the impact on the company is more clear," Govil told CNBC-TV18.

The company has also formed three three task forces: for crisis management and business community, to gain market share, and deal with the human resources CSR.
The intention behind this blog is to help all my fellow programmers. Also to provide solutions for various coding platform problems with solution and explanation. I will add many tutorials in future. I am not a professional blogger but whenever time permits I will post. I hope you’ll enjoy the content and find it useful! Check out my Writer blog for a more valuable quotes. For any queries or suggestions, please feel free to reach out to me. Happy coding!

Comments

Post a Comment

Popular posts from this blog

First Unique Character in a String

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. Note: You may assume the string contain only lowercase letters. class Solution {     public int firstUniqChar(String s) {         int length = s.length();         String str;         for(int i=0;i<length;i++){             if(i==length-1){                 str = s.substring(0, i);             }             else{                 str = s.substring(0,i)+s.sub...
Read more

Balanced Binary Tree

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the left and right subtrees of  every  node differ in height by no more than 1. Example 1: Input: root = [3,9,20,null,null,15,7] Output: true Example 2: Input: root = [1,2,2,3,3,null,null,4,4] Output: false Example 3: Input: root = [] Output: true   Constraints: The number of nodes in the tree is in the range  [0, 5000] . -10 4  <= Node.val <= 10 4 Solution: /**  * Definition for a binary tree node.  * public class TreeNode {  *     int val;  *     TreeNode left;  *     TreeNode right;  *     TreeNode() {}  *     TreeNode(int val) { this.val = val; }  *     TreeNode(int ...
Read more

Majority Element

Given an array of size n , find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array. Example 1: Input: [3,2,3] Output: 3 Example 2: Input: [2,2,1,1,1,2,2] Output: 2   class Solution { public int majorityElement(int[] nums) { Arrays.sort(nums); return nums[nums.length/2]; } } Here, we are sorting the entire array using sort() of Arrays class. Then, number at index position n/2 would be a majority element. There is no chance of wrong values in odd or even length.   Below is another method using HashMap. METHOD 2: class Solution { public int majorityElement(int[] nums) { HashMap<Integer, Integer>list = new HashMap<Integer, Integer>(); int ...
Read more

Sequential Digits

An integer has sequential digits if and only if each digit in the number is one more than the previous digit. Return a sorted list of all the integers in the range [low, high]  inclusive that have sequential digits. Example 1: Input: low = 100, high = 300 Output: [123,234] Example 2: Input: low = 1000, high = 13000 Output: [1234,2345,3456,4567,5678,6789,12345] Constraints: 10 <= low <= high <= 10^9 class Solution {     public List<Integer> sequentialDigits(int low, int high) {         List<Integer> result = new ArrayList();         String str = "123456789";         int i, j, length = str.length(), num;         for( i = 2; i <= length; i++) {             for( j = 0; j <= length - i; j++) {      ...
Read more