BeautifulWork Project
http://www.beautifulwork.org
LEARNING PROCESSTue, 16 Sep 2014 15:29:45 +0000en-UShourly1http://wordpress.org/?v=3.6.1How to write a program to swap values ?
http://www.beautifulwork.org/2014/09/16/how-to-write-a-program-to-swap-values/?utm_source=rss&utm_medium=rss&utm_campaign=how-to-write-a-program-to-swap-values
http://www.beautifulwork.org/2014/09/16/how-to-write-a-program-to-swap-values/#commentsTue, 16 Sep 2014 15:29:45 +0000adminhttp://www.beautifulwork.org/?p=15954
/* part of work copied from http://www.sanfoundry.com/c-program-swap-values/ */
#include <stdio.h>
swap_values()
{
int temp;
int *ptr1, *ptr2;
int a, b;
printf("Enter integer values to be swapped: ");
scanf("%d %d",&a,&b);
ptr1 = &a;
ptr2 = &b;
temp = *ptr1;
*ptr1 = *ptr2;
*ptr2 = temp;
printf("Swapped values are: %d %d \n",a,b);
}
/* http://www.programmingsimplified.com/c-program-swap-two-numbers */
/* http://betterexplained.com/articles/swap-two-variables-using-xor/ */
/* http://www.science.unitn.it/~fiorella/guidelinux/tlk/node27.html */
]]>http://www.beautifulwork.org/2014/09/16/how-to-write-a-program-to-swap-values/feed/0Hacking with integer divisibility
http://www.beautifulwork.org/2014/09/16/hacking-with-integer-divisibility/?utm_source=rss&utm_medium=rss&utm_campaign=hacking-with-integer-divisibility
http://www.beautifulwork.org/2014/09/16/hacking-with-integer-divisibility/#commentsTue, 16 Sep 2014 13:36:12 +0000adminhttp://www.beautifulwork.org/?p=15948
/* work copied from http://www.sanfoundry.com/c-program-number-divisible-by-5/ */
#include <stdio.h>
numberdivi()
{
int i, num1, num2, count = 0, sum = 0;
printf("Enter the value of num1 and num2 : ");
scanf("%d %d",&num1,&num2);
for (i = num1; i < num2 ; i++)
{
if ((i % 5) == 0)
{
printf("%3d,",i);
count++;
sum = sum + i;
}
}
printf("\n Number of integers divisible by 5 between %d and %d = %d \n",num1,num2,count);
printf("The sum of all integers that are divisible by 5 = %d\n",sum);
}
/* http://en.wikipedia.org/wiki/Divisibility_rule */
/* http://stackoverflow.com/questions/18473730/algorithm-in-hardware-to-find-out-if-number-is-divisible-by-five */
]]>http://www.beautifulwork.org/2014/09/16/hacking-with-integer-divisibility/feed/0Hacking with a binary using file and strip commands
http://www.beautifulwork.org/2014/09/10/hacking-with-a-binary-using-file-and-strip-commands/?utm_source=rss&utm_medium=rss&utm_campaign=hacking-with-a-binary-using-file-and-strip-commands
http://www.beautifulwork.org/2014/09/10/hacking-with-a-binary-using-file-and-strip-commands/#commentsWed, 10 Sep 2014 19:49:24 +0000adminhttp://www.beautifulwork.org/?p=15946
$file simple | awk '{ print $(NF-1) $(NF-0) }'
notstripped
$du -h simple
8.0K simple
$./simple
Hello World
$strip ./simple
$du -h simple
8.0K simple
$./simple
Hello World
$file simple | awk '{ print $(NF-1) $(NF-0) }'
BuildID[sha1]=6cf0bed752a904372cd42a85bc560c266a7c91b3,stripped
$
]]>http://www.beautifulwork.org/2014/09/10/hacking-with-a-binary-using-file-and-strip-commands/feed/0Hacking with debian netselect-apt command
http://www.beautifulwork.org/2014/08/31/hacking-with-debian-netselect-apt-command/?utm_source=rss&utm_medium=rss&utm_campaign=hacking-with-debian-netselect-apt-command
http://www.beautifulwork.org/2014/08/31/hacking-with-debian-netselect-apt-command/#commentsSun, 31 Aug 2014 17:26:00 +0000adminhttp://www.beautifulwork.org/?p=15929] 3,50,858 110KB/s in 3.1s 2014-08-31 23:00:11 (110 KB/s) - ‘/tmp/netselect-apt.Pjgwxz’ saved […]]]>
$sudo netselect-apt -t 2 -c IN
Using distribution stable.
Retrieving the list of mirrors from www.debian.org...
--2014-08-31 23:00:07-- http://www.debian.org/mirror/mirrors_full
Resolving www.debian.org (www.debian.org)... 140.211.15.34, 128.31.0.51
Connecting to www.debian.org (www.debian.org)|140.211.15.34|:80... connected.
HTTP request sent, awaiting response... 200 OK
Length: 350858 (343K) [text/html]
Saving to: ‘/tmp/netselect-apt.Pjgwxz’
100%[====================================================================================>] 3,50,858 110KB/s in 3.1s
2014-08-31 23:00:11 (110 KB/s) - ‘/tmp/netselect-apt.Pjgwxz’ saved [350858/350858]
Choosing a main Debian mirror using netselect.
(will filter only for mirrors in country IN)
Running netselect to choose 2 out of 4 addresses.
...........
Only found 1 hosts out of 2 requested.
The fastest 2 servers seem to be:
http://debian.mirror.net.in/debian/
Of the hosts tested we choose the fastest valid for HTTP:
http://debian.mirror.net.in/debian/
Writing sources.list.
sources.list exists, moving to sources.list.1409506243
Done.
$
]]>http://www.beautifulwork.org/2014/08/31/hacking-with-debian-netselect-apt-command/feed/0How to write an algorithm to find factorial of a given number ?
http://www.beautifulwork.org/2014/08/21/how-to-write-an-algorithm-to-find-factorial-of-a-number/?utm_source=rss&utm_medium=rss&utm_campaign=how-to-write-an-algorithm-to-find-factorial-of-a-number
http://www.beautifulwork.org/2014/08/21/how-to-write-an-algorithm-to-find-factorial-of-a-number/#commentsThu, 21 Aug 2014 20:52:36 +0000adminhttp://www.beautifulwork.org/?p=15925
#include <stdio.h>
factorial()
{
int p = 1;
int i = 1;
int n;
printf("Enter a Number greater than 0 \n");
scanf("%d",&n);
while ( i <= n)
{
p = p * i;
i = i + 1;
}
printf("Factorial of the input is %d \n",p);
}
]]>http://www.beautifulwork.org/2014/08/21/how-to-write-an-algorithm-to-find-factorial-of-a-number/feed/0Hacking with an algorithm to find prime factor of a number
http://www.beautifulwork.org/2014/08/19/hacking-with-an-algorithm-to-find-prime-factor-of-a-number/?utm_source=rss&utm_medium=rss&utm_campaign=hacking-with-an-algorithm-to-find-prime-factor-of-a-number
http://www.beautifulwork.org/2014/08/19/hacking-with-an-algorithm-to-find-prime-factor-of-a-number/#commentsTue, 19 Aug 2014 19:09:49 +0000adminhttp://www.beautifulwork.org/?p=15923
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
Finding if a number is an Armstrong number or not[8]
Finding if a given number is prime number[9]
Finding the number of twin prime numbers[10]
Finding if a number is palindrome or not[11]
Finding prime factor of a number[12]
12
Enter a number: 36
2 is a prime factor
3 is a prime factor
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
Finding if a number is an Armstrong number or not[8]
Finding if a given number is prime number[9]
Finding the number of twin prime numbers[10]
Finding if a number is palindrome or not[11]
Finding prime factor of a number[12]
12
Enter a number: 76
2 is a prime factor
19 is a prime factor
$bc
bc 1.06.95
Copyright 1991-1994, 1997, 1998, 2000, 2004, 2006 Free Software Foundation, Inc.
This is free software with ABSOLUTELY NO WARRANTY.
For details type `warranty'.
76/19
4
]]>http://www.beautifulwork.org/2014/08/19/hacking-with-an-algorithm-to-find-prime-factor-of-a-number/feed/0How to write an algorithm to find if a number is palindrome or not
http://www.beautifulwork.org/2014/08/19/how-to-write-a-algorithm-to-find-if-a-number-is-palindrome-or-not/?utm_source=rss&utm_medium=rss&utm_campaign=how-to-write-a-algorithm-to-find-if-a-number-is-palindrome-or-not
http://www.beautifulwork.org/2014/08/19/how-to-write-a-algorithm-to-find-if-a-number-is-palindrome-or-not/#commentsTue, 19 Aug 2014 17:37:50 +0000adminhttp://www.beautifulwork.org/?p=15920
#include <stdio.h>
palindrome()
{
int n, reverse = 0, temp;
printf("Enter a number to check if it is a palindrome or not: ");
scanf("%d",&n);
temp = n;
while ( temp != 0 )
{
reverse = reverse * 10;
reverse = reverse + temp % 10;
temp = temp/10;
}
if ( n == reverse )
printf("%d is a palindrome number \n",n);
else
printf("%d is not a palindrome number \n",n);
}
]]>http://www.beautifulwork.org/2014/08/19/how-to-write-a-algorithm-to-find-if-a-number-is-palindrome-or-not/feed/0Tinkering with an Armstrong number finding program function
http://www.beautifulwork.org/2014/08/12/tinkering-with-an-armstrong-number-finding-program-function/?utm_source=rss&utm_medium=rss&utm_campaign=tinkering-with-an-armstrong-number-finding-program-function
http://www.beautifulwork.org/2014/08/12/tinkering-with-an-armstrong-number-finding-program-function/#commentsTue, 12 Aug 2014 14:42:34 +0000adminhttp://www.beautifulwork.org/?p=15917
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
Finding if a number is an Armstrong number or not[8]
8
Enter a positive integer: 153
153 is an Armstrong number
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
Finding if a number is an Armstrong number or not[8]
8
Enter a positive integer: 154
154 is not an Armstrong number
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
Finding if a number is an Armstrong number or not[8]
8
Enter a positive integer: 1
1 is an Armstrong number
$
]]>http://www.beautifulwork.org/2014/08/12/tinkering-with-an-armstrong-number-finding-program-function/feed/0Hacking with the program to find the greatest common factor
http://www.beautifulwork.org/2014/08/07/hacking-with-the-program-to-find-the-greatest-common-factor/?utm_source=rss&utm_medium=rss&utm_campaign=hacking-with-the-program-to-find-the-greatest-common-factor
http://www.beautifulwork.org/2014/08/07/hacking-with-the-program-to-find-the-greatest-common-factor/#commentsThu, 07 Aug 2014 15:57:54 +0000adminhttp://www.beautifulwork.org/?p=15915
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
7
Enter the two values for finding GCD: 12 6
GCD is: 6
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
7
Enter the two values for finding GCD: 5 12
GCD is: 1
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
7
Enter the two values for finding GCD: 20 25
GCD is: 5
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
7
Enter the two values for finding GCD: 12 8
GCD is: 4
$./app
Sign detection [1]
Power of two [2]
Counting No. of bits set [3]
Set or clear bits without branching[4]
Find maximum value[5]
Finding least common multiple[6]
Finding the greatest commom divisor[7]
7
Enter the two values for finding GCD: 32 235
GCD is: 1
$
]]>http://www.beautifulwork.org/2014/08/07/hacking-with-the-program-to-find-the-greatest-common-factor/feed/0How to write an algorithm to find the number of bits set in a typical number ?
http://www.beautifulwork.org/2014/07/30/how-to-write-an-algorithm-to-find-the-number-of-bits-set-in-a-typical-number/?utm_source=rss&utm_medium=rss&utm_campaign=how-to-write-an-algorithm-to-find-the-number-of-bits-set-in-a-typical-number
http://www.beautifulwork.org/2014/07/30/how-to-write-an-algorithm-to-find-the-number-of-bits-set-in-a-typical-number/#commentsWed, 30 Jul 2014 15:39:30 +0000adminhttp://www.beautifulwork.org/?p=15912
#include <stdio.h>
cbs ()
{
unsigned int v; /* count the number of bits set in v */
unsigned int c; /* c accumulates the total bits set in v */
printf("Enter v");
scanf("%u",&v);
for (c = 0; v ; c++)
{
v = v & (v - 1); /* clear the least significant bit set */
}
printf("The number of bits set in v is %u \n",c);
}
]]>http://www.beautifulwork.org/2014/07/30/how-to-write-an-algorithm-to-find-the-number-of-bits-set-in-a-typical-number/feed/0