In this video tutorial we illustrate the bubble sort algorithm and also see how to write it in C programming, for 5 elements as well as to N elements. ... https://www.youtube.com/watch?v=Ne9QNWuGJvw
http://technotip.com/7016/c-program-to-convert-octal-number-to-decimal-number-using-while-loop/
Lets write a C program to convert a number from Octal number system(base 8) to Decimal number system(base 10), using while loop.
Expected Output for the Input
User Input:
Enter an Octal Number
24
Output:
Decimal Equivalent of 24 is 20.
If user enters num = 24.
( pow(8, 1) x 2 ) + ( pow(8, 0) x 4)
= (8 x 2) + (1 x 4)
= 16 + 4
= 20
So Decimal equivalent of Octal number 24 is 20.
C Programming Interview / Viva Q&A List
http://technotip.com/6378/c-programming-interview-viva-qa-list/
C Programming: Beginner To Advance To Expert
http://technotip.com/6086/c-programming-beginner-to-advance-to-expert/
...
https://www.youtube.com/watch?v=QVksCjl2yhY
http://technotip.com/4211/creating-unique-key-index-mongodb/
We have learnt how to create a key/index so far - today lets learn how to create unique key/index in MongoDB.
MongoDB Video Tutorial List:
http://technotip.com/3778/mongodb-tutorial-list/
...
https://www.youtube.com/watch?v=QEy1IctH99w
http://technotip.com/6959/c-program-to-find-sum-of-all-even-numbers-from-1-to-n-using-while-loop/
Lets write a C program to find sum of all the even numbers from 1 to N, using while loop.
Even Number: An even number is an integer that is exactly divisible by 2.
For Example: 8 % 2 == 0. When we divide 8 by 2, it give a reminder of 0. So number 8 is an even number.
If user enters num = 5. Even numbers between 1 to 5 are 2, 4. So we add 2 and 4. 2 + 4 = 6. We display 6 to the console window as result.
C Programming Interview / Viva Q&A List
http://technotip.com/6378/c-programming-interview-viva-qa-list/
C Programming: Beginner To Advance To Expert
http://technotip.com/6086/c-programming-beginner-to-advance-to-expert/
...
https://www.youtube.com/watch?v=EZeusHqc0Rc
http://technotip.com/5074/ion-spinner-component-ionic-2/
Today lets see how we can use ion-spinner components and the animated SVG(Scalable Vector Graphics) it provides.
Using spinner components we can indicate the user that the data is being loaded in the background. This increases the usability and accessibility of the application and enhances the user experience.
'Ionic 2' Free Video Tutorial List
http://technotip.com/5036/ionic-2-video-tutorial-list/
...
https://www.youtube.com/watch?v=rCwCsEcI3EU
https://technotip.com/8902/c-program-to-count-number-of-positive-negative-and-zeros-in-an-array/
Lets write a C program to count number of positive, negative and zeros in an Array.
LOGIC
If input number is greater than 0, then its positive number. If input number is less than 0, then its negative. If its neither greater than 0, nor less than 0, then the input number must be 0.
C Programming Interview / Viva Q&A List
https://technotip.com/6378/c-programming-interview-viva-qa-list/
C Programming: Beginner To Advance To Expert
https://technotip.com/6086/c-programming-beginner-to-advance-to-expert/
...
https://www.youtube.com/watch?v=Z1mES-0NM-E
https://technotip.com/8127/c-program-to-find-gcd-of-two-numbers-using-recursion-euclids-algorithm/
Lets write a C program to find GCD(Greatest Common Divisor) or HCF(Highest Common Factor) of two positive integer numbers input by the user using Euclid’s Algorithm and by using Recursive function call logic.
Expected Input/Out
Enter 2 positive integer numbers
1980
1617
GCD of 1980 and 1617 is 33.
Euclid’s Algorithm Logic
If user inputs 2 numbers n1 and n2, reduce the bigger number by modulo dividing it by the smaller number. For example, if n1 is greater than n2, then reduce the value of n1 by replacing it with n1%n2.
Assume that we’ve a function gcd() which returns gcd of 2 numbers passed to it. Ex: gcd(n1, n2);
According to Euclid’s Algorithm, we’ll get the same gcd if we reduce the bigger number by modulo dividing it by smaller number.
If n1 is greater than n2 we need to pass gcd(n1%n2, n2);
If n2 is greater than n1, we need to pass gcd(n1, n2%n1);
We need to recursively execute above 2 lines of logic until either n1 is 0 or until n2 is 0. If n1 is 0, then value present in n2 is the gcd of (n1,n2). If n2 is 0, then value present in n1 is the gcd of (n1,n2).
C Programming Interview / Viva Q&A List
https://technotip.com/6378/c-programming-interview-viva-qa-list/
C Programming: Beginner To Advance To Expert
https://technotip.com/6086/c-programming-beginner-to-advance-to-expert/
...
https://www.youtube.com/watch?v=k6zrTKpSg20
http://technotip.com/1217/biggest-of-two-numbers-using-ternary-operator-cpp/
Find biggest of Two integer numbers: using if-else control statements and tternary operator. In Cpp
...
https://www.youtube.com/watch?v=ni2btFMBmlA
http://technotip.com/3411/compositing-methods-in-canvas-html5/
There are 12 different compositing methods in Canvas. By default, source-over is applied for all the drawing operations on canvas.
In this video tutorial, we draw 2 rectangle and show the effects of applying different compositing methods on them.
HTML5 and CSS3 Video Tutorial List:
http://technotip.com/3451/html5-css3-video-tutorial-list/
...
https://www.youtube.com/watch?v=b9FC6i8FVRg
http://technotip.com/4180/index-key-mongodb/
Lets look at some basics of indexes in MongoDB. we need to use the keys / index from left to right.
MongoDB Video Tutorial List:
http://technotip.com/3778/mongodb-tutorial-list/
...
https://www.youtube.com/watch?v=NiP-zX-jPaY