Upload Button Icon Add office photos

Meditab Software

Compare button icon Compare button icon Compare

Filter interviews by

Meditab Software Data Engineer Interview Questions and Answers

Updated 30 Aug 2024

Meditab Software Data Engineer Interview Experiences

1 interview found

Data Engineer Interview Questions & Answers

user image Anonymous

posted on 30 Aug 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Based on technical question and some general aptitude question

Round 2 - Technical 

(2 Questions)

  • Q1. They give me one python based question : one list in which there are mixed positive and negative , we have to arrange the as one positive and second as negative
  • Q2. Sql queries and database theory

Interview questions from similar companies

Interview Preparation Tips

Round: Test
Experience: Though technical questions were not that difficult but the quant section was way too hard and almost impossible to solve completely in given time limit.
Tips: It’s better if you attempt less questions (in quant) but do them right (I attempted less than 40% quant and still got through).

Round: Technical Interview
Experience: Next they would have 2-3 technical rounds where they cover most of the areas of CS. Some of the areas where they concentrated more would be Algorithms, OOPS Concepts and Logical Puzzles.
Tips: Brush up important concepts from various areas such as Operating System, OOPS, Software Engineering. Be ready for some really challenging questions in Algorithms. Also they do ask quite a few logical puzzles so it’s important you practice a lot of them online before the interview.

General Tips: D E Shaw selects very few candidates + comes in starting weeks of placement season, so competition is immense. Multiple companies come on same day, so it becomes a little tedious. Surely I wasn't the better candidate that day.
Skill Tips: D E Shaw focuses more on your ability to solve logical problems, so make sure you are in best state of your mind and speak while solving any problem because what they are looking for is not the right answer (well of course they are) but also how are you approaching the problem.
Skills: Operating System, OOPS, Algorithms, CS, logical puzzles, Quant
College Name: NIT SURATHKAL

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Salary discussion and notice period
  • Q2. Core java, collections and coding

Interview Preparation Tips

Round: Manager Round
Experience: About project and previous company experience , daily activity

I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.

Interview Questionnaire 

9 Questions

  • Q1. Transistors basics + C code
  • Q2. Control system basics
  • Q3. Food habits
  • Ans. 

    I have a balanced diet and enjoy trying new foods.

    • I prioritize whole foods and limit processed foods.

    • I enjoy cooking and meal prepping to ensure I have healthy options available.

    • I am open to trying new foods and cuisines.

    • I am mindful of portion sizes and listen to my body's hunger cues.

    • I limit my intake of sugary and high-fat foods.

    • I stay hydrated by drinking plenty of water throughout the day.

  • Answered by AI
  • Q4. Manager handling
  • Q5. Project details
  • Q6. Smell Sensor details
  • Ans. 

    A smell sensor is a device that detects and measures odors in the environment.

    • Smell sensors can be used in industries such as food and beverage, agriculture, and environmental monitoring.

    • They work by detecting and measuring volatile organic compounds (VOCs) in the air.

    • Some examples of smell sensors include the eNose, Cyranose 320, and the Scentometer.

    • Smell sensors can also be used in medical applications, such as detec

  • Answered by AI
  • Q7. Voltage basics
  • Q8. Current control
  • Q9. TTL

Interview Preparation Tips

Interview preparation tips for other job seekers - Good energy+Confidence

Interview Questionnaire 

3 Questions

  • Q1. What is in line view. How view is provided security. What is bulk collect. Write a plsql program to display week days except Saturday and Sunday. What is difference between rowid and rownum. What is diffe...
  • Ans. 

    Answers to questions related to software engineering concepts and PL/SQL programming.

    • Inline view is a virtual table created in the FROM clause of a SQL query.

    • Views can be secured by granting appropriate privileges to users and implementing row-level security.

    • BULK COLLECT is a feature in PL/SQL that allows fetching multiple rows from a query into a collection.

    • PL/SQL program to display weekdays except Saturday and Sunday...

  • Answered by AI
  • Q2. Ask about project . How to understand client request. Explain about software SDLC.
  • Q3. Discuss about salary and benefits.

I applied via Naukri.com and was interviewed before Jun 2020. There were 5 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Basic oop
  • Q2. Previous projects and walktrough of one of the project, if any
  • Q3. Basic English test on a computer

Interview Preparation Tips

Interview preparation tips for other job seekers - The first step of the interview is the basic communication skills, which is taken on computer, try to listen carefully, most of the questions are only about what you have comprehend from the automated voice when played over.

OOP is very basic, they may ask some real life examples.

If you have worked previously, they may ask you about one of your projects. What technologies have you used ans why.

I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is your day to day work?
  • Q2. What new you have to offer the organization?
  • Q3. The most recent issues that you faced in the organization?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be true to yourself and the interviewer, he/she doesn't want you to be full of all technical skills. He/she wants you to be atleast good at the things mentioned in your resume. Showcase that you're ready to switch to any language even if it is uncomfortable for you

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

It was Technical + Aptitude MCQ round.The technical section consisted if MCQ related to DSA,OS,DBMS.The aptitude section consisted of questions related to basic mathematics.

  • Q1. 

    Candies Distribution Problem Statement

    Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...

  • Ans. 

    The task is to distribute candies to students based on their performance while minimizing the total candies distributed.

    • Create an array to store the minimum candies required for each student.

    • Iterate through the students' ratings array to determine the minimum candies needed based on the given criteria.

    • Consider the ratings of adjacent students to decide the number of candies to distribute.

    • Calculate the total candies req...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

It was a technical interview testing the basic skills of OS and DBMS of candidates along with few project discussions from your CV.

  • Q1. Can you write 15 Linux commands along with their functions?
  • Ans. 

    List of 15 Linux commands with their functions

    • ls - list directory contents

    • pwd - print working directory

    • cd - change directory

    • mkdir - make a new directory

    • rm - remove files or directories

    • cp - copy files and directories

    • mv - move or rename files and directories

    • grep - search for patterns in files

    • chmod - change file permissions

    • ps - display information about running processes

    • top - display and update sorted information about pr...

  • Answered by AI
  • Q2. What are DDL (Data Definition Language) and DML (Data Manipulation Language)?
  • Ans. 

    DDL is used to define the structure of database objects, while DML is used to manipulate data within those objects.

    • DDL includes commands like CREATE, ALTER, DROP to define database objects like tables, indexes, etc.

    • DML includes commands like INSERT, UPDATE, DELETE to manipulate data within tables.

    • Example of DDL: CREATE TABLE employees (id INT, name VARCHAR(50));

    • Example of DML: INSERT INTO employees VALUES (1, 'John Doe

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Vellore Institute of Technology. I applied for the job as System Engineer in BangaloreEligibility criteriaAbove 8 CGPACerner Corporation interview preparation:Topics to prepare for the interview - Data Structures, DBMS, Linux, Algorithms,Cloud computing, Operating systemsTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be clear about the concepts of Linux and shell scripting.
Tip 2 : Learn about the basics of Data structures and Algorithm.
Tip 3 : Be prepared to explain your projects mentioned in your CV.

Application resume tips for other job seekers

Tip 1 : Use professional Keywords in your resume.
Tip 2 : Don't mention anything you are not confident in.

Final outcome of the interviewSelected

Interview Questionnaire 

1 Question

  • Q1. Questions on c language, CAN protocol and details on your earlier project

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for c, CAN etc

Meditab Software Interview FAQs

How many rounds are there in Meditab Software Data Engineer interview?
Meditab Software interview process usually has 2 rounds. The most common rounds in the Meditab Software interview process are Aptitude Test and Technical.
What are the top questions asked in Meditab Software Data Engineer interview?

Some of the top questions asked at the Meditab Software Data Engineer interview -

  1. they give me one python based question : one list in which there are mixed posi...read more
  2. sql queries and database the...read more

Tell us how to improve this page.

Meditab Software Data Engineer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Meditab Software Data Engineer Salary
based on 14 salaries
₹5 L/yr - ₹7 L/yr
43% less than the average Data Engineer Salary in India
View more details

Meditab Software Data Engineer Reviews and Ratings

based on 5 reviews

2.7/5

Rating in categories

2.1

Skill development

2.1

Work-life balance

2.7

Salary

2.9

Job security

1.7

Company culture

2.6

Promotions

2.7

Work satisfaction

Explore 5 Reviews and Ratings
Programmer Analyst
140 salaries
unlock blur

₹3.6 L/yr - ₹9.2 L/yr

Quality Analyst
76 salaries
unlock blur

₹3.6 L/yr - ₹8 L/yr

Medical Billing Specialist
36 salaries
unlock blur

₹2 L/yr - ₹5 L/yr

Medical Billing Executive
33 salaries
unlock blur

₹2.1 L/yr - ₹4.2 L/yr

Senior Programmer Analyst
32 salaries
unlock blur

₹6.7 L/yr - ₹17.6 L/yr

Explore more salaries
Compare Meditab Software with

KPIT Technologies

3.4
Compare

Thomson Reuters

4.1
Compare

Oracle Cerner

3.7
Compare

NextComm Corporation

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