Difference between array, arraylist, List, Hashtable, Dictionary and SortedList in c#

Basic difference is that arrays are of fixed size. Whereas an ArrayList implements the list data structure and can dynamically grow. While arrays would be more performance that a list, a list would be far more flexible since you don't need to know the required size initially. Array - represents an old-school memory array - kind of like a alias for a normal type[] array. Can enumerate. Can't grow automatically. I would assume very fast insertion, retrieve and speed. ArrayList - automatically growing array. Adds more overhead. Can enum., probably slower than a normal array but still pretty fast. These are used a lot in .NET List - one of my favorites - can be used with generics, so you can have a strongly typed array, e.g. List . Other than that, acts very much like ArrayList. Hashtable - plain old hashtable. O(1) to O(n) worst case. Can enumerate the value and keys properties, and do key/val pairs. Dictionary - same as above only strongly typed via generics, such a...

What is ACID rule for transactions in Database

Following is the important ACID rule for transactions in relational Database
  • Transaction must be Atomic (it is one unit of work and does not dependent on previous and following transactions)
  • Transaction must be Consistent (data is either committed or roll back, no “in-between” case where something has been updated and something hasn’t)
  • Transaction must be Isolated (no transaction sees the intermediate results of the current transaction)
  • Transaction must be Durable (the values persist if the data had been committed even if the system crashes right after)

Comments

  1. ok thanks for this post it's quite informative and I have learned new things.

    appvn

    ReplyDelete

Post a Comment

Popular posts from this blog

C# Interview Questions on Inheritance

C# Interview Questions on value types and reference types

Why to use UpdatePanel control in AJAX ASP.NET?