Differentiate between failfast and failsafe.
- 0 Answers
- 788 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
Which sorting algorithm has minimum number of swaps?
Can treeset contain null?
Write an algorithm that counts number of nodes in the circular linked list
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
What are two types of sorting?
Is hashtable fail fast?
What do you mean by level of the tree?
What is concept of data structure?
State the difference between persistent and ephemeral data structure?
Is merge sort better than quick?
Which sorting algorithm uses minimum number of swaps?
Windows 
