AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Mirraw Interview Questions, Process, and Tips
Top Mirraw Interview Questions and Answers
- Q1. What do you know about the types of key ?asked in Senior Software Tester interview
- Q2. Sell me this watch?asked in Sales Executive interview
- Q3. Calculate cost priceasked in Business Analyst interview
Mirraw Interview Experiences
6 interviews found
Anonymous
I applied via Naukri.com and was interviewed in Aug 2024. There were 3 interview rounds.
(9 Questions)
- Q1. Tell me about yourself
- Ans.
I am a highly experienced Senior Software Tester with a strong background in manual and automated testing.
Over 8 years of experience in software testing
Proficient in manual testing, test automation, and performance testing
Skilled in using tools like Selenium, JIRA, and HP Quality Center
Strong analytical and problem-solving skills
Experience in testing web and mobile applications
- Q2. Difference between Regression & Retesting?
- Ans.
Regression testing is testing the entire application after changes, while retesting is testing a specific bug fix.
Regression testing is done to ensure that new code changes do not affect existing functionality.
Retesting is done to verify that a specific bug or issue has been fixed.
Regression testing involves testing the entire application, while retesting focuses on a specific area.
Examples: After adding a new feature,...
- Q3. Difference between Functional and Non functional testing .
- Ans.
Functional testing focuses on the specific functionality of the software, while non-functional testing focuses on performance, usability, and security.
Functional testing ensures that the software functions as expected based on the requirements.
Non-functional testing evaluates aspects like performance, usability, reliability, and security.
Examples of functional testing include unit testing, integration testing, and syst...
- Q4. Test scenario of ATM machine
- Ans.
Testing the functionality of an ATM machine by simulating various scenarios
Test withdrawing money within account balance
Test withdrawing money exceeding account balance
Test depositing money into account
Test checking account balance
Test entering invalid PIN
Test inserting damaged card
- Q5. What is Selenium?
- Ans.
Selenium is a popular open-source tool used for automating web browsers.
Selenium is used for automating web browsers to test web applications.
It supports multiple programming languages like Java, Python, C#, etc.
Selenium WebDriver is the most commonly used component for writing automation scripts.
Selenium Grid allows running tests on different machines in parallel.
Selenium IDE is a record and playback tool for creating
- Q6. What do you know about the types of key ?
- Ans.
Types of keys include primary keys, foreign keys, unique keys, and composite keys.
Primary key: uniquely identifies each record in a table, must be unique and not null.
Foreign key: links two tables together, enforces referential integrity.
Unique key: ensures that all values in a column are unique.
Composite key: combination of two or more columns to uniquely identify a record.
- Q7. Types of Join ?
- Ans.
Types of Join include Inner Join, Left Join, Right Join, and Full Join.
Inner Join: Returns rows when there is a match in both tables.
Left Join: Returns all rows from the left table and the matched rows from the right table.
Right Join: Returns all rows from the right table and the matched rows from the left table.
Full Join: Returns rows when there is a match in one of the tables.
- Q8. Agile vs waterfall model difference
- Ans.
Agile is iterative and flexible, while waterfall is sequential and rigid.
Agile involves continuous feedback and adaptation, while waterfall follows a linear approach.
Agile allows for changes throughout the development process, while waterfall requires detailed planning upfront.
Agile is better suited for projects with evolving requirements, while waterfall is ideal for projects with fixed requirements.
Agile promotes col...
- Q9. If there is a registration page is there on that page, Client wants to change or something they want to add right now u said that Waterfall methodology follow in that scenario what u will do u will follow ...
A mirraw website will be given to u and have to find a bug within 24 hours on a next day u have to submit through Email id.
(1 Question)
- Q1. Give me a severity and priority on Defect report which u have submitted.
- Ans.
The severity of the defect is high as it impacts critical functionality, but the priority is low as there are workarounds available.
Severity: High - the defect impacts critical functionality and needs to be fixed urgently
Priority: Low - there are workarounds available for the defect, so it can be addressed later
Interview Preparation Tips
- Functional Testing
- Non functional testin
- Test Cases
- Test Scenarios
Skills evaluated in this interview
Top Mirraw Senior Software Tester Interview Questions and Answers
Senior Software Tester Interview Questions asked at other Companies
Sun Pharmaceutical Industries
Join us and thrive in a company culture that inspires and empowers.
Kakashi
They provided 1 graph and have to calculate percentage , capacity etc
(1 Question)
- Q1. Calculate cost price
- Ans.
Cost price is the price at which a product or service is purchased or produced.
Cost price is calculated by adding the cost of production or purchase of the item along with any additional costs such as transportation or packaging.
For example, if a company buys a product for $50, spends $10 on transportation, and $5 on packaging, the cost price would be $65.
Cost price is important for businesses to determine the profitab
Business Analyst Interview Questions asked at other Companies
Shoaib Shaikh
3 DSA QUESTIONS WERE GIVEN TO SOLVE
(1 Question)
- Q1. On the basis of your resume questions were asked approx for 30 minutes
(1 Question)
- Q1. Behaviour questions were asked related to learning , past experience etc
Selected
I applied via Naukri.com and was interviewed in Apr 2023. There were 2 interview rounds.
(2 Questions)
- Q1. C# basics and concept of oops
- Q2. SQL queries simple join
Software Developer Interview Questions asked at other Companies
Mirraw interview questions for popular designations
Selected
I applied via Company Website and was interviewed before Jan 2023. There was 1 interview round.
(5 Questions)
- Q1. My introduction and my qualification and my sales pitch and my past experiences
- Q2. First question is about my introduction and my qualifications and my past experiences
- Q3. Hr ask about how to sales a product
- Q4. Sell me this watch?
- Ans.
This watch is a stylish and functional accessory that combines elegance with advanced features.
The watch features a sleek design that complements any outfit.
It is made with high-quality materials for durability and longevity.
The watch has a variety of useful features such as a chronograph, date display, and water resistance.
Its precise movement ensures accurate timekeeping.
The watch comes with a warranty and excellent ...
- Q5. Whats your passion
Interview Preparation Tips
Sales Executive Interview Questions asked at other Companies
Selected
I applied via Naukri.com and was interviewed before Jun 2022. There were 2 interview rounds.
(1 Question)
- Q1. Education last experience
- Ans.
I have a Bachelor's degree in Fashion Merchandising and 2 years of experience working as a merchandiser for a high-end boutique.
Bachelor's degree in Fashion Merchandising
2 years of experience as a merchandiser
Worked for a high-end boutique
Interview Preparation Tips
Fashion Merchandiser Interview Questions asked at other Companies
Top trending discussions
Interview questions from similar companies
I was interviewed before Dec 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
The Entire Test is held in HackerRank Platform. It has:
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts
- Q1.
Binary Tree to Doubly Linked List
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
Input:
The fi... - Ans.
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.
- Q2.
Unique Element in Array
Given an arbitrary array
arrconsisting ofNnon-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl... - Ans.
Find the unique element in an array where every other element appears thrice.
Use XOR operation to find the unique element.
Iterate through the array and XOR each element to find the unique one.
Return the unique element as the answer.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
- Q1.
Binary Tree Traversals Problem Statement
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
- Ans.
Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Parse the input level-order tree elements to construct the binary tree.
Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.
Return the traversals as lists of lists for each test case.
- Q2.
Delete N Nodes After M Nodes in a Linked List
Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...
- Ans.
Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.
Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.
Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.
Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.
Repeat this process until the end of the lin...
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Question : Explain all the search algorithm you know with space and Time complexities.
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1).
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half.
Steps :
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half.
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.
- Q1.
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
- Ans.
Program to find the number with maximum frequency in an array of integers.
Create a dictionary to store the frequency of each number in the array.
Iterate through the array and update the frequency count in the dictionary.
Find the number with the maximum frequency in the dictionary and return it.
If multiple elements have the same maximum frequency, return the one with the lowest index.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
Thommandru Vishnu
Interview Questionnaire
9 Questions
- Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
- Ans.
Print only the leaf nodes of a doubly linked tree.
Traverse the tree and check if a node has no children and both left and right pointers are null.
If yes, then it is a leaf node and print it.
If no, then continue traversing the tree.
Use recursion to traverse the tree in a depth-first manner.
- Q2. LRU page Replacement Algorithm for large data
- Ans.
LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.
LRU stands for Least Recently Used
It is a cache eviction algorithm
It is used to manage memory in operating systems
It works by keeping track of the pages that are used recently and the ones that are not
When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time
- Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
- Ans.
Reverse m nodes and leave n nodes in a linked list till the end.
Traverse the linked list till m nodes and reverse them
Traverse n nodes and continue reversing m nodes
Repeat the above step till the end of the linked list
Handle edge cases like m or n being greater than the length of the linked list
- Q4. Inorder Traversal of a tree
- Ans.
Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.
Start at the root node
Traverse the left subtree recursively
Visit the root node
Traverse the right subtree recursively
Repeat until all nodes have been visited
- Q5. Inorder Travesal of a tree without recursion(write the code)
- Ans.
Inorder traversal of a tree without recursion
Create an empty stack and initialize current node as root
Push the current node to stack and set current = current.left until current is NULL
If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right
Repeat step 2 and 3 until stack is empty
- Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
- Ans.
Find the triplicate number in an array of duplicates.
Iterate through the array and keep track of the frequency of each number.
Return the number that appears three times.
If no number appears three times, return null.
- Q7. Explain all the serach algorithm you know with space and Time complexities
- Ans.
Explanation of search algorithms with their space and time complexities.
Linear Search - O(n) time complexity, O(1) space complexity
Binary Search - O(log n) time complexity, O(1) space complexity
Jump Search - O(√n) time complexity, O(1) space complexity
Interpolation Search - O(log log n) time complexity, O(1) space complexity
Exponential Search - O(log n) time complexity, O(1) space complexity
Fibonacci Search - O(log n)
- Q8. Given a situation and asks you which search algorithm suits the best in that situation
- Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
- Ans.
Find the most repeated number in an array of length n with numbers 1-n.
Create a dictionary to store the count of each number in the array
Iterate through the array and update the count in the dictionary
Find the key with the highest count in the dictionary
Interview Preparation Tips
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist
Round: Test
Experience: The Entire Test is held in HackerRank Platform. it has
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
it took me 30 min for each coding questions.I was not known that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic c and c++ concepts
Duration: 120 minutes
Total Questions: 7
Round: Technical Interview
Experience: It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules
Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)
General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE
Skills evaluated in this interview
I was interviewed before Dec 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.
- Q1.
Longest Common Subsequence Problem Statement
Given two strings
STR1andSTR2, determine the length of their longest common subsequence.A subsequence is a sequence that can be derived from another sequen...
- Ans.
The task is to find the length of the longest common subsequence between two given strings.
Implement a function to find the longest common subsequence between two strings.
Use dynamic programming to solve this problem efficiently.
Iterate through the strings and build a matrix to store the lengths of common subsequences.
Return the length of the longest common subsequence found.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper.
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.
- Q1.
Add Two Numbers as Linked Lists
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...
- Ans.
Add two numbers represented as linked lists and return the sum as a linked list.
Traverse both linked lists simultaneously while keeping track of carry from previous sum
Create a new linked list to store the sum, updating the value and carry as needed
Handle cases where one linked list is longer than the other by adding remaining digits with carry
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.
- Q1.
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
- Ans.
BFS traversal in a disconnected graph starting from vertex 0.
Use a queue to keep track of nodes to visit next in BFS traversal
Start traversal from vertex 0 and explore its neighbors first
Continue exploring neighbors level by level until all nodes are visited
Ensure to print connected nodes in numerical sort order
- Q2.
DFS Traversal Problem Statement
Given an undirected and disconnected graph
G(V, E), whereVis the number of vertices andEis the number of edges, the connections between vertices are provided in the 'GR... - Ans.
DFS traversal to find connected components in an undirected and disconnected graph.
Perform DFS traversal on each vertex to find connected components
Maintain a visited array to keep track of visited vertices
Print the vertices of each connected component in ascending order
- Q3.
Dijkstra's Shortest Path Problem
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...
- Ans.
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.
Use a priority queue to efficiently select the next node with the shortest distance.
Update the distances of neighboring nodes based on the current node's distance and edge weight...
Interview Preparation Tips
Tip 1 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : Do at-least 2 good projects and you must know every bit of them.
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.
Skills evaluated in this interview
I was interviewed before Jan 2016.
Interview Preparation Tips
Mirraw Interview FAQs
Recently Viewed
INTERVIEWS
INZINT
No Interviews
SALARIES
Embibe
PHOTOS
Torero Corporation
No Photos
SALARIES
L1 Supply Networks
No Salaries
LIST OF COMPANIES
L1 Supply Networks
Overview
PHOTOS
Auriga IT Consulting Private Limited
No Photos
COMPANY BENEFITS
Torero Corporation
No Benefits
SALARIES
Torero Corporation
No Salaries
LIST OF COMPANIES
Torero Corporation
Overview
REVIEWS
Torero Corporation
No Reviews
Tell us how to improve this page.
Mirraw Interviews By Designations
Interview Questions for Popular Designations
Mirraw Interview Process
based on 7 interviews
Interview experience
HCLTech
A more secure future awaits you
Interview Questions from Similar Companies
|
Business Analyst
21
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Operations Executive
20
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Developer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Customer Support Executive
13
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Sales Executive
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Myntra
LimeRoad
Voonik
Craftsvilla.com
- Home >
- Interviews >
- Mirraw Interview Questions
