Answer Posted / sivaprasad

1)In Array We Can Add any datatype value,Every item in
arraylist is treated as object.
2)Hashtable is collection of key,value pairs
i)Key Can be any datatype
ii)Key Cannot be null refrrence
iii)but value can be null referrence

Retrieving by key in Hashtable is faster than retrieving in
Arraylist,
Example of Arraylist:
Arraylist ar = new Arraylist();
ar.add("X");
ar.add(1);
ar.add(2);
Now if we Retrieve from Arraylist like
foreach(string str in ar)
{

}
It will Compile but it will give Runtime
Error,because '1' and '2' in Arraylist are integers.

Example Hashtable:
Hashtable ht = new Hashtable();
ht.add(1,"sample");
ht.add("2","Test");
ht.add(3,4);
foreach(Dictionaryentry dr in ht.keys.values)
{
Console.Writeline(dr.keys + "=" + dr.values);
}

The Above Code wont give any runtime Error Because We
are iterating through DictionaryEntries(Hashtable
implements IDictionary) it is Collection of Key/Value Pairs

What is the default value of object in c#?

919

---

What does do in c#?

976

---

What is the difference between int.parse and int.tryparse methods?

1046

---

What are native functions?

862

---

What do you mean by delegates and explain different types of delegates?

953

---

What is delegation in oops?

980

---

Define multicast delegate in c#?

926

---

How do generics work in c#?

902

---

List down the commonly used types of exceptions in .net

884

---

Is a char?

866

---

What is difference between interface and abstraction?

897

---

without modifying source code if we compile again, will it be generated MSIL again?

923

---

In a single .NET DLL how many classes it contains?

924

---

What is view model in c#?

845

---

Which namespace is required to implement trace ?

967

---