HUWAEI EC325 Fedora 8 Works or My Thr

I tried in Ubuntu With GUI tools as well as changing wbconfig.conf file. Things dint work till I realised that PPP0 was taken by the Ethernet Connection that I had at home. Though I get Some but I don get most of the jargon that I am trying to convey.

I came across a manual which had install instructions for installing the device in Fedora core n one of my frns had a fedora distro

My fedora release is code-named psyche. The install was 30 min. I could configure the Network Manager for My USB modem using a manual. Pretty simple N GUI.

My modem works fine. I need to get a network monitor. Fedora is great. I acquired rpms for codeblocks ide,real player, gnomechm, mplayer, xine codecs . I have everything I want.

Must try GIMP sometime,its cool with its features n hot..(people are using it more) I always liked art. I'm doin fine with fedora, and it does good to me.

In a free world without fences, who needs gates.

HUAWEI EC325 Linux 1

I tried using it in UBUNTU Hardy, by changing network config in network manager.
Doesn't show up USB based connection. Have to figure a way out. Hope ubuntuforums.com would work out. I've posted a modest question there.

My first attempt to move to opensource. I rejoice my try. Join if you care.



You have to put in many, many, many tiny efforts that nobody sees or appreciates before you achieve anything worthwhile. -- Brian Tracy

Project 10 to 100th

http://www.project10tothe100.com/how_it_works.html

I've just got the info. Haven't thought much, but i wanted to post this n more.

Adding two numbers using bitwise operators without using +

You should know how an half adder works for reading this code.

http://en.wikipedia.org/wiki/Adder_(electronics)
gives info on half adder.


Lets start. If you know half adder you would know that it has an xor gate and an add gate. It manipulates two bits to find a sum and carry.

An addition problem is just the same for 2 power(n) bit number.

ie. Each bit in the first number is Xored with corresponding bit in the other number and a carry is got.

How do we get the carry?? The carry for all the bits is got in another number.

What would you do with this carry. You would try to xor it with the next higher bit in the number.

When do you need to stop all this.. When there's no carry...


here's the c code

int add(int x, int y) {

int a, b;

do {

a = x & y; b = x ^ y; x = a << 1; y = b;

}while(a);

return b;

}

You can also write a recursive code for this

int add(int a,int b)
{
if (!b)

{
return(add((a^b),(a&b)<<1));
}
}