Declare and initialize a list.var products = new List (); products.Add("Accessories"); products.Add("Clothing"); products.Add("Footwear");To get the size, use the Capacity property.products.CapacityNow let us see the complete code to find the size of a list.Example Live Demousing System; using System.Collections.Generic; public class Demo {    public static void Main(string[] args) {       var products = new List ();       products.Add("Accessories");       products.Add("Clothing");       products.Add("Footwear");       Console.WriteLine("Our list....");       foreach(var p in products) {          Console.WriteLine(p);       }       Console.WriteLine("Size of list = " + products.Capacity);    } }OutputOur list.... Accessories Clothing Footwear Size of list = 4

For volume and surface area of a sphere, firstly declare a variable with the value of radius.int r = 15;Get the volume f the sphere.// calculating volume of sphere cal_volume = (4.0 / 3) * (22 / 7) * r * r * r;Now the surface area of the sphere is calculated −cal_area = 4 * (22 / 7) * r * r;Let us see the complete code −Example Live Demousing System; using System.Collections.Generic; public class Demo {    public static void Main(string[] args) {       double cal_area, cal_volume, r;       // radius       ... Read More

Firstly, set the two numbers to be multiplied.val1 = 10; val2 = 20;Now cal the method to find the product.product(val1, val2);Under the product method, a recursive call will get you the product.val1 + product(val1, val2 – 1)Let us see the complete code to find the product of 2 numbers using recusion.Exampleusing System; class Calculation {    public static void Main() {       int val1, val2, res;       // the two numbers       val1 = 10;       val2 = 20;       // finding product       Demo d = new ... Read More

To find the rank of an array, use the Rank property.Firstly, declare and initialize an array.int[,] myArr = new int[3,3];Now, get the rank.myArr.RankLet us see the complete code −Example Live Demousing System; class Demo {    static void Main() {       int[,] myArr = new int[3,3];       Console.WriteLine("Rank of Array : " + myArr.Rank);    } }OutputRank of Array : 2

To get the index of an item in a single line, use the FindIndex() and Contains() methods.int index = myList.FindIndex(a => a.Contains("Tennis"));Above, we got the index of an element using the FindIndex(), which is assisted by Contains() method for that specific element.Here is the complete code −Example Live Demousing System; using System.Collections.Generic; public class Program {    public static void Main() {       List myList = new List () {          "Football",          "Soccer",          "Tennis",       };       // finding index   ... Read More

Firstly, set a jagged array.int[][] arr = new int[][] {    new int[] {       0,       0    }, new int[] {       1,       2    },    new int[] {       2,       4    }, new int[] {       3,       6    }, new int[] {       4,       8    } };Now, use the GetLowerBound(), GetUpperBound() and Rank property to get the lenth and rank of the array as shown in the following code ... Read More

First, declare and initialize two variables with the binary numbers.val1 = 11010; val2 = 10100; Console.WriteLine("Binary one: " + val1); Console.WriteLine("Binary two: " + val2);To get the sum, loop until both the value are 0.while (val1 != 0 || val2 != 0) {    sum[i++] = (val1 % 10 + val2 % 10 + rem) % 2;    rem = (val1 % 10 + val2 % 10 + rem) / 2;    val1 = val1 / 10;    val2 = val2 / 10; }Now, let us see the complete code to find the sum of two binary numbers.Example Live Demousing ... Read More

To get the first character, use the substring() method.Let’s say the following is our string −string str = "Welcome to the Planet!";Now to get the first character, set the value 1 in the substring() method.string res = str.Substring(0, 1);Let us see the complete code −Example Live Demousing System; public class Demo {    public static void Main() {       string str = "Welcome to the Planet!";       string res = str.Substring(0, 1);       Console.WriteLine(res);    } }OutputW

To get the sum of digits using recursion, set a method in C# that calculates the sum.static int sum(int n) {    if (n != 0) {       return (n % 10 + sum(n / 10));    } else {       return 0;    }The above method returns the sum and checks it until the entered number is not equal to 0.The recursive call returns the sum of digits o every recursive call −return (n % 10 + sum(n / 10));Let us see the complete code −Example Live Demousing System; class Demo {    public static void ... Read More

To find the product of two binary numbers, firstly set them.val1 = 11100; val2 = 10001; Console.WriteLine("Binary one: "+val1); Console.WriteLine("Binary two: "+val2);Now loop through to get the product.while (val2 != 0) {    digit = val2 % 10;    if (digit == 1) {       val1 = val1 * factor;       prod = displayMul(val1, prod);    } else    val1 = val1 * factor;    val2 = val2 / 10;    factor = 10; } Console.WriteLine("Product = {0}", prod);Above a method displayMul() is called with the first binary number.static long displayMul (long val1, long val2) ... Read More