Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Programming Articles
Page 606 of 2544
Find smallest number n such that n XOR n+1 equals to given k in C++
Suppose we have a positive number k. We have to find the positive number n, such that XOR of n and n+1 is same as k. So if k = 7 (111), output will be 3. As 3 (011), and 3 + 1 = 4 (100), so 011 XOR 100 = 111 (7)There are two possible cases. Consider n is even. The last bit of n = 0. Then the last bit of n + 1 = 1. Rest of the bits are same. So XOR will be 1, when n is odd, last bit 1, and last bit of ...
Read MoreGet or set the value associated with the specified key in StringDictionary in C#
To get or set the value associated with specified key in StringDictionary, the code is as follows −Exampleusing System; using System.Collections.Specialized; public class Demo { public static void Main() { StringDictionary strDict = new StringDictionary (); strDict.Add("A", "Books"); strDict.Add("B", "Electronics"); strDict.Add("C", "Appliances"); strDict.Add("D", "Pet Supplies"); strDict.Add("E", "Clothing"); strDict.Add("F", "Footwear"); Console.WriteLine("Value associated with key D = "+strDict["D"]); Console.WriteLine("Value associated with key F = "+strDict["F"]); } }OutputThis will produce the following output −Value associated with key D = Pet Supplies ...
Read MoreFind index of closing bracket for a given opening bracket in an expression in C++
Consider we have an expression with brackets. If the index of one starting bracket is given, we have to find the closing ending bracket of that. So if the expression is like: (25*6+(88-32+(50/10)+20)), and the index of opening bracket is 6, then closing bracket will be at position 23.Here we will use the stack data-structure to solve this problem. We will traverse the expression from given index, and start pushing the opening brackets, when closing bracket is found, then pop element from stack, when the stack is empty, then return the index.Example#include #include using namespace std; void getEndingBracketIndex(string exp, int ...
Read MoreGet the number of strings in StringCollection in C#
To get the number of strings in StringCollection, the code is as follows −Exampleusing System; using System.Collections.Specialized; public class Demo { public static void Main() { StringCollection strCol = new StringCollection(); String[] strArr = new String[] { "A", "B", "C", "D", "E", "F", "G", "H" }; Console.WriteLine("StringCollection elements..."); foreach (string str in strArr) { Console.WriteLine(str); } strCol.AddRange(strArr); Console.WriteLine("Element at 5th index = "+strCol[5]); Console.WriteLine("Count of strings in StringCollection = " + ...
Read MoreCheck if Caps Lock and Num Lock is on or off through Console in C#
To check if Caps Lock is on or off through Console, the code is as follows −Exampleusing System; public class Demo{ public static void Main(string[] args){ Console.WriteLine("The CAPS LOCK is on or not? "+ Console.CapsLock); } }OutputThis will produce the following output −The CAPS LOCK is on or not? FalseExampleTo check if Num Lock is on or off through Console, the code is as follows −using System; public class Demo{ public static void Main(string[] args){ Console.WriteLine("The Num LOCK is on or not? "+ Console.NumberLock); } }OutputThis will produce the following ...
Read MoreFind sum of even index binomial coefficients in C++
Consider we have a number n, we have to find the sum of even indexed binomial coefficients like $$\left(\begin{array}{c}n\ 0\end{array}\right)+\left(\begin{array}{c}n\ 2\end{array}\right)+\left(\begin{array}{c}n\ 4\end{array}\right)+\left(\begin{array}{c}n\ 6\end{array}\right)+...\left(\begin{array}{c}4\ 0\end{array}\right)+\left(\begin{array}{c}4\ 2\end{array}\right)+\left(\begin{array}{c}4\ 4\end{array}\right)++=1+6+1=8$$So here we will find all the binomial coefficients, then only find the sum of even indexed values.Example#include using namespace std; int evenIndexedTermSum(int n) { int coeff[n + 1][n + 1]; for (int i = 0; i
Read MoreFind k-th bit in a binary string created by repeated invert and append operations in C++
Suppose we have a binary string s, initially this is say “0”. Now in each iteration invert it, and append it, thus after nth iteration, we will find the kth bit. Suppose the number of iteration is 4, and k = 7, so it will be −IterationValue (Initially 0)1012011030110100140110100110010110so 7th bit is 1.In each iteration, find complement, and append, thus after nth iteration, finds kth bitExample#include using namespace std; string getComplement(string bin){ string temp = ""; for(int i= 0; i
Read MoreRemove the element with the specified key from a SortedList in C#
To remove the element with the specified key from a SortedList, the code is as follows −Exampleusing System; using System.Collections; public class Demo { public static void Main(String[] args) { SortedList sortedList = new SortedList(); sortedList.Add("A", "1"); sortedList.Add("B", "2"); sortedList.Add("C", "3"); sortedList.Add("D", "4"); sortedList.Add("E", "5"); sortedList.Add("F", "6"); sortedList.Add("G", "7"); sortedList.Add("H", "8"); sortedList.Add("I", "9"); sortedList.Add("J", "10"); Console.WriteLine("SortedList elements..."); foreach(DictionaryEntry d in ...
Read MoreCheck if two OrderedDictionary objects are equal in C#
To check if two OrderedDictionary objects are equal, the code is as follows −Exampleusing System; using System.Collections; using System.Collections.Specialized; public class Demo { public static void Main() { OrderedDictionary dict1 = new OrderedDictionary(); dict1.Add("A", "Books"); dict1.Add("B", "Electronics"); dict1.Add("C", "Smart Wearables"); dict1.Add("D", "Pet Supplies"); dict1.Add("E", "Clothing"); dict1.Add("F", "Footwear"); Console.WriteLine("OrderedDictionary1 elements..."); foreach(DictionaryEntry d in dict1) { Console.WriteLine(d.Key + " " + d.Value); } OrderedDictionary ...
Read MoreFind length of period in decimal value of 1/n in C++
Suppose we have a number n. We have to find the length of period in decimal value of 1/n. So if the value of n is 7, then 1/7 = 0.142857142857… That part in bold letters are repeating. So here the length of period is 6.For a number n, there can be n distinct remainders in the output, but the period may not begin from the first remainder as some initial remainders are non-repeating. So we have to make sure that a remainder from period is picked, start from (n+1)th remainder, and start looking for the next occurrence. The distance ...
Read More