GE Healthcare Interview Questions, Process, and Tips

Q1. What is call,bind,apply
Ans. 
call, bind, and apply are methods used to manipulate the value of 'this' in JavaScript functions.
• Call invokes a function with a specified 'this' value and arguments provided individually.

• Bind creates a new function that, when called, has its 'this' keyword set to the provided value.

• Apply invokes a function with a specified 'this' value and arguments provided as an array.

• All three methods are used to control the value o...read more
Answered by AI
Add your answer

Q1. Explain about angular,nodejs,expressjs
Ans. 
Angular is a front-end framework, Node.js is a back-end runtime environment, and Express.js is a web application framework for Node.js.
• Angular is used for building dynamic single-page applications (SPAs) with HTML, CSS, and TypeScript.

• Node.js is used for building scalable network applications and is based on the V8 JavaScript engine.

• Express.js is a minimal and flexible Node.js web application framework that provides a ...read more
Answered by AI
Add your answer

Q1. About Ge healthcare ,culture,salary
Add your answer

Q1. More about ge healthcare
Add your answer

It was an aptitute cum coding test round.
2 questions were given in coding part - 1 easy & 1 medium

Q1. It was an one on one round on technical knowledge. Questions were asked about only about OOPS and classes.
Add your answer

Q1. Asked questions about my projects and CV.
Add your answer

Q1. It was one on one round in which basic HR questions were asked which you can easily find on internet.
Add your answer

Q1. About your projects
Add your answer
Q2. Tell me about yourself
Add your answer

Two Easy questions to be solved

Q1. Some Technical based questions
Add your answer
Q2. It was amazing . Interviewer asked me to code for heap sort and asked me to explain.
Add your answer
Q3. Write a code for heap sort algorithm and explain it?
Ans. 
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• Heap sort works by building a binary heap from the array and then repeatedly extracting the maximum element and placing it at the end of the array.

• The heap is maintained as a complete binary tree, where each parent node is greater than or equal to its children.

• The time complexity of heap sort is O(n log n) and it is an in-place sor...read more
Answered by AI
Add your answer

Simple aarray problems

Q1. Multi threading concepts
Add your answer
Q2. Java concepts with some code to finished
Add your answer