i
KPIT Technologies
Filter interviews by
I applied via Campus Placement and was interviewed in Aug 2023. There were 2 interview rounds.
Quantitative,Logical puzzles, basic electronics
A microcontroller is a compact integrated circuit designed to perform specific tasks, while a processor is a general-purpose device used for executing instructions.
Microcontrollers typically have built-in memory and peripherals for specific applications, while processors require external components for operation.
Microcontrollers are commonly used in embedded systems like IoT devices and consumer electronics, while proc...
Bode plot and Nyquist plot are used in control systems to analyze the stability and frequency response of a system.
Bode plot is used to analyze the frequency response of a system by plotting the magnitude and phase of the transfer function against frequency.
Nyquist plot is used to analyze the stability of a system by plotting the frequency response on a complex plane.
Bode plot helps in understanding the gain and phase ...
The main difference between von Neumann and Harvard architecture is the separation of data and instruction memory.
Von Neumann architecture uses a single memory space for both data and instructions, while Harvard architecture uses separate memory spaces for data and instructions.
Harvard architecture allows for simultaneous access to data and instructions, leading to potentially faster performance.
Von Neumann architectur...
I applied via Approached by Company
Sort the arr, fetch element from array
Sorting in a linked list involves rearranging the elements in ascending or descending order based on a certain criteria.
Use a sorting algorithm like bubble sort, selection sort, or merge sort to rearrange the elements in the linked list.
Traverse the linked list and compare each element with the next one to determine the order in which they should be sorted.
Update the pointers of the nodes in the linked list to reflect ...
posted on 21 Mar 2021
I applied via Referral and was interviewed in Feb 2021. There was 1 interview round.
A unique not null column can be used as a primary key, but not vice versa.
Primary key must be unique and not null, but not all unique not null columns need to be primary keys.
Primary key is used to identify each row uniquely, while unique not null column is used to ensure data integrity.
A table can have multiple unique not null columns, but only one primary key.
Null cannot be equated as it represents absence of a value.
Null is not equal to any value, including itself.
Attempting to equate null can result in unexpected behavior.
Null is often used to represent the absence of a value or unknown value.
I appeared for an interview in Sep 2024.
C programming and java
Advanced coding on c
I chose this company because of its innovative projects, strong company culture, and opportunities for growth.
Innovative projects that challenge me and allow me to learn new skills
Strong company culture that values teamwork and collaboration
Opportunities for growth and advancement within the company
My aim is to continuously improve my technical skills, contribute to innovative projects, and eventually become a technical leader in the field.
Continuous learning and skill development
Contribution to innovative projects
Becoming a technical leader in the field
I applied via Naukri.com and was interviewed in Jul 2022. There was 1 interview round.
SAP stands for Systems, Applications, and Products in Data Processing. It is an ERP software used for managing business operations.
SAP is an enterprise resource planning software used for managing business operations.
It integrates various business functions like finance, sales, production, and inventory management.
SAP helps in streamlining business processes, improving efficiency, and reducing costs.
It provides real-ti...
I applied via Naukri.com and was interviewed in Oct 2022. There were 3 interview rounds.
Java programming test for some coding scenarios.
I applied via Internshala and was interviewed in Dec 2021. There was 1 interview round.
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
I appeared for an interview before Jan 2021.
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.
You are provided with a binary tree consisting of N
nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all possible paths.
Handle cases where nodes have negative values.
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal, and update the intersection array.
Return the intersection array as the result.
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until finding a greater element or stack is empty
Given three integers X
, C
, and Y
, where X
is the first term of an arithmetic sequence with a common difference of C
, determine if Y
is part of this arithmetic sequ...
Check if a given number is part of an arithmetic sequence with a given first term and common difference.
Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C
Check if Y is equal to any term in the sequence to determine if it belongs to the sequence
Return 'True' if Y belongs to the sequence, otherwise return 'False'
Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.
A process is a program in execution, consisting of code, data, and resources.
Threads are smaller units within a process that can execute independently.
Processes have their own memory space, while threads share the same memory space within a process.
Processes are heavyweight, while threads ar...
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.
Given an array/list arr
of size n
, determine the maximum product possible by taking any subset of the array/list arr
. Return the result modulo 10^9+7
since the product ...
Find the maximum product of a subset of an array modulo 10^9+7.
Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.
Handle cases where the array contains zeros separately.
Return the maximum product modulo 10^9+7.
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
...Implement a function to update 'next' pointers in a complete binary tree.
Iterate level by level using a queue
Connect nodes at each level using 'next' pointers
Handle null nodes appropriately
Ensure the tree is a complete binary tree
Round duration - 50 Minutes
Round difficulty - Medium
This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.
Use two stacks - one to store the actual elements and another to store the minimum element at each level.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is t...
You are given an integer array arr
of size N
. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...
Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Split the array whenever the last occurrence of an element is found.
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.
based on 4 interviews
Interview experience
based on 24 reviews
Rating in categories
5-8 Yrs
Not Disclosed
5-15 Yrs
Not Disclosed
5-12 Yrs
Not Disclosed
Senior Software Engineer
2.5k
salaries
| ₹6 L/yr - ₹19.5 L/yr |
Software Engineer
2.3k
salaries
| ₹3.2 L/yr - ₹11.5 L/yr |
Technical Lead
1.9k
salaries
| ₹8.4 L/yr - ₹25.5 L/yr |
Senior Technical Lead
820
salaries
| ₹10 L/yr - ₹35 L/yr |
Software Developer
636
salaries
| ₹3.5 L/yr - ₹14.5 L/yr |
Amdocs
Automatic Data Processing (ADP)
24/7 Customer
Intellect Design Arena