Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Virohan Team. If you also belong to the team, you can get access from here

Virohan Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Virohan Medical Laboratory Technician Interview Questions and Answers

Updated 25 May 2022

Virohan Medical Laboratory Technician Interview Experiences

1 interview found

I applied via Job Fair and was interviewed in Apr 2022. There were 2 interview rounds.

Interview Preparation Tips

Interview preparation tips for other job seekers - To makes sure first'study for the resume skill highlights than will be diccuss to oral to speak clearly explain to easy word that's my opinion

Interview questions from similar companies

Interview Preparation Tips

Interview preparation tips for other job seekers - Lab technician recommend job
How much can you salary?
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in May 2024. There was 1 interview round.

Interview Preparation Tips

Interview preparation tips for other job seekers - Lab Technician
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Nov 2024. There was 1 interview round.

Interview Preparation Tips

Topics to prepare for Tata 1mg Medical Laboratory Technician interview:
  • 3Ds Max
Interview preparation tips for other job seekers - Prepared for anything and act kindly to everyone

Software Engineer Interview Questions & Answers

Medlife user image nerella saikrishna

posted on 9 Jan 2016

Interview Questionnaire 

12 Questions

  • Q1. Insert a node in a Linked List, if a pointer to a node(it's not a head pointer) of Linked List is given.
  • Q2. What is the Time Complexity of Binary Search and it's derivation
  • Ans. 

    Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.

    • Binary Search is a search algorithm that works on sorted arrays.

    • It starts by comparing the target value to the middle element of the array.

    • If the target value is smaller, the search continues on the lower half of the array.

    • If the target value is larger, the search continues on the upper half of the array.

    • T...

  • Answered by AI
  • Q3. Write code for QuickSort
  • Ans. 

    QuickSort is a sorting algorithm that uses divide and conquer approach.

    • Choose a pivot element from the array

    • Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot

    • Recursively apply the above steps to the sub-arrays

    • Combine the sorted sub-arrays to get the final sorted array

  • Answered by AI
  • Q4. Write code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
  • Ans. 

    Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming

    • Recursion: Define a function that calls itself with the previous two numbers in the series as arguments

    • Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration

    • Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series

  • Answered by AI
  • Q5. How to implement an operation with Stacks which will be similar to Queue
  • Ans. 

    Implementing a Queue using Stacks

    • Use two stacks to implement a queue

    • Push elements onto the first stack

    • When dequeuing, pop all elements from the first stack and push onto the second stack

    • Pop the top element from the second stack to dequeue

    • If the second stack is empty, pop all elements from the first stack and push onto the second stack

  • Answered by AI
  • Q6. Write code for MergeSort
  • Ans. 

    MergeSort is a divide and conquer algorithm that sorts an array of strings.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q7. 2 types of detective ball puzzles
  • Q8. 25 Horses, 5 Tracks, 3 Fastest Puzzle
  • Q9. How the letters of a text are determined(Basically about OCR)
  • Q10. Write code for Insertion Sort and Selection Sort and find their time complexities and also the cases where their usage is efficient
  • Q11. Explain about Counting Sort
  • Ans. 

    Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.

    • Count the occurrences of each element in the array

    • Calculate the cumulative sum of the counts

    • Place each element in the sorted array based on its count and cumulative sum

    • Time complexity is O(n+k) where n is the number of elements and k is the range of input

    • Example: Sort an array of strings based on their

  • Answered by AI
  • Q12. When we type a part of a word in chrome, how is it able to show all the types of words, which are consisted of that part
  • Ans. 

    Chrome uses an algorithm to predict and suggest words based on user input.

    • Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.

    • The algorithm also takes into account the frequency and recency of the user's input.

    • Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.

    • The suggestions are di...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: First Question, at the start I was not able to answer and he gave me an hint(He asked me the insertion in an array). So, I got the idea for the insertion in Linked List and was able to answer it.
Remaining questions, I was able to answer confidently.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I was able to answer all the questions confidently, since I know the answers for them, But the last question was out of my scope and I explained based on my intuition and knowledge.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I have given the answers for 1&2 questions with clear explanation. And the third question is again out of my scope and I explained this also based intuition.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

General Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skill Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skills: Logical Puzzles, Algorithms And DataStructures
College Name: IIT Madras
Motivation: 1. Primary Reason: Passionate about Programming and Problem solving.
2. The profile is software Engineer.
3. You can see your idea, having an impact on the society which is possible with this type of company.
4. And a good package.
Funny Moments: Nothing Really...

Skills evaluated in this interview

Assistant Manager Interview Questions & Answers

BYJU'S user image prashant kumar saxena

posted on 14 Sep 2022

I applied via Approached by Company and was interviewed before Sep 2021. There were 2 interview rounds.

Interview Preparation Tips

Topics to prepare for BYJU'S Assistant Manager interview:
  • Sales
  • IT
  • Educational Sales
  • Education Counseling
Interview preparation tips for other job seekers - Company now created the poltics so my opinion please don't give interviews in byjus

I applied via Company Website and was interviewed before Mar 2020. There was 1 interview round.

Interview Questionnaire 

3 Questions

  • Q1. Write a program on bubble sort ?
  • Ans. 

    Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

    • Start from the first element and compare it with the next element

    • If the first element is greater than the next element, swap them

    • Repeat this process for all elements in the list

    • Continue this process until no more swaps are needed

  • Answered by AI
  • Q2. Define Turing Machine ?
  • Ans. 

    A Turing Machine is a theoretical device that can simulate any algorithmic computation.

    • It was proposed by Alan Turing in 1936 as a model for computation.

    • It consists of a tape, a head that can read and write symbols on the tape, and a set of rules for transitioning between states.

    • It can simulate any algorithmic computation, making it a powerful tool for theoretical computer science.

    • It is often used as a theoretical basi...

  • Answered by AI
  • Q3. Explain hash function
  • Ans. 

    A hash function is a mathematical function that converts input data of arbitrary size into a fixed-size output.

    • Hash functions are used to index data in hash tables.

    • They are also used in cryptography to securely store passwords.

    • Examples of hash functions include MD5, SHA-1, and SHA-256.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview was lengthy process some questions were difficult to answer and i tried to amswer a few questions but i didnt clear interview process

Skills evaluated in this interview

I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.

Interview Preparation Tips

Interview preparation tips for other job seekers - Take it easy and go with confidence which matters most

I applied via Job Fair and was interviewed before Feb 2021. There were 5 interview rounds.

Interview Preparation Tips

Interview preparation tips for other job seekers - Understand what they needs to us

I appeared for an interview before Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round had 3 coding questions of Medium to Hard level of difficulty.

  • Q1. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use recursion to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Return the valid combinations as an array of strings.

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
  • Q3. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.

    • Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.

    • Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.

    • Update the grid with the new state of oranges after each second.

    • Handle edge cases such as empty grid or no fresh oranges present.

    • Example...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.

  • Q1. 

    Queue Using Stacks Implementation

    Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.

    Explanation:

    Your task is to complete predefined functions t...

  • Ans. 

    Implement a queue using stacks following FIFO principle.

    • Use two stacks to simulate a queue.

    • For enQueue operation, push elements onto stack1.

    • For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.

    • For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.

    • For isEmpty operation, check if both stack1 and st...

  • Answered by AI
  • Q2. 

    Merge Intervals Problem Statement

    You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.

    Your task is to merge all overlapping intervals a...

  • Ans. 

    Merge overlapping intervals and return sorted list of merged intervals by start time.

    • Sort the intervals based on start time.

    • Iterate through intervals and merge overlapping ones.

    • Return the merged intervals in sorted order.

  • Answered by AI
  • Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.

  • Q1. 

    Binary Tree Diameter Problem Statement

    You are given a Binary Tree, and you need to determine the length of the diameter of the tree.

    The diameter of a binary tree is the length of the longest path betwe...

  • Ans. 

    The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.

    • Traverse the tree to find the longest path between two nodes.

    • Keep track of the maximum diameter found during traversal.

    • The diameter may not necessarily pass through the root node.

    • Consider both left and right subtrees while calculating the diameter.

    • Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1

  • Answered by AI
  • Q2. 

    Power of 2 Problem Statement

    Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.

    Input:

    The fir...
  • Ans. 

    The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.

    • Iterate through all possible permutations of the digits of the given integer.

    • Check if any of the permutations form a power of 2.

    • Return 1 if a valid permutation is found, else return 0.

  • Answered by AI
  • Q3. What are some advantages of using Object-Oriented Programming (OOP)?
  • Ans. 

    Advantages of OOP include code reusability, modularity, and easier maintenance.

    • Code reusability: Objects can be reused in different parts of the program, reducing redundancy.

    • Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.

    • Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.

    • Encapsulation: Data hiding and ab...

  • Answered by AI
  • Q4. What are access specifiers and what is their significance in Object-Oriented Programming?
  • Ans. 

    Access specifiers define the level of access to class members in Object-Oriented Programming.

    • Access specifiers include public, private, protected, and default

    • Public members are accessible from outside the class

    • Private members are only accessible within the class

    • Protected members are accessible within the class and its subclasses

    • Default access is when no access specifier is specified

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.

  • Q1. Why should we hire you?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPracto interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, OS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Virohan Interview FAQs

How many rounds are there in Virohan Medical Laboratory Technician interview?
Virohan interview process usually has 2 rounds. The most common rounds in the Virohan interview process are Case Study and Resume Shortlist.

Recently Viewed

INTERVIEWS

Teachmint

No Interviews

INTERVIEWS

Teachmint

No Interviews

INTERVIEWS

Pehlay Akshar Foundation

No Interviews

INTERVIEWS

Virohan

No Interviews

INTERVIEWS

Teachmint

No Interviews

REVIEWS

Tata Strive Skill Development Centre

No Reviews

INTERVIEWS

Blend360

No Interviews

INTERVIEWS

Blend360

No Interviews

SALARIES

Universal Learning Aid

INTERVIEWS

Virohan

No Interviews

Tell us how to improve this page.

Interview Questions from Similar Companies

BYJU'S Interview Questions
3.1
 • 2.1k Interviews
Unacademy Interview Questions
3.0
 • 206 Interviews
NxtWave Interview Questions
3.8
 • 178 Interviews
Chegg Interview Questions
4.1
 • 155 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
Skill Lync Interview Questions
3.1
 • 90 Interviews
Teachnook Interview Questions
3.2
 • 87 Interviews
LEAD School Interview Questions
3.3
 • 86 Interviews
PharmEasy Interview Questions
3.7
 • 80 Interviews
Practo Interview Questions
3.2
 • 74 Interviews
View all
Assistant Manager
34 salaries
unlock blur

₹4.5 L/yr - ₹11 L/yr

Admission Counsellor
11 salaries
unlock blur

₹1.9 L/yr - ₹5.2 L/yr

Director Admission
8 salaries
unlock blur

₹4 L/yr - ₹4.4 L/yr

Training Manager
7 salaries
unlock blur

₹7 L/yr - ₹9.5 L/yr

Soft Skills Trainer
6 salaries
unlock blur

₹3.8 L/yr - ₹4 L/yr

Explore more salaries
Compare Virohan with

BYJU'S

3.1
Compare

Practo

3.2
Compare

PharmEasy

3.7
Compare

Portea Medical

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview