Zoho Technical Interview Questions

October 29, 2022

Zoho Technical Interview Questions 202

You should concentrate more on DSA, computer networks, C, C++, JAVA, Python, coding-related problems, and DBMS, along with some subject-related questions, in order to crack the technical round of the ZOHO Interview.

On this page, find the most recently asked technical questions as well as answers in the Zoho Technical Interview 2023.

Top 20 Zoho Technical Interview Questions

Question 1: How to tackle Overfitting and underfitting?

Answer:

Overfitting happens when a model overfits training data. In this case, we must resample the data and use techniques like k-fold cross-validation to assess model accuracy.

Underfitting occurs when we are unable to interpret or capture the patterns in the data; in this scenario, we must alter the procedures or add more data points to the model.

Question 2:- How does an Array work?

Answer:

Arrays can include elements of any primitive data type, including int, char, float, double, and more. Arrays can also store a collection of derived data types like pointers, structures, and so on. While storing the items in a contiguous manner, the lowest address corresponds to the array’s first element.

Question 3: What is a semiconductor?

Answer:

A semiconductor is a solid material with electrical conductivity between that of a conductor and that of an insulator.

Questions 4: What are the OOPS concepts in JAVA?

Answer:

The following are Java’s definitions of OOP concepts:

Abstraction.
Encapsulation.
Inheritance.
Polymorphism.

Question 5: What is Cutoff Frequency?

Answer:

A cutoff frequency, corner frequency, or break frequency is a frequency response threshold in physics and electrical engineering at which energy flowing into the system begins to be decreased rather than going through.

Question 6: What is a resistor?

Answer:

A resistor is a component of an electronic circuit that limits or regulates the passage of electrical current. Resistors can also be used to supply a fixed voltage to an active device such as a transistor.

Question 7: What do you mean by DOCTYPE?

Answer:

The first line of code in any HTML or XHTML page is the HTML document type declaration, commonly known as DOCTYPE. The DOCTYPE declaration tells the web browser what version of HTML the page is written in. This ensures that different web browsers parse the web page in the same way.

Question 8: What is Cross-Validation?

Answer:

Cross-validation divides your data into three parts:

Training
Testing
Validation

The data was separated into k subsets, and the model was trained on k-1 of those subsets.

The remaining portion is set aside for testing. This procedure is done for each subgroup. This is referred to as k-fold cross-validation. Finally, the overall score is computed by averaging the scores from all k-folds.

Question 9: What are the limitations while serving XHTML pages?

Answer

The biggest limitation is the lack of XHTML browser compatibility. XHTML cannot be parsed as XML by Internet Explorer or other user agents. As a result, it is not as flexible as one might imagine.

Question 10: What is the syntax of bulleted lists or unordered lists?

Answer:

The list items in an HTML unordered list are not in any particular order or sequence. Because the elements are indicated with bullets, an unordered list is also known as a Bulleted list. It begins with the ul> tag and ends with the /ul> tag. The list items are separated with the li> tag and conclude with the /li> tag.

Syntax:

List of Items

Question 11: Write a program to find the Fibonacci series up to nth terms using JAVA.

public class Main
 {
   public static void main (String[]args)
   {

     int num = 15;
     int a = 0, b = 1;

     // Here we are printing 0th and 1st terms
       System.out.print (a + " , " + b + " , ");

     int nextTerm;

     // printing the rest of the terms here
     for (int i = 2; i < num; i++)
       {
      nextTerm = a + b;
      a = b;
          b = nextTerm;
          System.out.print (nextTerm + " , ");
       }


   }
 }

Question 12: Write a program to check whether a number is a palindrome or not

// Palindrome program in C
#include 

// Palindrome is a number that is same if read forward/backward
// Ex : 12321
int main ()
{
    int num, reverse = 0, rem, temp;
    num=11211;
    printf("The number is :%d\n",num);
 
    temp = num;
    
    //loop to find reverse number
    while(temp != 0)
    {
        rem = temp % 10;
        reverse = reverse * 10 + rem;
        temp /= 10;
    };
    
    // palindrome if num and reverse are equal
    if (num == reverse)
        printf("%d is Palindrome\n", num);
    else
        printf("%d is Not Palindrome\n", num);

}
// Time Complexity : O(N)
// Space Complexity : O(1)
// Where N is number of digits in num

Question 13: Write a program to replace all 0’s with 1 in a given integer.

Answer:

Question 14: Write a program to count possible decoding of a given digit sequence using C++.

//C Program to Count possible decodings of a given digit sequence
#include
#include
#include
using namespace std;

int cnt_decoding_digits(char *dig, int a)
{
    // Initializing an array to store results     
    int cnt[a+1]; 
    cnt[0] = 1;
    cnt[1] = 1;

    for (int k = 2; k <= a; k++)
    {
        cnt[k] = 0;

        // If the last digit not equal to 0, then last digit must added to the number of words
        if (dig[k-1] > '0')
            cnt[k] = cnt[k-1];

        // In case second last digit is smaller than 2 and last digit is smaller than 7, then last two digits form a valid character
        if (dig[k-2] == '1' || (dig[k-2] == '2' && dig[k-1] < '7'))
            cnt[k] += cnt[k-2];
    }
    return cnt[a];
}

int main()
{
    char dig[15];
    cout<<"Enter the sequence : "; cin>>dig;
    int a = strlen(dig);
    cout<<"Possible count of decoding of the sequence : "<< cnt_decoding_digits(dig, a);
    return 0;
}

Question 15: Write a code for finding a linked list.

Answer:

Question 16: Write a program for balanced parenthesis problems using JAVA.

import java.util.*;
public
class Main {
    public
    static boolean balancedParenthesis(String str) {
        Stack stack = new Stack();
        for (int i = 0; i < str.length(); i++) {
            char x = str.charAt(i);
            if (x == '(' || x == '[' || x == '{') {
                stack.push(x);
                continue;
            }
            if (stack.isEmpty()) return false;
            char check;
            switch (x) {
                case ')':
                    check = stack.pop();
                    if (check == '{' || check == '[') return false;
                    break;
                case '}':
                    check = stack.pop();
                    if (check == '(' || check == '[') return false;
                    break;
                case ']':
                    check = stack.pop();
                    if (check == '(' || check == '{') return false;
                    break;
            }
        }
        return (stack.isEmpty());
    }
    public
    static void main(String[] args) {
        String str = "()(())";
        if (balancedParenthesis(str))
            System.out.println("True");
        else
            System.out.println("False");
    }
}

Question 17: Write a program for Kadane’s Algorithm.

Answer:

Question 18: Write a program to find rows with maximum no. of 1’s.

#include 

int main(){

   int mat[4][4] = {{0, 0, 0, 1}, 
                    {0, 1, 1, 1}, 
                    {1, 1, 1, 1}, 
                    {0, 0, 0, 0}};

   int max_count=0, index=-1;

   for(int i=0; i<4; i++){
     int count = 0;
     for(int j=0; j<4; j++){ 
         if(mat[i][j]==1) 
            count++; 
         
     } 
     if(count>max_count)
     {
        max_count = count;
        index = i;
     }
   }

   printf("Index of row with maximum 1s is %d", index);

}

Question 19: Write a program to find the last non-zero digit in factorial using C and JAVA.

JAVA

#include 
//Recursive function to calculate the factorial
int fact(int n){

   if(n <= 1) //Base Condition
   return 1;

   return n*fact(n-1);
}

//Driver Code
int main(){

   int n=5;
   int factorial = fact(n);

   while(factorial%10==0)
   {
        factorial /= 10;
   }

   printf("%d",factorial%10);
}

JAVA

class Main {
 
    // Method to find factorial of the given number
    static int factorial(int n)
    {
        if(n==0 || n==1)
        return 1;
        
        return n*factorial(n-1);
    }
 
    // Driver method
    public static void main(String[] args)
    {
        int num = 5;
        int fact = factorial(num);
        
        int res;
        
        while(fact%10==0){
            fact /=10;
        }
        
        System.out.println(fact%10);
    }
}

Question 20: Write a program to count inversion.

Answer:

Unlock this article for Free,
by logging in

Zoho Technical Interview Questions