ZOHO Overall Interview Questions + Coding Solutions – codewindow.in

Hot Topics

Topics

Introduction
Time Complexity
Stack
Stack using Queue
Stack Using Single Linked List:
Stack Using Double Linked List:
Infix To Postfix
Queue
Queue using Stack
Queue Using Single Linked List:
Queue Using Double Linked List:
Dequeue
Circular Queue
Singular Linked List:
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Double Linked List:
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Circular Linked List
Searching
Linear Search
Binary Search
Jump Search
Interpolation Search
Exponential Search
“Sublist Search
(Search a linked list in another list)”
Fibonacci Search
The Ubiquitous Binary Search
“Recursive program to linearly search
an element in a given array”
Recursive function to do substring search
“Unbounded Binary Search Example
(Find the point where a monotonically increasing
function becomes positive first time)”
Sorting
Selection Sort
Bubble Sort
Recursive Bubble Sort
Insertion Sort
Recursive Insertion Sort
Merge Sort
Iterative Merge Sort
Quick Sort
Iterative Quick Sort
Heap Sort
Counting Sort
Radix Sort
Bucket Sort
ShellSort
TimSort
Comb Sort
Pigeonhole Sort
Cycle Sort
Cocktail Sort
Strand Sort
Bitonic Sort
Pancake sorting
Binary Insertion Sort
BogoSort or Permutation Sort
Gnome Sort
“Sleep Sort –
The King of Laziness / Sorting while Sleeping”
Structure Sorting (By Multiple Rules) in C++
Stooge Sort
Tag Sort (To get both sorted and original)
Tree Sort
Cartesian Tree Sorting
Odd-Even Sort / Brick Sort
QuickSort on Singly Linked List
QuickSort on Doubly Linked List
3-Way QuickSort (Dutch National Flag)
Merge Sort for Linked Lists
Merge Sort for Doubly Linked List
3-way Merge Sort
Polynomial Functions
Recursion
Factorial Using Recursion:
Fibonacci Using Recursion:
GCD Using Recursion:
Tower of Hanoi Using Recursion:
N Queen Problem
Knapsack Problem
Tree
Graph
BFS
DFS

ZOHO Solution

Technical Round

What is the difference between interface and abstract class?

Interface
Abstract class
1.    Interface supports the concept of multiple inheritance.
Abstract class doesn’t support the concept of multiple inheritance.
2.    Interface has only abstract methods.
Abstract class can have non-abstract method but it must have at least one abstract method.
3.    Interface keyword is used to declare interface
Abstract keyword is used to declare Abstract class.
4.    Interface has members as public by default.
Abstract class in Java can have private, protected, public and default class members.
5.    Interface supports multiple inheritance.
Abstract class does not support multiple inheritance.
 

Tell me about your project.

Tell about Your Project.

Which programming language are you most comfortable with?

Tell the programming language with which you are most comfortable as interviewer may have follow up questions from that language.

Write a code for the palindrome of a number.

#include<stdio.h>

int main() {
    int n,m,sum=0,temp;
    printf("Enter the number you want to check\n");
    scanf("%d",&amp;n);
    
    temp=n;
    while(n&gt;0){
        m=n%10;
        sum=(sum*10)+m;
        n=n/10;
    }
    
    if(temp==sum){
        printf("It's a palindrome number");
    }
    else{
        printf("It's not a palindrome number");
    }

    return 0;
}
/*
output:
Enter the number you want to check:121
121 , It's a palindrome number
*/

Write a code for the factorial of a number.

#include<stdio.h>
int fact(int);

int main()
{
    int n=5;
    printf("%d",fact(n));

    return 0;
}

int fact(int n){
    if(n==1){
        return 1;
    }
    
    return n*fact(n-1);
}

/*
OUTPUT:
120
*/

How will you declare a function in C?

To declare a function in C we at first need to declare the prototype of function before main function and then after main function ends we will write the function.

What is inheritance?

Inheritance is a mechanism in which an object acquires properties from its parent object. 

What was your recent technical project that you worked on? What were your key responsibility?

Tell about the project you recently worked on and also tell the part of the project on which you have worked on.

What is the use of printf() and scanf() functions?

printf() - printf function is used to print character stream of data on stdout console.
scanf() - scanf function is used to read formatted input from stdin. It returns the whole number of characters written in it otherwise, returns a negative value. 

What is the static variable? What is its use?

A static variable creates a single copy of the variable and is shared among all the objects at a class level.

What is the difference between call by value and call by reference?

Call By Value
Call By Reference
1.    When a copy of a value is passed to the function, then the original value is not modified.
When a copy of value is passed to the function, then the original value is modified.
2.    Actual arguments and formal arguments are created in separated memory locations.
Actual arguments and formal arguments are created is same memory location.
3.    In this case, actual argument remain safe as they cannot be modified.
In this case, actual arguments are not reliable, as they are modified.
4.    The copied of the actual arguments are passed to the formal arguments.
The address of actual arguments are passed to their respective formal arguments
 

What is recursion in C?

Recursion is a self-calling function with a terminating condition.

What is NULL pointer and far pointer?

NULL pointer is a pointer that is pointing to nothing. NULL pointer points to empty location in memory. The value of NULL pointer is 0.
Far pointer is a 32-bit pointer that can access information which is outside the computer memory.

What is a dangling pointer? How is it overcome?

A pointer that points to a non-existing memory location is called a dangling pointer. To avoid dangling pointer we can initialize the pointer to the NULL value.

What is an infinite loop?

A loop that never terminates and repeats indefinitely is called infinite loop.

What is a command line argument?

Argument that is passed before compilation of the program.

Can we compile the program without the main function?

Compilation of a program without main() function is possible but it uses main() function indirectly.

What is an object and class?

Object: An object is the reality of the class after creation of which we can access the data members and member functions of the classes. Object memory will be occupied separately.
 
Class: A class in Java is a blueprint which includes all your data. A class contains fields (variables) and methods to describe the behaviour of an object.

Nagarro Solved

Automata Fixing

      

Popular Category

Hot Topics

Topics

Introduction
Time Complexity
Stack
Stack using Queue
Stack Using Single Linked List:
Stack Using Double Linked List:
Infix To Postfix
Queue
Queue using Stack
Queue Using Single Linked List:
Queue Using Double Linked List:
Dequeue
Circular Queue
Singular Linked List:
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Double Linked List:
1. Insert First
2. Insert Last
3. Delete First
4. Delete Last
5. Insert After a Value
6. Insert Before a Value
7. Insert After Position
8. Insert Before Position
9. Delete After a Value
10. Delete Before Value
11. Delete Position
12. Display
13. Reverse Display
14. Physically Reverse Display
15. Free All Nodes
16. Node Count
17. Delete First nth Nodes
18. Delete Last nth Nodes
Circular Linked List
Searching
Linear Search
Binary Search
Jump Search
Interpolation Search
Exponential Search
“Sublist Search
(Search a linked list in another list)”
Fibonacci Search
The Ubiquitous Binary Search
“Recursive program to linearly search
an element in a given array”
Recursive function to do substring search
“Unbounded Binary Search Example
(Find the point where a monotonically increasing
function becomes positive first time)”
Sorting
Selection Sort
Bubble Sort
Recursive Bubble Sort
Insertion Sort
Recursive Insertion Sort
Merge Sort
Iterative Merge Sort
Quick Sort
Iterative Quick Sort
Heap Sort
Counting Sort
Radix Sort
Bucket Sort
ShellSort
TimSort
Comb Sort
Pigeonhole Sort
Cycle Sort
Cocktail Sort
Strand Sort
Bitonic Sort
Pancake sorting
Binary Insertion Sort
BogoSort or Permutation Sort
Gnome Sort
“Sleep Sort –
The King of Laziness / Sorting while Sleeping”
Structure Sorting (By Multiple Rules) in C++
Stooge Sort
Tag Sort (To get both sorted and original)
Tree Sort
Cartesian Tree Sorting
Odd-Even Sort / Brick Sort
QuickSort on Singly Linked List
QuickSort on Doubly Linked List
3-Way QuickSort (Dutch National Flag)
Merge Sort for Linked Lists
Merge Sort for Doubly Linked List
3-way Merge Sort
Polynomial Functions
Recursion
Factorial Using Recursion:
Fibonacci Using Recursion:
GCD Using Recursion:
Tower of Hanoi Using Recursion:
N Queen Problem
Knapsack Problem
Tree
Graph
BFS
DFS

We Love to Support you

Go through our study material. Your Job is awaiting.

Categories