ESurveying Softech DOT NET Developer Interview Questions and Answers

Multiple dispatch is not a feature of Redux. It can be achieved using middleware or custom logic.

• Middleware like redux-thunk or redux-saga can be used to dispatch multiple actions based on a single action.

• Custom logic can be implemented in the reducer to handle multiple actions based on a single action type.

• For example, a single 'ADD_ITEM' action can trigger multiple actions like 'UPDATE_TOTAL', 'UPDATE_HISTORY', etc.

• M...read more

Answering questions related to software development and Salesforce administration.

• Process Builder is a visual tool in Salesforce used to automate business processes.

• Types of relationships in Salesforce include lookup, master-detail, and many-to-many relationships.

• User represents an individual who can log in and access Salesforce, Profile defines the permissions and settings for a user, and Role determines the hierarchy...read more

I have configured various software systems and tools for development purposes.

• Configured IDEs such as Eclipse and Visual Studio for development

• Set up version control systems like Git and SVN

• Installed and configured build tools like Maven and Gradle

• Configured application servers like Tomcat and JBoss

• Set up databases like MySQL and Oracle for development and testing

Design optimal data structures for LRU cache

• Use a doubly linked list to keep track of recently used items

• Use a hash table to store key-value pairs for quick access

• When an item is accessed, move it to the front of the linked list

• When the cache is full, remove the least recently used item from the back of the linked list and hash table

Convert a sorted array to balanced binary search tree

• Find the middle element of the array and make it the root of the tree

• Recursively construct the left subtree using the left half of the array

• Recursively construct the right subtree using the right half of the array

• Repeat until all elements are added to the tree

Reverse a singly linked list in groups of k in­place

• Divide the linked list into groups of k nodes

• Reverse each group of k nodes

• Connect the reversed groups to form the final linked list

A recursive routine to calculate a ^ n

• The base case is when n is 0, in which case the result is 1

• For any other value of n, the result is a multiplied by the result of a^(n-1)

• The recursive function should call itself with a^(n-1) as the new input

Design optimal data structure for never-ending stream of numbers for insertion, deletion, searching, kth largest and kth smallest.

• Use a balanced binary search tree like AVL or Red-Black tree for efficient insertion, deletion, and searching.

• Maintain two heaps, one for kth largest and one for kth smallest.

• For finding kth largest, use a min heap of size k and for kth smallest, use a max heap of size k.

• Alternatively, use a...read more