Hexaware PGET Technical Interview Questions

Hexaware PGET Technical Interview Questions and Answers 2023

Find the latest Hexaware PGET Technical Interview Questions asked Answers to 2023 passouts.

Page Highlights:-

  • Hexaware PGET Test pattern
  • Hexaware PGET Technical Interview Questions

Hexaware PGET Test Pattern

Hexaware Section No of Questions Total Time Difficulty Level Importance
Quants 15 45 mins(shared) Medium High
Logical 15 45 mins(shared) Medium High
Verbal 15 45 mins(shared) Medium High
Domain-based
  • Pseudo Code: 15 ques
  • Computer Fundamentals: 15 ques
30 mins High High
Coding 2 60mins High High

Hexaware PGET Technical Interview Questions

Question 1: What do you mean by DBMS?

Answer:

A database management system is just a technique for storing computerized data. Users of the system are given the option to utilize the system to do a wide range of tasks, such as maintaining the database’s organizational structure or modifying the data therein.

Question 2: What do you mean by threads in Operating System?

Answer:

The lowest processing unit that an operating system can handle is a thread. In the majority of modern operating systems, a thread is a part of a process, hence a process may have a number of threads.

Question 3: Write a code for finding the maximum number of handshakes.

Questions 4: What are stacks and queues?

Answer:

Stack: A stack is a linear data structure in which elements can only be added to and deleted from the top side of the list. The Last In First Out (LIFO) principle, which says that the element placed last is the first to be removed, controls how a stack functions.

Queue: A queue is a linear data structure in which elements can only be added from one side of the list (the back) and deleted from the other side (the front). The queue data structure follows the FIFO (First In First Out) principle, which stipulates that the element added to the list first is the first to be removed from the list.

Question 5: What are semaphores?

Answer:

A semaphore is a synchronization object used in a parallel programming environment to limit access by numerous processes to a shared resource. Semaphores are frequently used to control file and shared memory access.

Question 6: What is a peep stack?

Answer:

Peek Stack () is a stack function that can also be called an operation. It returns the value of the topmost member in the stack without removing it from the stack.

Question 7: What are the different types of Schedulers in OS?

Answer:

A scheduler can be divided into 3 types:

  • Long Term Scheduler
  • Short Term Scheduler
  • Medium Term Scheduler

Question 8: What are the basic clouds in cloud computing?

Answer:

There are three types of clouds:

  • Professional cloud
  • Personal cloud
  • Performance cloud

Questions 9: What are multiple inheritances?

Answer:

A derived class may have numerous base classes from which it inherits properties in the event of multiple inheritances.

Question 10: Write a program to find the roots of a quadratic equation.

Question 11: What is exception handling?

Answer:

Exception Handling in Java is one of the most effective methods for managing runtime faults while maintaining the application’s normal flow. Runtime errors are handled by the Java Exception Handling framework.

Question 12: Write a program to print ASCII code for a character using JAVA.

//Java program to print ASCII values of a character

import java.util.Scanner;
class Main
{
public static void main(String[] args)
{
//scanner class object creation

char c='A';

//typecasting from character type to integer type
int i = c;

//printing ASCII value of the character
System.out.println("ASCII value of "+c+" is "+i);

}
}


Question 13: What are the characteristics of Deep Learning?

Answer:

The major characteristics of deep learning are:

  • Healthcare
  • Image Recognition
  • Stock Analysis
  • News Analysis
  • Fraud Detection
  • Self Driving Cars

Question 14: What is a “Default Gateway”?

Answer:

The default gateway is the IP address of the network’s router. If the user desires to connect to another network or is unable to locate their specific network, their inquiry will be forwarded to the default gateway.

Question 15: What is a Class in OOPs?

Answer:

A class describes the outline of an object and has a fixed data type that the user defines. A class defines the functions, variables, constants, and other functionality of its members. It uses no RAM while running. A class can exist without an object, but an object cannot exist without the class.

Question 16: What is a pointer?

Answer:

A pointer is a variable that stores the address of a value stored in memory.

Question 17: What do you mean by FIFO?

Answer:

First in, first out (FIFO) is a data structure management technique that prioritizes the oldest element and processes the newest element last.

Question 18: What is synchronization?

Answer:

Synchronization is the ability to manage multiple threads’ access to any shared resource. Both procedures and blocks are referred to be “synchronized.” If a method is tagged as synchronized, only one thread may execute it on the supplied object at a moment. The main advantage of synchronized keywords is that we can prevent data inconsistency problems.

Question 19: Write a Java Program to Check Leap Year or not.

// Leap year program in Java
// If the year satisfies either of the conditions, it's considered a leap year -
// 1. The year must be divisible by 400.
// 2. The year must be divisible by 4 but not 100.
public class Main{
public static void main (String[]args)
{

int year = 2020;

if (year % 400 == 0)
System.out.println (year + " is a Leap Year");

else if (year % 4 == 0 && year % 100 != 0)
System.out.println (year + " is a Leap Year");

else
System.out.println (year + " is not a Leap Year");

}
}

Question 20: Write a code for Heap sort.

#include

using namespace std;

void heapify(int arr[], int n, int i)
{
int largest = i;
int l = 2*i + 1;
int r = 2*i + 2;

//If left child is larger than root
if (l < n && arr[l] > arr[largest])
largest = l;

//If right child largest
if (r < n && arr[r] > arr[largest])
largest = r;

//If root is nor largest
if (largest != i)
{
swap(arr[i], arr[largest]);

//Recursively heapifying the sub-tree
heapify(arr, n, largest);
}
}

void heapSort(int arr[], int n)
{

for (int i = n / 2 - 1; i >= 0; i--)
heapify(arr, n, i);

//One by one extract an element from heap
for (int i=n-1; i>=0; i--)
{
//Moving current root to end
swap(arr[0], arr[i]);

//Calling max heapify on the reduced heap
heapify(arr, i, 0);
}
}

//Function to print array
void display(int arr[], int n)
{
for (int i = 0; i < n; i++)
{
cout << arr[i] << "\t";
}
cout << "\n";
}

int main()
{
int arr[] = {1, 14, 3, 7, 0};
int n = sizeof(arr)/sizeof(arr[0]);
cout << "Unsorted array \n";
display(arr, n);

heapSort(arr, n);

cout << "Sorted array \n";
display(arr, n);
}