Ankit Goyal

Google's Android tops as others including BlackBerry and Nokia sink

noreply@blogger.com (Ankit Goyal) — Thu, 02 Jun 2011 15:56:00 +0000

Google's Android devices have become most popular smart phones in the US, said a Nielsen survey Tuesday, a day when Nokia shares tanked more than 15 percent on weaker quarterly outlook.

The April survey of 65,000 users showed that 36 percent mobile consumers now use an Android device, compared to 26 percent who use Apple iPhones and 23 percent who use Blackberry.

If current mobile data usage is also any indicator, Google Android smart phones are set to leave Apple iPhones way behind. Android smartphone owners use an average of 582 MB of data each month, compared to 492 MB for iPhone owners, said the survey. Google's Android operating system (OS) is also proving to be the most popular, according to the survey.

The Neilsen survey came yet another bad news for BlackBerry maker Research In Motion (RIM) which was dragged down more than four percent as Nokia shares tanked more than 15 percent in New York after the global handset leader warned of lower sales in the second quarter.

Jittery investors also abandoned RIM stock which closed at $41.35 - the lowest levels not seen since 2006 - on the Toronto Stock Exchange.

While RIM has lost more than 60 percent of its value since 2008, Nokia's value has shrunk 43 percent since the last year. At $7.02 Tuesday, Nokia stock is at its 13-year low.

'Nokia's warning this morning is probably just the prelude to another RIM warning that investors have learned to get used to,'' analyst Jon Ogg told the Globe and Mail.
He said merger was the only solution for RIM and Nokia.

'We do not like mergers but this may be the only shot for these companies to stop the bleeding. Admittedly, this is a long-shot deal. A RIM-Nokia merger might encounter too many problems before getting off the ground. Still, what choices to these two companies have today?' the analysts said.
RIM, whose current stock is a pale shadow of $150 seen in June 2008, is currently valued at about $23 billion.

The presence of Microsoft CEO Steve Ballmer at RIM's BlackBerry World annual conference of customers, developers and partners in Florida last month fuelled speculation that the cash-rich software giant could soon buy the BlackBerry company to make a mark in the smart phone market. Microsoft, which is sitting on a $48-billion cash pile, has already partnered RIM to adopt its Bing as the default search engine on BlackBerry smart phones.

Nokia facing software problems!!!

noreply@blogger.com (Ankit Goyal) — Tue, 12 Apr 2011 13:15:00 +0000

A critical issue has been noticed recently with Nokia handsets including its latest N8. The problem leads to text message delivery failure and software slow down. This is not only the case that Nokia is facing with its current market share dropped to 30% its getting difficult for Nokia to survive. I am personally a Nokia lover every cell phone that I have till date is Nokia, now it’s getting me to think over it.

The problem that N8 faces is with the text message delivery. N8 fails to deliver text message. The problem can be solved by flashing or formatting. I formatted my Nokia N8 twice still after a day or two it gets into the same problem. According to Nokia Care the problem is with the software. Nokia should get a quick remedy for this.

The problem not only persists for N8 other handsets like N79 N73 E63 are too into it. I would suggest you to quickly upgrade the software. You can do that with Nokia Software Updater online.

Google Makes April FOOL!!!

noreply@blogger.com (Ankit Goyal) — Fri, 01 Apr 2011 10:26:00 +0000

Google Motion BETA

A new way to communicate

The mouse and keyboard were invented before the Internet even existed. Since then, countless technological advancements have allowed for much more efficient human computer interaction. Why then do we continue to use outdated technology? Introducing Gmail Motion -- now you can control Gmail with your body.

Click on Try Gmail Motion

It shows loading... you wait and then...

That's right....APRIL FOOL!!!

Get FREE Live Cricket Match Scores

noreply@blogger.com (Ankit Goyal) — Tue, 29 Mar 2011 15:59:00 +0000

Get FREE!!! Live cricket match scores in mobile phone.

No premium charges!

No dataplan!

No internet!

Just nominal rate for messages charged by your mobile service provider.

How it works:

1. SMS: @cricbuzz to 92433-42000

2. Receive live cricket scores

Code in 26 Different Languages

noreply@blogger.com (Ankit Goyal) — Tue, 29 Mar 2011 08:16:00 +0000

Coding in 26 Different languages!!!

C++

[code]
#include <iostream>

int main(void) {
char c, d=10;
while(std::cin.get(c) && (c!='2' || d!='4') && std::cout.put(d))
d=c;
}
[/code]

C

[code]

#include <stdio.h>

int main(void) {
int x;
for(; scanf("%d",&x) > 0 && x != 42; printf("%d\n", x));
return 0;
}
[/code]

Pascal

[code]

program test;
var x: integer;
begin
repeat
readln(x);
if x<>42 then writeln(x);
until x=42
end.
[/code]

Java

[code]

public class Main
{
public static void main (String[] args) throws java.lang.Exception
{
java.io.BufferedReader r = new java.io.BufferedReader (new java.io.InputStreamReader (System.in));
String s;
while (!(s=r.readLine()).startsWith("42")) System.out.println(s);
}
}
[/code]

Nice

[code]

void main (String[] args)
{
java.io.BufferedReader r = new java.io.BufferedReader (new java.io.InputStreamReader (System.in));
String s;
while (!(s=notNull(r.readLine())).startsWith("42")) System.out.println(s);
}
[/code]

Python

[code]

k=raw_input()
while int(k)!=42:
print k
k=raw_input()
[/code]

Lisp

[code]

(loop for l = (read-line)
for n = (parse-integer l)
until (= n 42) do (format t "~D~%" n))
[/code]

Scheme

[code]

(do ((i (read) (read)))
((eq? i 42) '())
(begin
(display i)
(newline)))
[/code]

OCaml

[code]

while true do
let n = read_int () in
if n=42 then exit 0 else print_int n; print_newline ()
done
[/code]

Haskell

[code]

main = interact f
where f = unlines . takeWhile (/="42") . words
[/code]

Clips

[code]

(defrule readin
?f<-(initial-fact)
=>
(retract ?f)
(assert (number (read)))
)

(defrule writeout
?f<-(number ?n)(test (<> ?n 42))
=>
(retract ?f)
(printout t ?n crlf)
(assert (initial-fact))
)
[/code]

Prolog

[code]

program :- get_char(X),get_char(Y),check(X,Y).
check('4','2'):-!.
check(X,Y):-write(X),get_char(Z),check(Y,Z).
[/code]

C#

[code]

using System;
public class Test
{
public static void Main()
{
int n;
while ((n = int.Parse(Console.ReadLine()))!=42)
Console.WriteLine(n);
}
}
[/code]

Brainf*ck

[code]

+[>>----------
[++++++++++<,----------]
>--------------------------------------------------
>----------------------------------------------------
>

[
<+++++++++++++++++++++++++++++++++++++++++++++++ ++ +++
<+++++++++++++++++++++++++++++++++++++++++++++++ ++ +
[>]<
[.<]++++++++++.---------->
[>]>>
]<

[++++++++++++++++++++++++++++++++++++++++++++++++++ ++
<+++++++++++++++++++++++++++++++++++++++++++++++ ++ +
[>]<
[.<]++++++++++.---------->
[>]>
]<

[>+++++++++++++++++++++++++++++++++++++++++++++++ ++ +++
<+++++++++++++++++++++++++++++++++++++++++++++++ ++ +
[>]<
[.<]++++++++++.---------->
[>]
]<

]

[/code]

Perl

[code]
print while($_=<>)!=42
[/code]

Ruby

[code]

print while gets != "42\n"
[/code]

Pike

[code]

int main() {
while (sscanf(Stdio.stdin->gets(), "%d", int n), n!=42 && write(n+"\n"));
return 0;
}
[/code]

PHP

[code]

<?php
while (true) {
$input = fgets(STDIN, 3);
if ($input == 42) {
break;
} else {
echo $input;
}
}
?>
[/code]

Intercal

[code]

PLEASE DO ,1 <- #1
PLEASE DO .4 <- #0
PLEASE DO .5 <- #0
PLEASE DO .99 <- #0
DO COME FROM (30)
DO COME FROM (31)
DO WRITE IN ,1
DO .1 <- ,1SUB#1
DO .2 <- .4
DO (1000) NEXT
DO .4 <- .3~#255
DO (10) NEXT
(42) DO .1 <- .1
(20) DO .42 <- "&'&.4~#26'$#1"
PLEASE RESUME "?.42$#1"~#3
(10) DO (20) NEXT
DO FORGET #1
PLEASE COME FROM (42)
PLEASE STASH .1+.2+.3
DO .1 <- .4
DO .2 <- #50
DO (1010) NEXT
DO (100) NEXT
PLEASE STASH .1+.2+.3
DO .1 <- .99
DO .2 <- #52
DO (1010) NEXT
DO (101) NEXT
PLEASE GIVE UP
(201) DO .3 <- '.3~.3'~#1
PLEASE RESUME "?.3$#2"~#3
(101) DO (201) NEXT
DO FORGET #1
(32) PLEASE RETRIEVE .1+.2+.3
(200) DO .3 <- '.3~.3'~#1
PLEASE RESUME "?.3$#2"~#3
(100) DO (200) NEXT
DO FORGET #1
DO COME FROM (32)
PLEASE RETRIEVE .1+.2+.3
DO (102) NEXT
(31) DO .99 <- .4
(202) DO .98 <- '.99~.99'~#1
PLEASE RESUME "?.98$#2"~#3
(102) DO (202) NEXT
DO FORGET #1
DO .3 <- !99~#15'$!99~#240'
DO .3 <- !3~#15'$!3~#240'
DO .2 <- !3~#15'$!3~#240'
DO .1 <- .5
DO (1010) NEXT
DO .5 <- .2
DO ,1SUB#1 <- .3
PLEASE READ OUT ,1
(30) DO .99 <- .4
[/code]

NASM

[code]

global _start
section .data
buffer dw 0h
section .text
_start:
mov ecx, buffer
mov edx, 02h
call read
mov cx, word [buffer]
cmp cx, 3234h
je exit
cmp ch, 0ah
je one_dig
jmp two_dig
one_dig:
mov ecx, buffer
mov edx, 02h
call write
jmp _start
two_dig:
mov ecx, buffer
mov edx, 02h
call write
mov edx, 01h
mov ecx, buffer
call read ; read the 0ah
mov ecx, buffer
call write ; write the 0ah
jmp _start
exit:
mov eax, 01h ; exit()
xor ebx, ebx ; errno
int 80h
read:
mov eax, 03h ; read()
mov ebx, 00h ; stdin
int 80h
ret
write:
mov eax, 04h ; write()
mov ebx, 01h ; stdout
int 80h
ret
[/code]

Ada95

[code]

with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;

procedure test is
x : integer;
begin
loop
get(x);
if x/=42
then
put(x);
new_line(1);
else
exit;
end if;
end loop;
end test;
[/code]

Bash

[code]

while read a; do
if [ $a -eq 42 ]; then
exit
else
echo $a
fi
done
[/code]

Smalltalk

[code]
|c number|
[
number:=0.
[ (c := stdin next) asciiValue ~= 10 ]
whileTrue:
[number := (number * 10) + (c asciiValue) - 48.].
number ~= 42
]
whileTrue:
[Transcript show: number printString; cr.]
!
[/code]

Fortran

[code]

program TEST
integer ans
do
read (*,*) ans
if (ans.eq.42) stop
write (*,*) ans
enddo
stop
end
[/code]

Icon

[code]

procedure main ()
while (l := read()) ~= 42 do
write(l);
end
[/code]

Erlang

[code]
-module(tested).
-export([main/0]).

main() ->
loop().
loop() ->
case io:fread( "","~d" ) of
eof ->
true;
{ok, X} ->
[Y] = X,
if
Y == 42 ->
true;
true ->
io:fwrite( "~B\n",X ),
loop()
end
end.
[/code]

Download Source Code

noreply@blogger.com (Ankit Goyal) — Thu, 24 Mar 2011 18:35:00 +0000

Download source codes and projects in different language which includes C, C++, Socket Programming in C Linux, PHP, Java, J2EE, ALP 8086, Programming Contest and many more.

C
C programs written in TurboC and Linux. Includes programs from OS Scheduling and Compiler design

C++
C++ programs include Linklist, Operator overloading and templates

ALP 8086
Assembly Language Program in 8086 covers basic directory/file operations and others

Socket Programming in Linux using C
Socket Programming includes program in the Server Client architecture using UDP and TCP connection

Java
Java programs include basic exception handling concept, threads and JDBC

J2EE
J2EE programs include MVC architecture, Ajax, Cookies, Hibernate, EJB, JavaBeans and Struts

PHP
PHP programs include basic web application using MySql database

Programming Contest
Programming Contest covers various programs along with question, which are part of some programming contest or the other

Brainfuck Programming language.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 20:13:00 +0000

The brainfuck programming language is an esoteric programming language noted for its extreme minimalism. It is a Turing tarpit, designed to challenge and amuse programmers, and is not suitable for practical use. Its name has been variously bowdlerized, sometimes appearing as brainf***, brainf*ck, brainfsck, b****fuck or BF. The name of the language is generally not capitalized except at the start of a sentence, although it is a proper noun.

Brainfuck is created by Urban Muller, whose goal was apparently to create a Turing-complete language for which he could write the smallest compiler ever, for the Amiga OS 2.0. His compiler was 240 bytes in size.

A Brainfuck program has an implicit byte pointer, called "the pointer", which is free to move around within an array of 30000 bytes, initially all set to zero. The pointer itself is initialized to point to the beginning of this array. The Brainfuck programming language consists of eight commands, each of which is represented as a single character.

>   Increment the pointer.
<   Decrement the pointer.
+   Increment the byte at the pointer.
-    Decrement the byte at the pointer.
.    Output the byte at the pointer.
,    Input a byte and store it in the byte at the pointer.
[    Jump forward past the matching ] if the byte at the pointer is zero.
]    Jump backward to the matching [ unless the byte at the pointer is zero.

The semantics of the Brainfuck commands can also be succinctly expressed in terms of C, as follows (assuming that p has been previously defined as a char*):

>   becomes ++p;
<   becomes --p;
+   becomes ++*p;
-    becomes --*p;
.    becomes putchar(*p);
,    becomes *p = getchar();
[    becomes while (*p) {
]    becomes }

The following program prints "Hello World!" and a newline to the screen:

+++++ +++++ initialize counter (cell #0) to 10
[       use loop to set the next four cells to 70/100/30/10
> +++++ ++      add 7 to cell #1
> +++++ +++++     add 10 to cell #2
> +++   add 3 to cell #3
> +   add 1 to cell #4
<<<< -   decrement counter (cell #0)
]

> ++ . print 'H'
> + . print 'e'
+++++ ++ . print 'l'
. print 'l'
+++ . print 'o'
> ++ . print ' '
<< +++++ +++++ +++++ . print 'W'
> . print 'o'
+++ . print 'r'
----- - . print 'l'
----- --- . print 'd'
> + . print '!'
> . print '\n'

For readability, this code has been spread across many lines and blanks and comments have been added. Brainfuck ignores all characters except the eight commands +-<>[],. so no special syntax for comments is needed (as long as the comments don't contain the command characters).

The code could just as well have been written as:

++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>.

Extend your laptop display to a monitor.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 20:06:00 +0000

If you use your laptop as your main computer and if you have a spare monitor, then you can put your monitor to good use by making it your Laptop’s secondary monitor. It doesn’t really matter if the second monitor is a CRT or TFT, both work fine. First, let’s see why you would want to add a secondary monitor to your laptop.

Now lets see how to set up the secondary monitor. Make sure that both yourLaptop and the monitor are switched off. Connect the monitor to your Laptop by connecting it to the VGA or DVI connector, typically found on the rear of your laptop computer. Now switch on your laptop and the monitor. You will notice that initially, only one of the two monitors is activated. You can usually switch between the monitors by pressing the hotkeys in yourlaptop. Normally, it is a combination of the Fn key with another key with an image of a monitor on it (normally found on one of the function keys).

To bring on the display on both the monitors you’ll need to adjust your display settings by following these steps:

1. Right-Click on an empty area on your desktop. On the context menu that pops-up click on Properties and on the resulting ‘Display Properties‘ window, go to the Settings tab.

2. Click the monitor icon labeled 2, and then select the Extend my Windows desktop onto this monitor checkbox.
3. If necessary, drag the monitor icons so that they are arranged in the same way as the monitors on your desk. Clicking on the Identify button will help you know which monitor is 1 and which monitor is 2.

4. If need be, change the resolution of your secondary monitor to the most appropriate settings. You can change the resolution of the monitors independently.
5. Click Apply. Windows XP will activate your new monitor.
6. Finaly, click OK.

Once your monitor is set up, you can use your mouse to grab the title bar of a window and drag it to your new display. Make sure that the window you are trying to drag is not maximised, in which case you will not be able to drag it. To be able to drag it, first double-click on the title bar and then drag it. It may take you a while to get used to working on dual monitors, but once you do, it will forever change the way you work with your computer. Be creative and experiment with the sizing of application windows and what information you can keep in constant view while doing multiple tasks.

Protect your files

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:58:00 +0000

Do you keep secrets?? Well, most of us do and for that they require a software that would protect the files, folders and drives. Most software’s encrypt the file for protecting it which creates problem as it requires a lot of time to encryption and decryption.
My search was still on when I came across FOLDER LOCK XP, which has the following features:

• Ability to hide files, folders, or drives from all other users (including the administrator).
• Password protection for files, folders, and drives.
• Unlimited number of objects to protect.
• Access restrictions on your data against local network users as well as Internet users.
• Ability to lock your Windows desktop so that users cannot delete, add, or modify the shortcuts and icons on your desktop.
• Password-protected start of Lock Folder XP.
• Ability to managing program from tray.
• Windows Explorer commands for instant folder hiding.
• Automatic protection activation after a set idle time.
• High-level protection.
• High performance rates.
• Multilingual interface.
• Support of FAT, FAT32, and NTFS systems.

Lock Folder XP does not change the file structure of the data, does not move the protected data, and does not change Windows system files. You cannot lose your files.

Download Folder Lock from the download section, search Folder Lock

Quine: Program that prints itself.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:52:00 +0000

A quine is a program which prints its own code. This means that when the program is run, it must print out precisely those instructions which the programmer wrote as part of the program.

The idea behind the code is simple, taking language C, we will initialize a char array with the code itself as per the code format. This array will be the format for the printf statement, as we know its syntax is;

int printf (const char *format [, argument, ...]);

The printf statement prints until it encounters a control string which is replaced by the value specified in the argument. printf(quine,10,10,34,quine,34,10,10,10,10,9,10,9,10);

Here the format is the array quine, 10,10,34,quine,34,10,10,10,10,9,10,9,10 are all arguments which are suitably replaced with new line(ASCII 10),double quotes (ASCII 34), the array quine itself and tab (ASCII 9).

Quine can be implemented in any language, the basic technique remains the same. Some may find this easier to do with a file but as far as Quine is considered, no file operations are used.

Sample Code in C:

#include <stdio.h>
char*quine="#include%c%cchar*quine=%c%s%c;%c%cint
main()%c{%c%cprintf(quine,10,10,34,quine,34,10,10,10,10,9,10,9,10);%c%creturn 0;%c}";

int main()
{
printf(quine,10,10,34,quine,34,10,10,10,10,9,10,9,10);
return 0;
}

Output:

Code 9: Technique to check whether a number is palindrome.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:48:00 +0000

Problem Description:

A palindromic number or numeral palindrome is a 'symmetrical' number like 16461, that remains the same when its digits are reversed. Now we need to check whether a number given by the user is a palindrome.Let us take the input number to be checked in a variable n. Next we copy n to another variable m as m=n. Now we extract the last digit of n and save it in a variable r and by using the mathematical relation for formation of a number s=s*r+10, we from a new number which is ultimately just the reverse of the given number n. After the formation of the number,we check whether the actual number m is equal to the reversed number s. If so,the number is a palindrome else not.

Code 8: Technique to generate the Fibonacci series.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:45:00 +0000

Problem Description:

In mathematics, the Fibonacci numbers are the following sequence of numbers: 0,1,1,2,3,5,8,13,21,34,55,89,... By definition, the first two Fibonacci numbers are 0 and 1, and each remaining number is the sum of the previous two. Some sources omit the initial 0, instead beginning the sequence with two 1s.But here we will be considering the series starting with 0.Now to start with the problem we first initialize two variable a=1 and b=0. Now we need to know as how many terms we need in the series and take that as input in a variable (say n).Next we print b having the value 0 as the start of the series.Now using for loop we generate the series by adding a and b; storing this sum in another variable c and then exchanging a with b and b with c ; and then repeating this loop till n-1 (as 0 is already included,we now need to generate only n-1 terms).Printing c every time within the loop generates the desired fibonacci series.

Code 7: Technique to form a new number using only odd digits of the number.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:43:00 +0000

Problem Description:

We have to form a new number using only the odd digits present in the number.

For example input number = 12345 New formed number = 135. This requires the Digit Formation Technique s=s+r*10^c (10^c is 10 to the power of c) where 's' is the new formed number(initially 0)'r' the extracted digit 'c' a counter starting from 0. We need to extract individual digits and then use the digit formation technique to form the new number. We could also use Reversing Technique to form a number rather than Digit Formation Technique the difference lies in the fact that by using reversing technique the number is reversed that is not is case of digit formation technique, it form a number in the same order.

Code 6: Technique to reverse a number.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:41:00 +0000

Problem Description:

Reversing of a number can be done by using the Reversing Technique s=s*10+r where 's' is the reversed number(initially 0)and r the extracted digit. Here we need to first extract the digits using digit extraction technique and then use the reversing technique to reverse it.

Code 5: Technique to find the sum of all digits in a number.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:39:00 +0000

Problem Description:
We need to extract all the digits one by one from the number and add them up. By using the digit extraction technique we know that we will be able to get the digits one by one. As soon as we get the required digit we will just add them up using the summation technique sum=sum+r (as in here r contains the required digit)As we see here using two simple techniques learned earlier the problem becomes simpler to understand and code.

Code 4: Technique to count the number of digits in a number.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:37:00 +0000

Problem Description:

We are given a number(integer)as input we have to count the number of digits in that number. For example if the number is 123456 the number of digits is 6. Here we need to apply the technique called Digit Extraction. By which we will extract individual digits and then count them using a counter. In digit extraction the technique is pure mathematical, we will find the remainder on dividing the number by 10 without modifying the original number. Now as we know on dividing by 10 the remainder is always that in the ones place of the number. Example 123456%10 is 6. This way we will be able to get all the digits in a number in reverse order. Next we will divide the number by 10 and replace it with its quotient, as we know integers don't except decimal part, the last digit will be truncated. Example 123456/10, decimal result=12345.6 integer result=12345. Thus we would repeat the following until we transform the number to 0 as when the last digit is extracted the number left on dividing it with 10 will be 0. Example 1/10 integer result=0. Now for apply digit extraction we will require conditional looping as we have to continue until the number is not equal to 0. In C/C++ we will take the help of Do-While loop.

Code 3: Technique to input a string and print only vowels.

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:35:00 +0000

Problem Description:
In this code we need to input a string. A string in C/C++ is a combination of characters. After we have stored the input string in a character array we need to compare each and every individual alphabet with the vowels present. Now we have to traverse through all character in a string whose range starts from 0 to length of s - 1. Similarly we will use a for loop Suppose are input string is in an array s[ ] now to get the individual alphabets we would use s[0] - 1st Character, s[1] - 2nd Character and so on. Here s[0],s[1], ...behave as characters and not as string.

Code 2: Technique to add the first ten odd numbers

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:32:00 +0000

Problem Description:

First 10 odd numbers include 1,3,5,7,...,19. Similar to Code 1 we have to add them all. Here we need a technique by which we can generate these numbers one at a time so that we can add each one of them. As learned earlier the Summation technique for adding them is using the code sum=sum+i where i should range from 1 to 19 generating only odd numbers one at a time. The technique that we will use to generate odd numbers is by dividing each number by 2, if divisible then its even producing reminder as 0, else its odd where reminder is not equal to 0. Now for apply this technique will can use the mod operator which gives us the remainder. Further we know that our range is limited from 1 to 19 in which we only need to search for odd numbers and then add them.

Code 1: Technique to add first ten natural numbers

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 19:24:00 +0000

Problem Description:
First 10 natural numbers include 1,2,3,....,10. We have to add them all. Here we need a technique by which we can get all the natural numbers. one at a time so that we can add each one of them. This can be done by using for loop are while in C or C++. As far as other languages are concerned you need to find a suitable syntax for applying the above technique. Next we need to think about adding them. Now to add them we require simple math, sum=sum+i, called Summation technique, where initially sum=0 (as it may contain garbage value which may add up giving incorrect result)

Now each time you have to change the value of i in such a way that you get the values starting from 1 and incrementing up to 10.

For more visit www.TechnoCode.co.in

Steganography Overview

noreply@blogger.com (Ankit Goyal) — Wed, 16 Mar 2011 11:19:00 +0000

Steganography is the art of covered, or hidden, writing. The purpose of steganography is covert communication to hide a message from a third party. This differs from cryptography, the art of secret writing, which is intended to make a message unreadable by a third party but does not hide the very existence of the secret communication. Although the term steganography was only coined at the very end of the fifteenth century, the use of stego dates back several millennia. Steganography hides the covert message but not the fact that two parties are communicating with each other.

The stego process generally involves placing a hidden message within some transport medium, called the carrier. The secret message is embedded within the carrier to form the stego medium. The use of a stego key may be employed for encryption of the hidden message and/or for randomization within the stego scheme. As an increasing amount of data is stored on computers and transmitted over networks, it is no surprise that steganography has entered the digital age.
On computers and networks, stego applications allow for someone to hide any type of binary file into any other binary file, although image and audio files are today's most common carriers. Steganography provides some very useful and commercially important functions in the digital world, most notably digital watermarking. In this application, an author can embed a hidden message in a file so that he/she can later assert their ownership of intellectual property and/or copyright. An artist, for example, could post some original artwork on a Web site. If someone else should "steal" the file and claims the work as their own, the artist can later prove ownership because only he/she can recover the watermark.

While conceptually similar to stego, digital watermarking usually has different technical goals; generally only a small amount of repetitive information is inserted into the carrier, it is not necessary to hide the watermarking information, and it is useful for the watermark to be able to be removed while maintaining the integrity of the carrier. Steganography has been a field of interest from ancient times and has flourished a lot in recent times due to copyright issues and transmission of secret data. Although cryptography provides a secure way of encrypting data, however the very existence of the data is known; in this case Steganography scores higher than cryptography. This does not mean that Steganography can replace cryptography; it’s just an alternative.

There are two types of Steganography: Fragile and Robust.

Fragile steganography embeds information into a file. If the file is modified then the information is destroyed automatically. It is mainly advantageous when it is required to prove the modification of the file.

Robust Steganography embeds information into a file as is the case with fragile Steganography but here information is not easily destroyed. The information should be hidden in that part of the file where its removal can be easily perceived. Fragile steganography techniques are easier to implement than robust methods.

The application of Steganography lies in the field of digital watermarking where unauthorized and illegal copying of material can be detected. Steganography also finds its applications in secret data transmission where a user can transmit secret data through multimedia mediums without the knowledge of the existence of the data to others. Steganography can be divided in two domains, depending on the component which is used for hiding data i.e. spatial or frequency.

Example of Steganography Hiding Image inside another Image:

Lena Image

Bridge Image

Standard gray scale Lena Image Hiding the gray scale bridge image inside it. Concentrate on the Lena image you can see the bridge hidden inside.