C Programming

There is no difference other than that a derived class inherits from a base class. That is, the derived class inherits all the public and protected members of its base class, and is a more specialised form of its base class. Thus both can be treated as if they really were base classes. The derived class can also override the virtual methods of the base class, thus allowing polymorphic behaviour without the need to know the exact type of the derived class.

#include<iostream>

#include<vector>

#include<cassert>

using namespace std;

// Returns a vector of Fibonacci numbers from start to max.

// Sequence A000045 in OEIS if start is 0.

vector<unsigned> fibonacci (const unsigned start, const unsigned max)

{

// Invariants:

if (1<start)

throw std::range_error

("vector<unsigned> fibonacci (const unsigned start, const unsigned max): start < 1");

if (max<start)

throw std::range_error

("vector<unsigned> fibonacci (const unsigned start, const unsigned max): max < start");

// Empty set...

vector<unsigned> fib {};

if (max)

{

// First term...

fib.push_back (start);

if (1<max)

{

// Second term...

fib.push_back (1);

// All remaining terms...

unsigned next = 0;

while ((next = fib.back()+fib[fib.size()-2]) <= max)

fib.push_back (next);

}

}

return fib;

};

// Return true if the given number is prime.

bool is_prime (const unsigned num)

{

if (num<2) return false;

if (!(num%2)) return num==2;

for (unsigned div=3; div<=sqrt(num); div+=2)

if (!(num%div)) return false;

return true;

}

// Displays all prime Fibonacci numbers in range [1:10,000].

int main()

{

const unsigned max=10000;

vector<unsigned> f = fibonacci (1, max);

cout << "Prime Fibonacci numbers in range [1:" << max << "]\n";

for (auto n : f)

if (is_prime (n))

cout << n << ", ";

cout << "\b\b " << endl; // backspace and overwrite trailing comma

}

#include #include #include void main() { char p[10][5],temp[5]; int tot=0,wt[10],pt[10],i,j,n,temp1; float avg=0; clrscr(); printf("enter no of processes:"); scanf("%d",&n); for(i=0;i\n",i+1); scanf("%s",&p[i]); printf("enter process time"); scanf("%d",&pt[i]); } for(i=0;ipt[j]) { temp1=pt[i]; pt[i]=pt[j]; pt[j]=temp1; strcpy(temp,p[i]); strcpy(p[i],p[j]); strcpy(p[j],temp); } } } wt[0]=0; for(i=1;i\t P_time\t w_time\n"); for(i=0;i\t%d\t%d\n",p[i],et[i],wt[i]); printf("total waiting time=%d\n avg waiting time=%f",tot,avg); getch(); }

void main(){ int i,j; scanf("%d",&i); if((i%5)==0) printf("the given number is divisible by 5); }

This sounds like a homework assignment, so I will give you some pseudo code instead of straight C code.

[code]

OPEN FILE FOR READING

IF NOT END OF FILE THEN

min = READ FILE INPUT

max = min

ENDIF

WHILE NOT END OF FILE

x = READ FILE INPUT

IF x < min THEN

min = x

ENDIF

IF x > max THEN

max = x

ENDIF

ENDWHILE

CLOSE FILE

[/code]

If you are using C, then you will need to use fopen(), scanf(), fclose() and maybe feof(). If you are using C++ then you can use fstream, must like you would use cin, except that you have to open the stream, check for end of file and close it.

#include<stdio.h>

#include<conio.h>

void main(){

int a[100],i,temp,j,n;

printf("\t \n enter the size of the array");

scanf("%d",&n);

printf("\n enter the numbers ");

for(i=0;i<n;i++){

scanf("%d",&a[i]);

}

j=n-1;

for(i=0;i<(n/2);i++){

temp=a[i];

a[i]=a[j];

a[j]=temp;

j--;

}

for(i=0;i<n;i++){

printf("\n %d",a[i]);

}

}

In some languages and programming environments, a case or switch statement is considered easier to read and maintain than an equivalent series of if-else statements, because it is more concise.

However, when implemented with fall-through, switch statements are a frequent source of bugs among programmers new to the switch statement.

You simply access it. That's what public means. You can access a public member from any other class, or even from non class code, so long as the referenced class is in scope to the referencing code. In order to do that, you need to have a reference (directly or indirectly) to the instance of the class you want to reference. This would generally be passed as an argument to the referencing code.

A counted loop is a loop that executes the loop's statement a pre-determined number of times. The count represent the exit condition of the loop. A loop that is not counted is an infinite loop.

The #include directive is used to tell the preprocessor that the specified file's contents are to be included at the point where the directive appears, just as if you'd typed those contents in full yourself.

Include files are primarily used to organise declarations of external variables and functions, complex data types, constants and macro definitions. The code need only be declared once, and included wherever required. Think of include files as a means of providing forward declarations without having to retype those declarations in full. The definitions of those declarations needn't be contained in the included file, but they must be made available to the program, either as a linked library or as a separate source code file which includes those same declarations.

The include keyword is used in C to tell the linker what libraries your code is going to be using.

This function presumes that both parameters are greater than 0.

int gcd(int m, int n)

{ while( m > 0 )

{

if( n > m )

{ int t = m; m = n; n = t; }

m -= n;

}

return n;

}

Sure, recursion can always be substituted with using a stack.

Short answer: They're the same.

Due to technical limitations, we on WikiAnswers cannot write C++ in the question field. So we must write "C plus plus." Unfortunately, we're also lazy. So we write "cpp" as an abbreviation.

According to computer networking: a top-down approach, the transmission rate of Ethernet LAN is 10 Mbps, 100 Mbps, 1 Gbps and 10 Gbps. Maximum rate can be transmitted to a destination that is not being transmitted to by other users.

Bubble sort, also known as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort. Although the algorithm is simple, it is not efficient for sorting large lists; other algorithms are better.

.data mult1 dw 2521H dw 3206H mult2 dw 0A26H dw 6400H ans dw 0,0,0,0 .code mov ax,@data mov ds,ax ; LEA SI,ans mov ax,mult1 mul mult2 mov ans,ax mov ans+2,dx mov ax,mult1+2 mul mult2 add ans+2,ax adc ans+4,dx adc ans+6,0 mov ax,mult1 mul mult2+2 add ans+2,ax adc ans+4,dx adc ans+6,0 mov ax,mult1+2 mul mult2+2 add ans+4,ax adc ans+6,dx mov ax,4C00h int 21h end

takes a lot of time because you will have to go through all the parent nodes before going to the children nodes

u got a String A

String B stores the reverse

A="John"

use a reverse loop.

for(int i=A.length();i>0;i--)
{
p=A.charAt(i);
B=B+p;
}

thats it u got the reverse in B


In Java, you can just use the build-in method of the class StringBuffer.

1^2 = 1
11^2 = 121
111^2 = 12321
1111^2 = 1234321
11111^2 = 123454321













#include
#include
#include
void main()
{
clrscr(); int n;//soullessgod
cout<<"\n enter number of lines ";//whatsoever
cin>>n;
int a=1,b,s=1;
for(;a<=n;s=s*10+1)
{
for(b=n-a;b>=1;b--)
{
cout<<" ";
}
cout<cout<<"\n";
a++;
}

getch();
}

C is not an object oriented programming language. As such there are no class data types in C.