Afford Medical Technologies Mern Full Stack Developer Interview Questions and Answers

Q1. Oops, c#, design , .net framework
Add your answer

Q1. Managerial, projects
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

It was an MCQ based test. Code Snippets as well as OOPS, OS, DBMS questions were there

Q1. How to implement a stack OS Questions Problem Solving Questions OOPS concepts DS questions
Add your answer

Q1. Smart Pointers About the project done in college
Add your answer

IT was basic question from string and array

Q1. Data structure question find all leaf node from tree.
Ans. 
Use depth-first search to traverse the tree and identify leaf nodes.
• Implement depth-first search algorithm to traverse the tree.

• Identify nodes with no children as leaf nodes.

• Store leaf nodes in an array for retrieval.
Answered by AI
Add your answer
Q2. Print sentence word in reverse order without using default function. eg: input:-> I live in New York. output:-> I evil ni weN kroY.
Ans. 
Reverse each word in a sentence without using default function.
• Split the sentence into words

• Iterate through each word and reverse it

• Join the reversed words back into a sentence
Answered by AI
Add your answer

Q1. Programming question :Fibonacci series using recursion.
Ans. 
Fibonacci series using recursion is a classic programming problem where each number is the sum of the two preceding ones.
• Define a recursive function that takes an integer n as input

• Base case: if n is 0 or 1, return n

• Recursive case: return the sum of the previous two Fibonacci numbers

• Call the function recursively with n-1 and n-2 until base case is reached
Answered by AI
Add your answer
Q2. Programming question: Find 1st 2nd and 3rd highest from array of integer.
Ans. 
Find 1st, 2nd, and 3rd highest integers from an array.
• Sort the array in descending order.

• Retrieve the first three elements from the sorted array.

• Handle cases where array length is less than 3.
Answered by AI
Add your answer

Q1. They asked Puzzle
Add your answer

Q1. Salary Discussion
Add your answer

Q1. Question on Template concept in c++
Add your answer
Q2. Questions related to string
Add your answer

Q1. Input output pointers related
Add your answer
Q2. Polymorphism,casting class,
Add your answer

Q1. Data structure used for snake and ladder
Add your answer

Q1. Totally Resume based, be prepared for all the projects u have put on resume.
Add your answer
Q2. Tell me about the projects & mostly managerial questions.
Add your answer