Score Information Technologies Senior .NET Developer Interview Questions and Answers for Experienced

Aptitude ,logical reasoning and quant aptitude

Q1. Design tinyurl system design
Add your answer

It was online 60min test.

It was offline 30 min test.

Q1. Oops,dbms,css,html,dsa,java.
Add your answer
Q2. It was very friendly .
Add your answer

Q1. What are the 4 principles of oops?
Ans. 
The 4 principles of OOP are Inheritance, Encapsulation, Abstraction, and Polymorphism.
• Inheritance allows a class to inherit properties and behavior from another class.

• Encapsulation restricts access to certain components within a class, protecting the data.

• Abstraction hides complex implementation details and only shows the necessary features.

• Polymorphism allows objects to be treated as instances of their parent class.
Answered by AI
Add your answer
Q2. What is the difference between string buffer and string builder?
Ans. 
String buffer is synchronized and thread-safe, while string builder is not synchronized and faster.
• String buffer is synchronized, making it thread-safe for use in multi-threaded environments.

• String builder is not synchronized, providing better performance in single-threaded applications.

• String builder is faster than string buffer due to lack of synchronization overhead.

• Example: StringBuffer sb = new StringBuffer(); Str
Answered by AI
Add your answer
Q3. Why strings are immutable?
Ans. 
Strings are immutable in order to ensure data integrity and security.
• Immutable strings prevent accidental data modification, ensuring data integrity.

• Immutable strings enhance security by preventing unauthorized access or tampering.

• Immutable strings allow for more efficient memory management and optimization.

• Example: 'Hello' cannot be changed to 'Hella' directly, a new string must be created.
Answered by AI
Add your answer
Q4. What are the different types of exception in java?
Ans. 
There are two types of exceptions in Java: checked exceptions and unchecked exceptions.
• Checked exceptions are checked at compile time and must be handled using try-catch or throws keyword.

• Unchecked exceptions are not checked at compile time and include RuntimeException and its subclasses.

• Examples of checked exceptions include IOException, SQLException, and ClassNotFoundException.

• Examples of unchecked exceptions include...read more
Answered by AI
Add your answer
Q5. Explain linear search algorithm.
Ans. 
Linear search is a simple searching algorithm that sequentially checks each element in a list until a match is found.
• Iterate through each element in the list

• Compare the current element with the target value

• Return the index if a match is found, otherwise return -1
Answered by AI
Add your answer
Q6. Difference between JDK jvm and jre
Ans. 
JDK includes JRE and development tools, while JRE includes only the Java Runtime Environment.
• JDK stands for Java Development Kit, which includes JRE and development tools like compilers and debuggers.

• JRE stands for Java Runtime Environment, which includes JVM and libraries necessary to run Java applications.

• JVM stands for Java Virtual Machine, which is responsible for executing Java bytecode.

• JDK is used for developing ...read more
Answered by AI
Add your answer

Aptitude test was simple.

Q1. Asked 2 questions from recursion.
Add your answer

Q1. Simple HR round.
Add your answer

50 questions in 12 minutes mostly test your arthimetic, logical knowledge.

3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.

Q1. Difference between sorting algorithms
Ans. 
Sorting algorithms are methods used to arrange elements in a specific order.
• Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

• Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.

• For example, quick sort is generally faster than bubble sort for large data sets.
Answered by AI
View 1 more answer
Q2. BFS and DFS in trees and imlementing them
Ans. 
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
• BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
Answered by AI
Add your answer
Q3. Sql questions and database questions
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Explain the college life
Add your answer

Question from Array,DP

Q1. Resume based only
Add your answer
Q2. Data structure and algorithms
Add your answer
Q3. Object oriented programmings
Add your answer

Q1. Behavioural questions
Add your answer