Upload Button Icon Add office photos

Filter interviews by

Questionpro Senior .NET Developer Interview Questions and Answers

Updated 26 Feb 2021

Questionpro Senior .NET Developer Interview Experiences

1 interview found

I applied via LinkedIn and was interviewed in Jan 2021. There were 3 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Basic OOP
  • Q2. DB schema creation for cinducting an online test
  • Ans. 

    DB schema for online test

    • Create tables for questions, answers, users, and results

    • Use foreign keys to link tables together

    • Include fields for question type, difficulty level, and time limit

    • Store user responses and calculate scores

    • Consider security measures to prevent cheating

  • Answered by AI
  • Q3. Explain yourself in detail
  • Q4. Architecture for your project and if required what changes you need to do

Interview Preparation Tips

Interview preparation tips for other job seekers - Be clear with the answers.

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The second round is also written but you need to write programming based on their concept.

  • Q1. 

    Prime Numbers Identification

    Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

    Explanation:

    A prime number is a natural number greater than 1 that has no po...

  • Ans. 

    Identify all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime

    • Use the Sieve of Eratosthenes algorithm for better efficiency

    • Optimize by only checking up to the square root of N for divisors

  • Answered by AI
  • Q2. 

    Palindrome String Validation

    Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.

    Note:
    The string 'S' should be evaluated in a case...
  • Ans. 

    Check if a given string is a palindrome after removing special characters, spaces, and converting to lowercase.

    • Remove special characters and spaces from the string

    • Convert the string to lowercase

    • Check if the modified string is a palindrome by comparing characters from start and end

  • Answered by AI
Round 2 - Face to Face 

(6 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions mainly on Java and OOPS concepts.

  • Q1. What is the difference between static methods and instance methods in Java?
  • Ans. 

    Static methods belong to the class itself, while instance methods belong to individual objects of the class.

    • Static methods are called using the class name, while instance methods are called using object references.

    • Static methods cannot access instance variables directly, while instance methods can access both static and instance variables.

    • Static methods are shared among all instances of the class, while instance method...

  • Answered by AI
  • Q2. What is the difference between an abstract class and an interface in Java?
  • Ans. 

    Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.

    • Abstract class can have constructors, member variables, and methods with implementation.

    • Interface can only have abstract methods and constants.

    • A class can implement multiple interfaces but can only extend one abstract class.

    • Example: Abstract class - Animal with abstract method 'eat', Interface - Flyable with m

  • Answered by AI
  • Q3. What is the difference between ClassNotFoundException and NoClassDefFoundError in Java?
  • Ans. 

    ClassNotFoundException occurs when a class is not found during runtime, while NoClassDefFoundError occurs when a class was found during compilation but not during runtime.

    • ClassNotFoundException is a checked exception, while NoClassDefFoundError is an Error.

    • ClassNotFoundException occurs when a class is not found at runtime, usually due to a missing classpath or incorrect class name.

    • NoClassDefFoundError occurs when a cla...

  • Answered by AI
  • Q4. What is the difference between an Error and an Exception in Java?
  • Ans. 

    Error is a serious issue that cannot be handled at runtime, while Exception is a recoverable issue that can be caught and handled.

    • Error is a subclass of Throwable and is usually caused by the environment or system, such as running out of memory or stack overflow.

    • Exception is also a subclass of Throwable but is caused by the application code, such as invalid input or file not found.

    • Errors are unchecked and are not meant...

  • Answered by AI
  • Q5. What is SerialVersionUID in Java?
  • Ans. 

    SerialVersionUID is a unique identifier used by Java to ensure the compatibility of serialized objects.

    • SerialVersionUID is a static final long variable in a class that implements Serializable interface.

    • It is used to ensure that the serialized object can be deserialized correctly even if the class definition has changed.

    • If the SerialVersionUID of the serialized object does not match the one in the class, an InvalidClass...

  • Answered by AI
  • Q6. What are the requirements for creating an immutable class in Java?
  • Ans. 

    Requirements for creating an immutable class in Java

    • Make the class final so it cannot be extended

    • Make all fields private and final

    • Do not provide setter methods, only getter methods

    • Ensure that mutable objects are not returned in getter methods

    • Override equals() and hashCode() methods for proper comparison

    • Consider making defensive copies of mutable fields in constructor or getter methods

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAYodlee interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Questions about Oops, data structures based on the projects I had done, and my resume
  • Q2. Questions about classes and abstraction

Interview Preparation Tips

Interview preparation tips for other job seekers - 2 parts; part 1 is a coding test and part 2 is discussion.

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

I applied via Naukri.com and was interviewed before Jul 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Questions about the projects you worked with. About how specific coding challenges were solved. How it could have been done other ways. etc.
  • Q2. About Python versions and differences. Impact on frameworks.
  • Q3. About module design, apis.

Interview Preparation Tips

Interview preparation tips for other job seekers - It is a relaxed interview, like a discussion. The questions are tough in that they make you think. Review your previous projects and be honest.

I applied via Campus Placement and was interviewed in Sep 2021. There was 1 interview round.

Interview Preparation Tips

Interview preparation tips for other job seekers - Be thorough with DSA and low level design. Also have a good idea about Computer science fundamentals .
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Implement tail -f command

Round 2 - Technical 

(2 Questions)

  • Q1. Kafka partitions
  • Q2. Elasticsearch queries
Round 3 - HR 

(2 Questions)

  • Q1. Why Browserstack?
  • Ans. 

    Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.

    • Provides access to a wide range of browsers and devices for testing

    • Allows for parallel testing to save time and increase efficiency

    • Integrates with popular testing frameworks like Selenium and Appium

    • Offers features like screenshots, video recordings, and debugging tools

    • Used by companies like Microsoft, Twitter, and Airbnb for t

  • Answered by AI
  • Q2. Any challenge you faced at current company?
  • Ans. 

    Yes, I faced a challenge in integrating a new third-party API with our existing system.

    • Had to understand the documentation of the API thoroughly

    • Encountered compatibility issues with our system

    • Worked closely with the API provider to troubleshoot and resolve issues

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Aptitude Test 

Aptitude questions with 2-3 coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. Input-wwwrrrrttttuu Output - w3r4t4u2
  • Q2. Interpreter vs compiler
  • Ans. 

    Interpreter executes code line by line, compiler translates code into machine code before execution.

    • Interpreter translates code into machine code line by line during runtime

    • Compiler translates code into machine code before execution

    • Interpreted languages include Python, JavaScript

    • Compiled languages include C, C++

  • Answered by AI
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Jun 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

Logical reasoning and general aptitude

Round 2 - Coding Test 

Data structures and algorythm questions

Round 3 - One-on-one 

(2 Questions)

  • Q1. Previous company culture and challenges
  • Q2. Expectations from this company.

Interview Preparation Tips

Interview preparation tips for other job seekers - overall easy process
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Implement tail f

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn development along with DSA

Tell us how to improve this page.

Interview Questions from Similar Companies

BrowserStack Interview Questions
3.6
 • 48 Interviews
SurveySparrow Interview Questions
3.8
 • 24 Interviews
Fingent Interview Questions
4.4
 • 22 Interviews
Backbase Interview Questions
3.9
 • 22 Interviews
Khoros Interview Questions
3.7
 • 19 Interviews
3Pillar Global Interview Questions
3.3
 • 19 Interviews
Mentor Graphics Interview Questions
4.0
 • 18 Interviews
Yodlee Interview Questions
3.8
 • 17 Interviews
View all
Technical Support Engineer
24 salaries
unlock blur

₹2.8 L/yr - ₹6.5 L/yr

Customer Success Manager
23 salaries
unlock blur

₹6.6 L/yr - ₹13 L/yr

Product Manager
22 salaries
unlock blur

₹8.6 L/yr - ₹30 L/yr

Senior Java Developer
20 salaries
unlock blur

₹8.5 L/yr - ₹33 L/yr

Java Developer
18 salaries
unlock blur

₹4.1 L/yr - ₹15.4 L/yr

Explore more salaries
Compare Questionpro with

Qualtrics XM

2.2
Compare

SoGoSurvey

3.5
Compare

Yodlee

3.8
Compare

Fingent

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