i
BUSINESSNEXT
Filter interviews by
I applied via Approached by Company and was interviewed in Sep 2023. There were 5 interview rounds.
There were two test given. one was related to JD that I have applied. It was 30 min mcq test with 25 questions on .net, sql, oracle, Entity Framework. The second test was also of 30 min with logical reasoning mcq with 25 questions. The level was average. And I was able to clear it.
I am a software developer with a strong focus on .Net technologies.
I have a Bachelor's degree in Computer Science.
I have been working as a software developer for 5 years.
I have expertise in .Net framework and have developed several web applications using C# and ASP.Net.
I am experienced in database management and have worked with SQL Server.
I am familiar with Agile methodologies and have worked in Scrum teams.
I have a s...
Webservices and WCF are both used for communication between applications. Abstraction is a concept in programming. Boxing and unboxing are operations in .NET.
Webservices and WCF are both used for communication between applications, but WCF provides more advanced features like message queuing and reliable sessions.
Abstraction is a concept in programming that allows us to hide complex implementation details and only expo...
Developed a web application for managing inventory and sales
Used .NET framework and C# for backend development
Implemented a responsive user interface using HTML, CSS, and JavaScript
Integrated with a database to store and retrieve data
Implemented authentication and authorization for secure access
Implemented various features like product search, order management, and reporting
The candidate is asked to write queries and joins.
Understand the requirements and constraints of the query
Identify the tables and columns needed for the query
Write the query using appropriate syntax and functions
Use joins to combine data from multiple tables
Test the query to ensure it returns the expected results
Caching is a technique to store frequently accessed data in a temporary storage to improve performance.
Caching improves application performance by reducing the need to fetch data from the original source.
Types of caching include in-memory caching, database caching, and distributed caching.
In-memory caching stores data in the application's memory for quick access.
Database caching stores frequently accessed data in a sep...
I am a software developer with expertise in .Net. I have experience in developing web applications using C# and ASP.Net.
Proficient in .Net framework and C# programming language
Skilled in developing web applications using ASP.Net and MVC architecture
Experience in working with databases like SQL Server
Familiar with front-end technologies like HTML, CSS, and JavaScript
Strong problem-solving and analytical skills
Excellent
I am looking for a switch because I am seeking new challenges and opportunities to grow as a software developer.
Seeking new challenges and opportunities
Desire for professional growth
Exploring different technologies and frameworks
Looking for a better work-life balance
Interested in joining a more innovative and dynamic team
I want to join CRM because of its reputation for innovative software development and its focus on customer relationship management.
CRM is known for its cutting-edge software development practices.
CRM has a strong emphasis on customer relationship management, which aligns with my interests and skills.
I am impressed by CRM's track record of delivering high-quality software solutions to its clients.
Joining CRM would provi...
I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.
Filter in MVC is used to retrieve a subset of data from a larger dataset based on certain criteria.
Filters can be applied to data in the model or in the view.
Filters can be used to sort, group, or limit the data returned.
Filters can be implemented using LINQ or other query languages.
Examples of filters include date range filters, category filters, and search filters.
I applied via Company Website and was interviewed before Aug 2021. There were 4 interview rounds.
First Round was Aptitute Test having Aptitute Question And Java Questions.
Second round was coding round having two DSA problems
Questions on Java basics - .equals() vs ==, Fibonacci series, and MultiThreading.
The .equals() function compares the values of two objects, while == compares their memory addresses.
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
MultiThreading is a technique where multiple threads of execution run concurrently within a single program.
Examples: 5 == 5 is true, but new Str...
Javascript code to find frequency of characters in a sentence and difference between dynamic and static initialization.
To find frequency of characters in a sentence, create an object and iterate over each character in the sentence. Increment the count of each character in the object.
Dynamic initialization refers to initializing a variable at runtime, while static initialization refers to initializing a variable at comp...
I appeared for an interview in Apr 2021.
I applied via Referral and was interviewed in Apr 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Oct 2021. There were 3 interview rounds.
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
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
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
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
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
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
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
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.
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.
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.
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
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).
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
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.
based on 1 interview
Interview experience
Engineer
260
salaries
| ₹3.5 L/yr - ₹12 L/yr |
Consultant
239
salaries
| ₹4.8 L/yr - ₹14.7 L/yr |
Business Analyst
220
salaries
| ₹4 L/yr - ₹13.7 L/yr |
Software Engineer
200
salaries
| ₹3.5 L/yr - ₹12 L/yr |
Senior Consultant
161
salaries
| ₹6.2 L/yr - ₹15 L/yr |
Thomson Reuters
Oracle Cerner
NextComm Corporation
Chetu