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 are anonymous functions in c#?

958

---

What will be the output of the following code?

927

---

Which string method is used for concatenation of two strings in c#?

1016

---

What kind of the information stored inside the assembly?

1007

---

Why we use oops in c#?

983

---

What is an Interface in C#?

981

---

Why do we use public static void main in c#?

954

---

Explain the mechanism of VB.NET/C# achieve polymorphism?

1004

---

What is iqueryable in c#?

900

---

Why would you use untrusted verification?

931

---

What is xslt in c#?

872

---

What is the use of GC.KeepAlive Method?

1162

---

What are value types and reference types?

1138

---

What is difference between float and integer?

992

---

Why is lazy loading?

876

---