Upload Button Icon Add office photos

Filter interviews by

Mimics Delphi Developer Interview Questions and Answers

Updated 25 Mar 2022

Mimics Delphi Developer Interview Experiences

1 interview found

I applied via Naukri.com and was interviewed in Feb 2022. There was 1 interview round.

Round 1 - Technical 

(3 Questions)

  • Q1. Explain Delphi database components
  • Ans. 

    Delphi database components are tools used to connect and interact with databases in Delphi programming language.

    • Delphi provides a variety of database components such as TDatabase, TQuery, TTable, TStoredProc, etc.

    • TDatabase component is used to establish a connection with the database.

    • TQuery component is used to execute SQL queries and retrieve data from the database.

    • TTable component is used to access and manipulate dat...

  • Answered by AI
  • Q2. Explain about previous company projects
  • Q3. Reports builder purpose
  • Ans. 

    Reports builder is a tool used to create and design reports.

    • Allows users to create custom reports based on specific data

    • Provides a user-friendly interface for designing and formatting reports

    • Can generate reports in various formats such as PDF, Excel, and HTML

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Worst experience... After hr round completed, they are not even inform whether you are selected or not. But they ask for academic certificates and payslips etc

Interview questions from similar companies

Interview Preparation Tips

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

I was interviewed in May 2017.

Interview Questionnaire 

6 Questions

  • Q1. Can string class be extended
  • Ans. 

    Yes, the string class can be extended in most programming languages.

    • Inheritance can be used to extend the functionality of the string class.

    • By creating a new class that inherits from the string class, additional methods and properties can be added.

    • Extending the string class allows for customization and adding specific functionality to strings.

    • Example: In Python, the string class can be extended by creating a new class

  • Answered by AI
  • Q2. What are the implecit object in JSP
  • Ans. 

    Implicit objects in JSP are predefined objects that are available for use without any declaration or initialization.

    • Implicit objects in JSP include request, response, session, application, out, config, pageContext, page, exception, and others.

    • These objects provide access to various aspects of the JSP environment and can be used to perform common tasks.

    • For example, the request object allows access to HTTP request parame...

  • Answered by AI
  • Q3. How does hash map works
  • Ans. 

    A hash map is a data structure that uses a hash function to map keys to values.

    • Hash map stores key-value pairs

    • It uses a hash function to compute an index for each key

    • Collisions can occur when two keys hash to the same index

    • Hash maps provide fast access to values based on their keys

  • Answered by AI
  • Q4. Difference between string buffer and string builder
  • Ans. 

    StringBuffer and StringBuilder are both used to manipulate strings, but StringBuffer is thread-safe while StringBuilder is not.

    • StringBuffer is synchronized, making it safe for use in multi-threaded environments.

    • StringBuilder is not synchronized, making it faster but not thread-safe.

    • StringBuffer is preferred when multiple threads are involved, while StringBuilder is preferred for single-threaded scenarios.

    • Both classes p...

  • Answered by AI
  • Q5. What is MVC
  • Ans. 

    MVC is a software architectural pattern that separates an application into three main components: Model, View, and Controller.

    • Model represents the data and business logic of the application.

    • View is responsible for displaying the user interface.

    • Controller handles user input, updates the model, and interacts with the view.

    • MVC promotes separation of concerns and modularity in software development.

    • Example: In a web applica...

  • Answered by AI
  • Q6. What are the annotation used in RESTFULL web services
  • Ans. 

    Annotations used in RESTful web services

    • 1. @Path - Specifies the URI path for the resource

    • 2. @GET - Specifies that the method handles HTTP GET requests

    • 3. @POST - Specifies that the method handles HTTP POST requests

    • 4. @PUT - Specifies that the method handles HTTP PUT requests

    • 5. @DELETE - Specifies that the method handles HTTP DELETE requests

    • 6. @PathParam - Binds the value of a URI template parameter to a method paramete...

  • Answered by AI

Interview Preparation Tips

Skills: Java Application Development

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 33 questions in total. The objective questions were simple.

  • Q1. 

    Sort Big List Dates Problem Statement

    Mary is an enthusiastic party-goer who struggles with remembering event dates. Help Mary by sorting a given list of event dates in an ascending order.

    Example:

    Inpu...
  • Ans. 

    Sort a list of event dates in ascending order based on year, month, and day.

    • Sort the list of dates based on year, then month, and finally day.

    • Use a sorting algorithm to rearrange the dates in ascending order.

    • Ensure the constraints are met for each date in the list.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Given an array and a target sum, find all pairs of elements that add up to the target sum.

    • Iterate through the array and for each element, check if the complement (target sum - current element) exists in a hash set.

    • If the complement exists, add the pair to the result list.

    • Sort the pairs based on the first element and then the second element.

    • Handle edge cases like duplicate elements and pairs with the same values.

    • Example...

  • Answered by AI
  • Q3. 

    Maximum Sum Problem Statement

    Given an integer N, your task is to recursively break it into three integer parts: N / 2, N / 3, and N / 4. You need to compute the maximum sum possible by dividing the numbe...

  • Ans. 

    Given an integer N, recursively break it into three parts and find the maximum sum possible.

    • Recursively divide N into N/2, N/3, and N/4 to find the maximum sum

    • Compare the sum obtained by dividing N with the sum of N itself

    • Return the maximum sum for each test case

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, 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 interviewRejected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Duplicate Integer in Array

    Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.

    Input:

    The first line contains an integer...
  • Ans. 

    Identify the duplicate integer in an array containing numbers between 1 and N-1.

    • Iterate through the array and keep track of the frequency of each element using a hashmap.

    • Return the element with a frequency greater than 1 as the duplicate integer.

    • Ensure the constraints are met and a duplicate number is guaranteed to be present.

  • Answered by AI
  • Q2. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Calculate the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current node value to the path sum and multiply by 10 for each level

    • When reaching a leaf node, add the final path sum to the total sum

    • Return the total sum modulo (10^9 + 7)

  • Answered by AI
  • Q3. 

    Topological Sort Problem Statement

    You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.

    Explanation:

    A directed acyclic g...

  • Ans. 

    Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.

    • Create a graph data structure to represent the DAG

    • Use depth-first search (DFS) to perform topological sorting

    • Maintain a visited array to keep track of visited nodes

    • Return the ordering of nodes after DFS traversal

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

    • Implement a recursive or iterative solution to find the LCA efficiently.

  • Answered by AI
  • Q2. 

    Rotated Array Minimum Finder

    You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...

  • Ans. 

    Implement a function to find the minimum number in a rotated sorted array efficiently.

    • Use binary search to find the minimum element in the rotated array.

    • Compare the mid element with the start and end elements to determine which half of the array to search next.

    • Continue the binary search until the minimum element is found.

  • Answered by AI
  • Q3. 

    Maximum Binary Tree Construction Problem

    Given an array TREE of 'N' unique integers, construct a maximum binary tree using the following rules:

    1. The root of this tree is the maximum number in TREE.
    2. T...
  • Ans. 

    Construct a maximum binary tree from an array of unique integers following specific rules.

    • Find the maximum number in the array to set as the root of the tree.

    • Recursively construct the left subtree with elements before the maximum number.

    • Recursively construct the right subtree with elements after the maximum number.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMorgan Stanley interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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 interviewRejected

Skills evaluated in this interview

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. How can a chemical Engineer help citi?
  • Ans. 

    A chemical engineer can help Citi by providing expertise in process optimization, risk management, and sustainability.

    • Optimizing Citi's manufacturing processes to reduce costs and increase efficiency

    • Developing risk management strategies to ensure compliance with environmental regulations

    • Implementing sustainable practices to reduce Citi's environmental impact

    • Providing technical expertise in chemical reactions and materi...

  • Answered by AI
  • Q2. He asked me about my JEE Rank, preparations

Interview Preparation Tips

Round: HR Interview
Experience: I had done many web and android apps. They asked me about my institute experience, things I have done here. It was an easy walk for me.

Skills: SQL, Java Programming
Duration: 2
College Name: IIT Madras

Interview Preparation Tips

Round: Test
Experience: Online Test (General aptitude, C aptitude ,Programming problems).

General Tips: Study basics of C and DSA well. Utilize the last summer vacations for studying for placements. Be confident and Honest.
Yes it is challenging and exhausting. It tests your patience. But final reward is also great so we must keep going toward it.
Skill Tips: Online coding sites such as Codechef, etc. Narasimha Karumanchi for data structures and algorithm will help in preparation.
Skills:
College Name: NIT Surathkal

Interview Preparation Tips

Round: Test
Experience: The test was for two and half hours where 1 hour was for general aptitude, 1 hr was for coding aptitude(either on java or C or C++as you choose) and 1/2 an hour for two coding questions.

Round: Technical Interview
Experience: In technical round they asked puzzles, aptitude questions and basic C coding. I was asked to write the code for two questions(one was on sort and search) and was asked the logic of two questions.They asked basics of linked lists, stacks, queues. Infact they were not very interested in the syntax and were pressing on the logic

General Tips: Being a non software branch students is not at all a problem. The company took 4 interns where 3 were from core branches. The fact that we had to work in JAVA and most of us didn't know JAVA, the company only looks for aptitude and ability to learn. So if you don't know anything, tell frankly that you don't know that part, rather than guessing. Be thorough with what you know and confidentially answer all the questions.
Also do not be tensed and take things lightly, if the interviewer is joking. Be candid.
Skill Tips: Learn basics of coding from books . Aptitude can be done from sites likes geeks for geeks, etc. The level of aptitude is not very high and infact the coding aptitude is also theoretical and does not involve in depth knowledge.
Skills:
College Name: NIT Surathkal

I was interviewed before Sep 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.

  • Q1. How can you detect a loop in a linked list?
  • Ans. 

    A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.

    • Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.

    • If there is a loop, the two pointers will eventually meet at some point within the loop.

    • To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 30 minutes
Round difficulty - Easy

This round was mostly focused on my resume and projects.

Round 3 - Face to Face 

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience. 
 

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in GurgaonAmerican Express interview preparation:Topics to prepare for the interview - Data structures and algorithms, Object-Oriented Programming System concepts, Database Management System, Operating System, Networking.Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.

Application resume tips for other job seekers

Keep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Referral and was interviewed before Sep 2019. There were 3 interview rounds.

Interview Questionnaire 

8 Questions

  • Q1. Java logical question
  • Q2. Webdriver architecture
  • Q3. Framework, file and folder structure
  • Q4. Your approach to tackle dynamic objects
  • Ans. 

    I approach dynamic objects by analyzing their behavior and adapting my approach accordingly.

    • I start by understanding the nature of the dynamic object and its expected behavior

    • I then analyze its movement patterns and any potential obstacles or hazards

    • Based on this analysis, I adapt my approach to ensure safe and efficient interaction with the dynamic object

    • For example, when working with a moving conveyor belt, I would e...

  • Answered by AI
  • Q5. Implicit and explicit wait in selenium
  • Ans. 

    Implicit and explicit wait are two types of wait in Selenium used to synchronize the test execution with the application.

    • Implicit wait is used to set a default waiting time for the web elements to load before throwing an exception.

    • Explicit wait is used to wait for a specific condition to occur before proceeding with the test execution.

    • Implicit wait is set globally for the entire test script while explicit wait is set f...

  • Answered by AI
  • Q6. Java oops concepts
  • Q7. Sql queries related to joins
  • Q8. Basic Unix commands

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and try to connect yours answers with some example of your project.

Skills evaluated in this interview

Mimics Interview FAQs

How many rounds are there in Mimics Delphi Developer interview?
Mimics interview process usually has 1 rounds. The most common rounds in the Mimics interview process are Technical.
What are the top questions asked in Mimics Delphi Developer interview?

Some of the top questions asked at the Mimics Delphi Developer interview -

  1. Explain Delphi database compone...read more
  2. Reports builder purp...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Citicorp Interview Questions
3.7
 • 564 Interviews
HSBC Group Interview Questions
4.0
 • 484 Interviews
American Express Interview Questions
4.2
 • 358 Interviews
BNY Interview Questions
3.9
 • 341 Interviews
UBS Interview Questions
3.9
 • 331 Interviews
Morgan Stanley Interview Questions
3.7
 • 291 Interviews
Morningstar Interview Questions
3.9
 • 241 Interviews
FactSet Interview Questions
3.9
 • 204 Interviews
View all
Software Engineer
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Writer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Project Manager
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineering Lead
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Delphi Developer
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Mimics with

HSBC Group

3.9
Compare

Cholamandalam Investment & Finance

3.9
Compare

Citicorp

3.7
Compare

BNY

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