Wipro full stack developer interview questions ( 2024 Guide )

There are two agendas in every technology management organization: the IT agenda and the business transformation agenda. Traditionally, the IT agenda has focused on cost reduction. On the other hand, corporate digital transformation plans focus on profitability through investments.

The main advantage of hybrid cloud is its flexibility. To gain the agility needed to gain a competitive advantage, your business may want (or need) to integrate public clouds, private clouds, and on-premises resources.

• Data stored in a localStorage object does not have an expiration date. On the other hand, the sessionStorage object stores data from a single session.
• When the browser window is closed, the data in the localStorage object is not deleted. However, in the case of sessionStorage objects, the data is destroyed when the browser window is closed.
• SessionStorage data is only available in the current browser window. On the other hand, data from localStorage can be shared across multiple browser windows.

Code 1:

//C
#include<stdio.h>  
#include<conio.h>  
#define HRS 24      //Macro  
int main()  
{  
    printf("%d", HRS);  
    return 0;  
}   

Output:

24

Explanation:

In the above code, we have defined a macro named HRS whose value is 24. By calling the macro in the printf function, we can output a value of 24 on the terminal.

The above code can be deduced as the following code without using macros.

Code 2:

//C
#include<stdio.h>  
int hrs()  
{  
    return 24;  
}  
int main()  
{  
    printf("%d", hrs());  //calling  
    return 0;  
}  

Output :

 24

Explanation:

Here we have defined a function called HRS. When we call the HRS function in the printf function, the function returns 24 and hence 24 is printed on the output device.

Macros are preprocessed, which means all macros are processed before the code is compiled and functions are processed after the code is compiled.

Experience the power of our full stack development course with a free demo – enroll now!

• Object-oriented languages ​​comply with all object-oriented programming concepts, but object-based languages ​​do not comply with all object-oriented programming concepts such as inheritance, polymorphism, etc.
• Object-oriented languages ​​lack built-in objects, but based languages ​​do.
  For example, JavaScript contains a built-in window object.

• The free() function is a C library function that can also be used in C++, while the “delete” keyword is a C++ keyword.
• The delete operator deletes a pointer allocated using the new operator or a NULL pointer, while the free() function deletes a pointer allocated using malloc(), the calloc() or realloc() function, or a pointer NULL..
• The delete operator in C++ calls the class destructor when it destroys the allocated memory, not the free() function; this simply frees heap memory.

8. Explain copy constructor and assignment operator in C++.

A copy constructor is a member function that uses another object of the same class to instantiate an object. The assignment operator is used to assign a value to a variable. The left operand of the assignment operator is a variable, while the right operand of the assignment operator is a value.

 // C++
#include<iostream> 
#include<stdio.h> 
  
using namespace std; 
  
class IB
{ 
    public: 
    IB() {} 
    IB(const IB &b) 
    { 
        cout<<"Copy constructor is called "<<endl; 
    } 
      
    IB& operator = (const IB &b)
    {
        cout<<"Assignment operator is called "<<endl;
        return *this;
    } 
}; 
  
// Driver code
int main() 
{ 
    IB b1, b2; 
    b2 = b1; 
    IB b3 = b1; 
    getchar(); 
    return 0; 
} 

Output:

Assignment operator is called
Copy constructor is called

When a new object is created from an existing object as a copy of the old object, the copy constructor is called. When an initialized object receives a new value from another object, the assignment operator is used.

9. Get the nth Fibonacci number in O(n) time and O(1) space complexity.

//Javascript
function fib(n){
  let [x, y] = [0, 1]
  while (n > 0){
    [x, y] = [y, x + y]
    n -= 1
  }
  return x
}