#include<iostream.h>
#include<conio.h>
#include<string.h>
#include<stdio.h>
class add
{
private: int a,b;
public:
add()
{
a=b=0;
}
void input()
{
cout<<"enter value of a";
cin>>a;
cout<<"enter value of b";
cin>>b;
}
void show()
{
cout<<"value ofa"<<a;
cout<<"value of b"<<b;
}
add operator +(add p)
{
add temp;
temp.a=p.a+a;
temp.b=p.b+b;
return temp;
}
};
void main()
{
add x,y,z;
x.input();
y.input();
x.show();
y.show();
z=x+y;
z.show();
getch();
}
Posted by Unknown On Wednesday, February 20, 2013 No comments READ FULL POST

Code-Division Multiple Access (CDMA) was conceived several decades ago. Recent advances in electronic technology have finally made its implementation possible.
CDMA differs from FDMA because only one channel occupies the entire bandwidth of the link. It differs from TDMA because all stations can send data simultaneously; there is no time sharing.

Packet Switched Connectivity

·         Resources allocated only when data is transferred
·         Same “path” through network can be maintained (but not necessarily)
·         Billing typically dependent on amount of data transferred (or fixed tariffs)
·         GPRS: Theoretically up to 171 Kbits/s, typically 40-50 Kbit/s
Posted by Unknown On Wednesday, February 20, 2013 No comments READ FULL POST

This Assembly Language Program is for buuble sort subroutine using a local variable

[org 0x0100]
jmp start
data: dw 60, 55, 45, 50, 40, 35, 25, 30, 10, 0
data2: dw 328, 329, 898, 8923, 8293, 2345, 10, 877, 355, 98
dw 888, 533, 2000, 1020, 30, 200, 761, 167, 90, 5
bubblesort: push bp ; save old value of bp
mov bp, sp ; make bp our reference point
sub sp, 2 ; make two byte space on stack
push ax ; save old value of ax
push bx ; save old value of bx
Posted by Unknown On Friday, February 15, 2013 No comments READ FULL POST
Its very simple to add a movie in your web page using html
This is the script:

<script type="text/javascript"
src="http://ajax.googleapis.com/ajax/libs/
swfobject/2.2/swfobject.js"></script>
<script type="text/javascript">
swfobject.embedSWF("flash/bird.swf",
"bird", "400", "300", "8.0.0");</script>
Posted by Unknown On Thursday, February 14, 2013 No comments READ FULL POST
This is the Assembly Language Code for Bubble Sort subroutine taking parameters from stack

[org 0x0100]
jmp start
data: dw 60, 55, 45, 50, 40, 35, 25, 30, 10, 0
data2: dw 328, 329, 898, 8923, 8293, 2345, 10, 877, 355, 98
dw 888, 533, 2000, 1020, 30, 200, 761, 167, 90, 5
swapflag: db 0
bubblesort: push bp ; save old value of bp
mov bp, sp ; make bp our reference point
push ax ; save old value of ax
push bx ; save old value of bx
Posted by Unknown On Tuesday, February 12, 2013 No comments READ FULL POST

  • Adaline Rule
  • Widrow-Hoff Rule
  • Least Mean Squares (LMS) Rule 
Change From Perceptron
  • Replace the step function in the with a continuous (differentiable) activation function, e.g linear
  • For classification problems, use the step function only to determine the class and not to update the weights.
  • Note: this is the same algorithm we saw for regression. All that really differs is how the classes are determined. 
Posted by Unknown On Saturday, February 09, 2013 No comments READ FULL POST
Welcome to Sams Teach Yourself C# in 21 Days! In today’s lesson, you begin
the process of becoming a proficient C# programmer. Today you…
• Learn why C# is a great programming language to use.
• Discover the steps in the program-development cycle.
• Understand how to write, compile, and run your first C# program.
• Explore error messages generated by the compiler and linker.
• Review the types of solutions that can be created with C#.
• Create your first console and Windows forms program.
• Learn about object-oriented concepts.
Posted by Unknown On Saturday, February 02, 2013 No comments READ FULL POST

Part 1. Homogeneous linear 2nd degree relations with constant coe cients.
Consider the recurrence relation
( ) T(n) + aT(n - 1) + bT (n - 2) = 0
This is called a homogeneous linear 2nd degree recurrence relation with constant coe cients:
2nd degree because it gives T(n) in terms of T(n - 1) and T(n - 2),
linear and constant coe cients because of the form of the left side, and
homogeneous because of the zero on the right hand side.
The idea for solving this relation is to \guess" a solution of the form T(n) = xn for some
number x, and then to simply substitute this expression into the equation to determine the
value(s) of x that work. Since T(n - 1) = xn-1 and T(n - 2) = xn-2 we get the equation
xn + axn-1 + bxn-2 = 0
Since x is clearly not zero, we can divide by xn-2 to get
x2 + ax + b = 0
which is called the characteristic equation for the recurrence relation ( ).
Posted by Unknown On Friday, February 01, 2013 No comments READ FULL POST
  • RSS
  • Delicious
  • Digg
  • Facebook
  • Twitter
  • Linkedin
  • Youtube

Like us

    as

    Contact Form

    Name

    Email *

    Message *