AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
iMocha
Compare
Filter interviews by
iMocha Sr BDM Interview Questions and Answers
iMocha Sr BDM Interview Experiences
1 interview found
Selected
I applied via Recruitment Consulltant and was interviewed in Jan 2023. There were 3 interview rounds.
(1 Question)
- Q1. Basic questions were asked
(1 Question)
- Q1. Basic que were asked at the time
Interview Preparation Tips
Interview questions from similar companies
Interview Questionnaire
8 Questions
- Q1. Given a doubly linked list with one pointer of each node pointing to the next node just like in a singly linked list. The second pointer(arbit pointer) however can point to any node in the list and not jus...
- Ans.
Program to create a copy of a doubly linked list with an arbit pointer.
Traverse the original list and create a new node for each node in the list.
Store the mapping of original node to the new node in a hash table.
Traverse the original list again and set the next and arbit pointers of the new nodes.
Return the head of the new list.
- Q2. Implement funcionality of 1000 of students giving a online test and timer is running. You have to calculate th etime when test is tarted and auto-matically stop the test when test is ended. Handle the scen...
- Ans.
Implement functionality for online test with timer and handle power failure scenarios
Create a timer function to track the time
Store the start time and end time of the test
Implement a backup system to save progress in case of power failure
Use a database to store test data and progress
Handle edge cases like internet connectivity issues
- Q3. WAP of prime number using reursion?
- Ans.
A recursive function to check if a number is prime or not.
Create a function that takes a number as input.
Check if the number is less than 2, return false.
Check if the number is 2, return true.
Check if the number is divisible by any number less than it, return false.
If none of the above conditions are met, call the function recursively with the number minus 1.
- Q4. Reverse a linked list?
- Ans.
To reverse a linked list, we need to traverse the list and change the direction of the pointers.
Create three pointers: prev, curr, and next
Initialize prev to null, curr to head of the linked list, and next to null
Traverse the list and change the direction of the pointers: next = curr.next; curr.next = prev; prev = curr; curr = next;
Set the new head of the linked list to prev
- Q5. Some sql related questions – not very tough : some inner joins and self join based?
- Q6. How can you stop man in the middle attack over an insecure communication line without using any kind of encryption ?
- Ans.
It is not possible to stop man in the middle attack over an insecure communication line without using any kind of encryption.
Without encryption, the communication line is inherently insecure and vulnerable to man-in-the-middle attacks.
One possible solution is to use a secure communication line, such as a VPN or a dedicated private network.
Another solution is to use digital signatures to verify the authenticity of the c...
- Q7. What is the difference between http and https?
- Ans.
HTTP is unsecured while HTTPS is secured with SSL/TLS encryption.
HTTP stands for Hypertext Transfer Protocol while HTTPS stands for Hypertext Transfer Protocol Secure.
HTTP operates on port 80 while HTTPS operates on port 443.
HTTP is unencrypted while HTTPS is encrypted with SSL/TLS.
HTTPS provides authentication and data integrity while HTTP does not.
HTTPS is used for secure online transactions such as online banking, e
- Q8. Heap memory and stack memory? Local variables are stored where? What is memory tables?
- Ans.
Heap and stack memory are two types of memory allocation in a program. Local variables are stored in stack memory. Memory tables are used to track memory allocation.
Heap memory is used for dynamic memory allocation, while stack memory is used for static memory allocation.
Local variables are stored in stack memory and are only accessible within the scope of the function they are declared in.
Memory tables are used to kee...
Interview Preparation Tips
Experience: Finally, I got offer from Aspiring Minds after 15 days of negotiation.
Skills: data structure, Algorithm
College Name: na
Skills evaluated in this interview
Interview Preparation Tips
Experience: Numeric Reasoning Test
Round: Test
Experience: Numeric Reasoning Test
Round: Test
Experience: Numeric Reasoning Test
Associate Software Engineer Interview Questions & Answers
eLitmus Evaluation
Anonymous
posted on 23 Oct 2021
I applied via Campus Placement and was interviewed before Oct 2020. There was 1 interview round.
Interview Questionnaire
2 Questions
- Q1. Given an array findtwo elements whose sum will equal to the given target number (two sum)
- Ans.
Given an array, find two elements whose sum equals the target number (two sum).
Use a hash table to store the difference between the target and each element in the array.
Iterate through the array and check if the current element exists in the hash table.
If it does, return the current element and the corresponding value in the hash table.
If it doesn't, add the difference between the target and the current element to the
- Q2. Find repeated and missing no.s
- Ans.
The task is to find the repeated and missing numbers in an array of integers.
Iterate through the array and mark the visited numbers by changing the sign of the element at the corresponding index.
If a number is already negative, it means it is a repeated number.
The missing number can be found by checking the index of the positive number.
Alternatively, we can use a hash set to keep track of visited numbers and find the m...
Interview Preparation Tips
Skills evaluated in this interview
Peak of element in Array
I was interviewed in Nov 2020.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
- Q1.
Path Queries Problem Statement
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...
- Ans.
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
Use Dijkstra's algorithm to find the shortest path between the given vertices.
Create a graph data structure to represent the weighted, undirected graph.
Handle cases where no path exists between the given vertices by returning -1.
Optimize the algorithm to handle multiple queries efficiently.
Consider edge cases such as...
- Q2.
Merge Sort Algorithm Problem Statement
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Explanation:
Merge Sort is a divide-an...
- Ans.
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively
Sort the two halves separately
Merge the sorted halves to produce a fully sorted array
Time complexity of Merge Sort is O(n log n)
Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
- Q3.
Rat in a Maze: All Paths Problem
You are provided with an
N * Nmaze where a rat is positioned at starting cellMAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r... - Ans.
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
Use backtracking to explore all possible paths from the starting cell to the destination cell.
At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.
Keep track of the path taken so far and mark the cells accordingly.
Once the destination cell i...
Interview Preparation Tips
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Skills evaluated in this interview
(2 Questions)
- Q1. Question doesn't matter
- Q2. Question doesn't really care
Interview Preparation Tips
Selected
I applied via Naukri.com and was interviewed in Dec 2023. There was 1 interview round.
Questions can be found on Leetcode
I applied via Company Website and was interviewed before Jul 2023. There was 1 interview round.
(1 Question)
- Q1. Create specific components
- Ans.
Creating specific components for software development
Identify the requirements for the component
Design the component architecture
Implement the component using appropriate programming languages and tools
Test the component for functionality and performance
Integrate the component into the larger software system
Skills evaluated in this interview
Aniket Singh
I applied via Job Portal
In first round, interviewer asked 2 coding questions and to write code on the call itslef.
(2 Questions)
- Q1. HLD - High level Design
- Q2. Design a system similar to BookMyShow
- Ans.
Design a system similar to BookMyShow for booking tickets for events and movies.
User registration and login system
Event and movie listing with details and show timings
Seat selection and booking process
Payment gateway integration
Booking history and ticket download option
(1 Question)
- Q1. LLD - Low level design
(1 Question)
- Q1. Database schema design
Skills evaluated in this interview
iMocha Interview FAQs
Tell us how to improve this page.
iMocha Interviews By Designations
Interview Questions for Popular Designations
iMocha Sr BDM Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
|
Software Engineer
15
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
UI Developer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior QA Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Data Analyst
6
salaries
| ₹0 L/yr - ₹0 L/yr |
HackerRank
Talview
Mettl
CoCubes Technologies
- Home >
- Interviews >
- iMocha Interview Questions >
- iMocha Sr BDM Interview Questions
