Table of contents

Easy Level

Intermediate Level

Hard Level

Conclusion

Last Updated: Mar 27, 2024

Easy

Top Coding Questions Asked in Josh Software

Author Nidhi Kumari

Do you think IIT Guwahati certified course can help you in your career?

Yes

Gautam Rege and Sethupati Asokan founded Josh Software in 2007. Josh Software offers solutions for both the web and mobile platforms. It provides specialised enterprise software development services. It is a software design firm focusing on the Ruby on Rails programming language. It constructs, designs, implements, and maintains web applications.

In this article, we will discuss the top coding questions asked in Josh Software. We will discuss the conceptual and programming aspects asked in the Josh Software coding round questions.

Also see, Interpolation in Angular

Easy Level

This section will discuss a few easy-level josh software coding round questions. Don’t skip this part, as it will develop a basic understanding of the josh software coding round questions.

Que 1. Why are Data Structures Created?

Ans: A system uses data structures for a variety of essential purposes.

They guarantee that each line of code carries out its intended function accurately and effectively.
They assist the programmer in locating and fixing bugs in their code.
They support the development of a clean and well-structured code base.

Que 2. What do you mean by Dynamic Data Structure?

Ans: Dynamic data structures can grow and shrink while a program is executed. Because it adjusts according to the size of the data to be altered, it offers a remarkably versatile data manipulation technique.

Que 3. What do you mean by Deque?

Ans: A deque(double-ended queue) is a queue with two ends. This structure allows for the addition or removal of elements from either end.

Que 4. What do you mean by Recursion?

Ans: A function that calls itself based on a termination condition is said to be recursive. Because LIFO is employed, the stack data structure is used.

Que 5. What do you mean by Stack Data Structure?

Ans: The stack is made up of several items repeatedly put to the top and eventually removed from it. The state of an app at a specific time is represented by a data structure called a stack. There are two operations in the Stack: Push and Pop. Stack follows LIFO( Last In First Out).

In real life, a stack of dishes stacked on top of one another may illustrate how the element added last will appear first.

Que 6. What are some applications of Stack Data Structure?

Ans: Here are a few uses for the stack data structure:

As recursive processes take place, it serves as temporary storage.
Used in reversing a string.
The matching of Parentheses.
Function Call Order.
Expressions for Postfix to Infix.

Que 7. What do you mean by Queue Data Structure?

Ans: Users can systematically store items in a list using a queue, which is a linear data structure. Until the end of the queue is full, more items are added; once that happens, the front of the queue is then cleared of the items. It means the queue follows FIFO( First In first out). Any line of users waiting to access a resource where the first user is served first is an excellent example of a queue.

Que 8. What are some applications of Queue Data Structure?

Ans: Here are a few uses for the queue data structure:

Graph search algorithm using breadth-first search(BFS).
Call centre call handling.
Scheduling of tasks, disc and CPU planning, etc.

Que 9. What do you mean by Linked List Data Structure?

Ans: One way to describe a linked list is as a collection of linked nodes (or objects) connected by links (or paths). Nodes are created in a specific order, which determines the order in which they are added to the list.

Que 10. What do you mean by Hash Map Data Structure?

Ans: If you know the key, a hashmap data structure that employs an implementation of a hash table data structure allows you to access data with constant time (O(1)) complexity.

Intermediate Level

This section will discuss a few easy-level josh software coding round questions.

Que 11. Which is the best Sorting Algorithm?

Ans: There are many different kinds of sorting algorithms, including bubble, fast, balloon, merge, quick, heap, radix, and more.

Because each algorithm was created for a specific type of data structure where it works best, none of them can be regarded as the best. Still, Quicksort is generally considered the fastest Sorting algorithm. Quicksort has O(nlogn) time complexity in the average case.

Que 12. Describe the process for storing a variable in memory.

Ans: A variable is stored in memory depending on how much memory is required. The steps to be used to store a variable are as follows:

First, the necessary amount of RAM is allocated.
According to the chosen data structure, it is then stored.
Utilising ideas like dynamic allocation ensures excellent efficiency and real-time access to storage units based on demand.

Que 13. What do you mean by Multithreading?

Ans: Multithreading is the ability of a program to handle the concurrent use of several users. It can even handle multiple requests from the same user without running multiple software instances.

Given that the threads must share the processing units, CPU caches, and translation lookaside buffer(TLB) of a single core, these systems differ from multiprocessing systems. The hardware in central processing units can efficiently handle running many threads.

Que 14. Describe The Difference Between A Process And A Thread using real-life Examples.

Ans: The interviewer can also ask real-life examples to check your conceptual understanding of Josh Software coding questions.

Processes have their address, whereas threads share the address space of the originating process.
Processes must employ interprocess communication to communicate with other processes; threads can communicate directly with other threads of their process.
Processes have their copy of the data segment of the parent process, whereas threads have direct access to the data segment of its process.
Creating new processes requires duplicating the parent process; creating new threads is simple.
Processes have a significant overhead, while threads have nearly none.
While processes can only influence their child processes, threads can exert significant control over threads of the same process.

Creating a process involves activities like starting a new browser (like Chrome, etc.). A whole new process will now begin to run. Think of a different scenario where a web browser uses multiple threads, some displaying graphics or videos and others retrieving data from the internet. Therefore, a single application must carry out a number of related activities in parallel. Through parallelism, thread helps the application.

Que 15. List the valuable tasks supported by Stacks.

Ans: Stack serves the following four main computing areas:

Dynamically allocated local variable storage.
Expression evaluation.
Subroutine parameter passing.
Subroutine return address storage.

Hard Level

This section will discuss a few easy-level josh software coding round questions.

Que 16. How to Write a Class In C++ Using Only One Object?

Ans: When the second object is created, the program is terminated.

class singleton {
  static int count;
  singleton() {
    if (count == 1) {
      exit(0);
    }
    count++;
  }
}
singleton::count = 0;
void main() {
  singleton s1;
  singleton s2;
}

You can also try this code with Online C++ Compiler

Run Code

Que 17. How do you determine if a string is a palindrome or not?
Ans: If a string's reverse is the same as the original, it is said to be a palindrome.

For example, level, abcba, baab etc.

#include <bits/stdc++.h>
using namespace std;


int main(){
    string str1;
    int flag = 0;
    
    cout << "Enter a string: "; cin >> str1;
    
    int length = str1.length();
    
    for(int i = 0; i < length; i++){
        if(str1[i] != str1[length - i - 1]){
            flag = 1;
            break;
           }
        }
    
    if (flag) {
        cout << str1 << " is not a palindrome." << endl; 
    }    
    else {
        cout << str1 << " is a palindrome." << endl; 
    }
    
    return 0;
}

You can also try this code with Online C++ Compiler

Run Code

Input:

Enter a string: level

You can also try this code with Online C++ Compiler

Run Code

Output:

 level is a palindrome.

You can also try this code with Online C++ Compiler

Run Code

Input:

Enter a string: coding

You can also try this code with Online C++ Compiler

Run Code

Output:

coding is not a palindrome.

You can also try this code with Online C++ Compiler

Run Code

Que 18: In Java, how do you reverse a string?

Ans: We can reverse the string using the reverse iteration. We can also use the StringBuffer or StringBuilder classes to reverse a string in Java.

public static void main(String[] arg) {

  // declaring the variable
  String input = "Coding";
  
  // creating StringBuilder object
  StringBuilder sv = new StringBuilder();
  
  // append a string into StringBuilder variable(sv).
  sv.append(input);
  
  // reverse is an inbuilt method in StringBuilder to use reverse the string 
  sv.reverse();
  System.out.println("The Reversed String is: " + sv);
}

You can also try this code with Online Java Compiler

Run Code

Output:

The Reversed String is: gnidoC

You can also try this code with Online Java Compiler

Run Code

Que 19. Implement the Insertion Sort Algorithm.

Ans: The interviewer often asks about implementing sorting algorithms in josh software coding round questions.

#include <bits/stdc++.h>
using namespace std;
 
void insertionSort(int A[], int n)
{
    int i, key, j;
    for (i = 1; i < n; i++)
    {
        key = A[i];
        j = i - 1;
 
        while (j >= 0 && A[j] > key)
        {
            A[j + 1] = A[j];
            j = j - 1;
        }
        A[j + 1] = key;
    }
}
 
void printResult(int A[], int n)
{
    int i;
    for (i = 0; i < n; i++)
        cout << A[i] << " ";
    cout << endl;
}
 
// Driver code
int main()
{
    int A[] = { 22, 21, 23, 25, 26, 24 };
    int n = sizeof(A) / sizeof(A[0]);
 
    insertionSort(A, n);
    printResult(A, n);
 
    return 0;
}

You can also try this code with Online C++ Compiler

Run Code

Output:

21 22 23 24 25 26

You can also try this code with Online C++ Compiler

Run Code

Que 20. How do you print a Fibonacci series using Recursion?

Ans: Each number in the Fibonacci sequence is the sum of the two numbers that arrived before it. It starts with 0 and 1. The numbers 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, etc, constitute the Fibonacci sequence.

#include <iostream>
using namespace std;
int fibo(int n) {
  // Recursive function for Fibonacci
  // Base case
  if ((n == 1) || (n == 0)) {
    return (n);

  } 
  
  else {
    // Recursive call to n - 1 and n - 2 elements
    return (fibo(n - 1) + fibo(n - 2));
  }
}

int main() {
  int n;
  cout << "Enter the number: ";
  cin >> n;
  cout << "\n The resultant Fibonacci Series: ";


  int i = 0;
  while (i < n) {
    cout << " " << fibo(i);
    i++;
  }
  return 0;
}

You can also try this code with Online C++ Compiler

Run Code

Output:

Enter the number: 5
The resultant Fibonacci Series:  0 1 1 2 3

You can also try this code with Online C++ Compiler

Run Code

Que 21. How to reverse a Linked List?

Ans: If the task is to reverse a linked list and a pointer to the head node of the list is provided. By changing the links between the nodes, the list must be reversed.

#include<bits/stdc++.h>
using namespace std;

// The node of the Linked list
struct ListNode {
  int data;
  struct ListNode * next;
  ListNode(int data) {
    this -> data = data;
    next = NULL;
  }
};

struct LinkedList {
  ListNode * head;
  LinkedList() {
    head = NULL;
  }
  // Function to reverse the linked list
  ListNode * reverse(ListNode * head) {
    if (head == NULL || head -> next == NULL)
      return head;


    // Recursive call to reverse the linked list
    ListNode * rest = reverse(head -> next);
    head -> next -> next = head;


    head -> next = NULL;


    return rest;
  }


  // Function to print the linked list
  void print() {
    struct ListNode * temp = head;
    while (temp != NULL) {
      cout << temp -> data << " ";
      temp = temp -> next;
    }
  }


  void push(int data) {
    ListNode * temp = new ListNode(data);
    temp -> next = head;
    head = temp;
  }
};


int main() {
  LinkedList ll;
  ll.push(1);
  ll.push(2);
  ll.push(3);
  ll.push(4);


  cout << "Given Linked List:\n";
  ll.print();
  ll.head = ll.reverse(ll.head);

  cout << "\n Reversed Linked List: \n";
  ll.print();
  return 0;
}

You can also try this code with Online C++ Compiler

Run Code

Output:

Given Linked List:
4 3 2 1 
Reversed Linked List: 
1 2 3 4

You can also try this code with Online C++ Compiler

Run Code

Conclusion

We have discussed the top coding questions asked in Josh Software coding round questions. We have discussed the conceptual and programming aspects asked in the Josh Software coding round questions.

This blog helped boost your confidence and increase your understanding of Josh Software coding round questions.