Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by BUSINESSNEXT Team. If you also belong to the team, you can get access from here

BUSINESSNEXT Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

BUSINESSNEXT .NET Software Developer Interview Questions and Answers

Updated 23 Oct 2023

BUSINESSNEXT .NET Software Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via Approached by Company and was interviewed in Sep 2023. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

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.

Round 3 - Technical 

(3 Questions)

  • Q1. Tell me about youself (expecting career journey)
  • Ans. 

    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...

  • Answered by AI
  • Q2. SQL queries , joins, indexing, write queries, Triggers and write triggers, features of OOPs, Having vs WHERE clause,
  • Q3. Difference in Webservices and WCF, Abstraction and its types, Boxing and Unboxing
  • Ans. 

    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...

  • Answered by AI
Round 4 - Technical 

(7 Questions)

  • Q1. Tell me about your project.
  • Ans. 

    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

  • Answered by AI
  • Q2. Write queries and joins
  • Ans. 

    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

  • Answered by AI
  • Q3. REST is implemented using which protocol
  • Q4. CHAR, VARHAR, NVARCHAR
  • Q5. Caching and its types
  • Ans. 

    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...

  • Answered by AI
  • Q6. Project related questions
  • Q7. Mostly questions on database and queries and stored procedures.
Round 5 - HR 

(4 Questions)

  • Q1. Tell me something about yourself?
  • Ans. 

    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

  • Answered by AI
  • Q2. Salary Expectations?
  • Q3. Why are you looking for switch?
  • Ans. 

    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

  • Answered by AI
  • Q4. Why do you want to join CRM?
  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and study the JD well. Be prepared with your resume and the profile you are applying for. Majorly practice SQL.

Skills evaluated in this interview

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Filter in MVC
  • Ans. 

    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.

  • Answered by AI
  • Q2. Authentication and authorisation

Interview Preparation Tips

Interview preparation tips for other job seekers - Please prepare all basics of MVC,SQL and C#

Skills evaluated in this interview

I applied via Company Website and was interviewed before Aug 2021. There were 4 interview rounds.

Round 1 - Aptitude Test 

First Round was Aptitute Test having Aptitute Question And Java Questions.

Round 2 - Coding Test 

Second round was coding round having two DSA problems

Round 3 - One-on-one 

(1 Question)

  • Q1. 1. Difference between .equals() and == function. 2. Fibonacci series 3. MultiThreading
  • Ans. 

    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...

  • Answered by AI
Round 4 - One-on-one 

(1 Question)

  • Q1. 1. Javascript code to find the frequency of characters in a sentence. 2. Difference between dynamic and static intialization.
  • Ans. 

    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...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Follow Basics of Java And Javascript.
Go through Concepts of OOPs

Skills evaluated in this interview

I appeared for an interview in Apr 2021.

Interview Questionnaire 

2 Questions

  • Q1. Personal based questions
  • Q2. Technical questions based on Java

I applied via Referral and was interviewed in Apr 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Sql based quedtion

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare continuously don't lose hope

I applied via Naukri.com and was interviewed before Oct 2021. There were 3 interview rounds.

Round 1 - One-on-one 

(1 Question)

  • Q1. Esay leave DSA questions
Round 2 - One-on-one 

(1 Question)

  • Q1. Java, OOPS, Collection,HashMap working
Round 3 - One-on-one 

(1 Question)

  • Q1. Manager Round, previous projects, role and responsibilities

Interview Preparation Tips

Interview preparation tips for other job seekers - interview is quite easy, just focus on DSA basic questions

Interview Questionnaire 

1 Question

  • Q1. Oops programming,SQL server Database

Interview Preparation Tips

Round: Test
Experience: Though technical questions were not that difficult but the quant section was way too hard and almost impossible to solve completely in given time limit.
Tips: It’s better if you attempt less questions (in quant) but do them right (I attempted less than 40% quant and still got through).

Round: Technical Interview
Experience: Next they would have 2-3 technical rounds where they cover most of the areas of CS. Some of the areas where they concentrated more would be Algorithms, OOPS Concepts and Logical Puzzles.
Tips: Brush up important concepts from various areas such as Operating System, OOPS, Software Engineering. Be ready for some really challenging questions in Algorithms. Also they do ask quite a few logical puzzles so it’s important you practice a lot of them online before the interview.

General Tips: D E Shaw selects very few candidates + comes in starting weeks of placement season, so competition is immense. Multiple companies come on same day, so it becomes a little tedious. Surely I wasn't the better candidate that day.
Skill Tips: D E Shaw focuses more on your ability to solve logical problems, so make sure you are in best state of your mind and speak while solving any problem because what they are looking for is not the right answer (well of course they are) but also how are you approaching the problem.
Skills: Operating System, OOPS, Algorithms, CS, logical puzzles, Quant
College Name: NIT SURATHKAL

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    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

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    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

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    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

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    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

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    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

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    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

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    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

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    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.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    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.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    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.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    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

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    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).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    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

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    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.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Salary discussion and notice period
  • Q2. Core java, collections and coding

Interview Preparation Tips

Round: Manager Round
Experience: About project and previous company experience , daily activity

BUSINESSNEXT Interview FAQs

How many rounds are there in BUSINESSNEXT .NET Software Developer interview?
BUSINESSNEXT interview process usually has 5 rounds. The most common rounds in the BUSINESSNEXT interview process are Technical, Resume Shortlist and Aptitude Test.
How to prepare for BUSINESSNEXT .NET Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at BUSINESSNEXT. The most common topics and skills that interviewers at BUSINESSNEXT expect are Software Development.
What are the top questions asked in BUSINESSNEXT .NET Software Developer interview?

Some of the top questions asked at the BUSINESSNEXT .NET Software Developer interview -

  1. Difference in Webservices and WCF, Abstraction and its types, Boxing and Unboxi...read more
  2. Caching and its ty...read more
  3. Write queries and jo...read more

Tell us how to improve this page.

BUSINESSNEXT .NET Software Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

KPIT Technologies Interview Questions
3.4
 • 291 Interviews
Chetu Interview Questions
3.2
 • 176 Interviews
AVASOFT Interview Questions
2.9
 • 167 Interviews
Oracle Cerner Interview Questions
3.7
 • 158 Interviews
Brane Enterprises Interview Questions
2.0
 • 135 Interviews
ivy Interview Questions
3.6
 • 129 Interviews
DE Shaw Interview Questions
3.8
 • 121 Interviews
ServiceNow Interview Questions
4.1
 • 121 Interviews
Axtria Interview Questions
3.0
 • 118 Interviews
View all
Engineer
260 salaries
unlock blur

₹3.5 L/yr - ₹12 L/yr

Consultant
239 salaries
unlock blur

₹4.8 L/yr - ₹14.7 L/yr

Business Analyst
220 salaries
unlock blur

₹4 L/yr - ₹13.7 L/yr

Software Engineer
200 salaries
unlock blur

₹3.5 L/yr - ₹12 L/yr

Senior Consultant
161 salaries
unlock blur

₹6.2 L/yr - ₹15 L/yr

Explore more salaries
Compare BUSINESSNEXT with

Thomson Reuters

4.1
Compare

Oracle Cerner

3.7
Compare

NextComm Corporation

4.8
Compare

Chetu

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