This article discuss about case conversion in C or C++ and shows the programs that convert from uppercase to lower case in c or C++.
Albert Stevens's insight:
Case Conversion is a process to convert upper case to lower case or to convert lower case to upper case. ASCII value of ‘A’ is 65 and ‘a’ is 97. Difference between them is 97 – 65 = 32 So if we will add 32 in the ASCII value of ‘A’ then it will be ‘a’ and if will we subtract 32 in ASCII value of ‘a’ it will be ‘A’. It is true for all alphabets.
The decimal (base ten) numeral system has ten possible values (0, 1, 2,3,4,5,6,7,8, or 9). The binary (base two) numeral system has two possible values (0 or 1). Binary system is the internal language of electronic computers. That’s why any computer programmer must need to know how to convert a decimal to binary. Follow C++ code will convert a decimal number into binary number.
Bubble sort is the simplest sorting algorithm. Starting from the beginning of the list it’s compared every adjacent pair and swap their position if they are not in the right order (The latter one is smaller than the former one). This process is repeated as many times as necessary until the array is sorted. It takes O(n) time.
Linear search or sequential search is a method for finding a particular value in a list by checking every one of its elements until the desired one is found. Every element is searched one at a time and in sequence. It is the simplest search algorithm. t is a special case of brute-force search. This searching algorithm is not efficient for large number of element. For large element we can use binary search or hashing.
Searching is one of the important mechanism in computer programming. It plays a good role to make a program slow or fast based on choice appropriate searching mechanism.
Heap sort is a sorting technique based comparison. It was invented by J. W. J. Williams in 1964. It is part of the selection sort. It is the improvement of basic selection sort and uses a logarithmic time priority queue rather than a linear time search. It takes O (n log n) times. We can divide the heap sort algorithm into two parts. In the first parts a heap is built out of the data. The heap is an array with the layout of a complete binary tree.
The C# is the most powerful and famous programming language for application development. This language is now widely used in different enterprise level application development. This article describes some advance questions and answers in C#. These C# questions will be very helpful for experience persons or experience developers.
This article shows how to write a C or C++ program to show prime numbers between a Range.
Albert Stevens's insight:
In mathematics Prime Number are those number whose can be divided evenly only by 1, or itself. It must be a whole number greater than 1. For example: 5 can only be divided evenly by 1 or 5, so it is a prime number. 6 can be divided evenly by 1, 2, 3 and 6. So 6 is not a prime number. it is a composite number.
The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23. There is no largest prime number. For every prime number p there exists a prime number p’ such that p’ is greater than p. This number was demonstrated in ancient times by the Greek mathematician Euclid.
The decimal (base ten) numeral system has ten possible values (0, 1, 2,3,4,5,6,7,8, or 9). The Roman Number system used the following ten symbols to represent 1-10 I, II, III, IV, V, VI, VII, VIII, IX, X.
Counting sort is a sorting technique based on keys between specific ranges. It works by counting the number of objects having distinct key values. It performs some arithmetic operation and calculates the position of each object in the output sequence. It works by counting the occurrences of each data value. It imagines that there are n data items in the range of 1…m (m is an integer). For each input element the algorithm can then determine, the amount of elements less than it. For example if there are 8 elements less than element x, then x belongs in the 9th data position.
The factorial means to multiply a series of descending natural numbers. Its symbol is! And pronounced n factorial. But some people even say “4 shriek” or “4 bang” In mathematics the factorial of a natural number n is the product of the positive integers less than or equal to n. It is written as n!
Merge Sort is a sorting technique based comparison. At first it divides the list into the smallest unit (1 element). Then compare each element with the adjacent list to sort and merge the two adjacent lists. At last all the elements are sorted and merged. It is Stable and takes O (n log n) times.
Albert Stevens's insight:
Table CreationsCreations of ASP.NET Web APIInclude AngularJSCreate AngularJS ControllerCreate User Interface
Design pattern is a guideline to find a solution for commonly occurring problems. Now a day’s design pattern and software design questions are essential part of any programming interview, especially for mid to senior level programming jobs. Day by day it is becoming more popular. This article describes some important questions and answers in asp.net design pattern
Sharing your scoops to your social media accounts is a must to distribute your curated content. Not only will it drive traffic and leads through your content, but it will help show your expertise with your followers.
How to integrate my topics' content to my website?
Integrating your curated content to your website or blog will allow you to increase your website visitors’ engagement, boost SEO and acquire new visitors. By redirecting your social media traffic to your website, Scoop.it will also help you generate more qualified traffic and leads from your curation work.
Distributing your curated content through a newsletter is a great way to nurture and engage your email subscribers will developing your traffic and visibility.
Creating engaging newsletters with your curated content is really easy.