C Programming

A linear queue models the FIFO(first in first out) data structure, much like a line in real life. The first person in line will be the first person served, in queues the first element to be added is the first that can be removed. The only adding point is to the end of the list and the only removal point is the beginning of the list.

Queue<String> q = new LinkedList<String>(); // The LinkedList class implements Queue

q.add("Bob"); // Now Bob is at the front of the queue

q.add("Stacy"); // Stacy after Bob

q.add("Will"); // and Will after her

String removed = q.remove(); // Bob is removed

q.add("Michael"); Michael is added after Will

System.out.println(q); // Prints ["Stacy", "Will", "Michael"]

Default initial value of extern integral type variable is zero otherwise null.

For every class an empty constructor will be defined automatically by default unless you provide a constructor definition manually. Constructor in a class can be used to initialize variables or perfrom some basic functionallity whenever an object is created.

A multi-level feedback queue scheduling policy gives preference to short and I/O bound processes, it also rapidly establishes the nature of a process and schedules it accordingly. Multi-level feedback queues work on priorities. Processes are placed in separate queues based on their priority, this in turn is based on their CPU consumption and If a process uses too much of the CPU, it will be given a lower priority and therefore get less CPU time than fast and I/O bound processes. Any processes that do not complete in their allocated time slice / quantum are demoted to a queue of less priority, these lower priority queues generally have larger quantums / time slices. Each of the queues may use a different scheduling algorithm, this is done to make the overall scheduling method as efficient as possible. The features that may vary between different multi-level feedback queue scheduling methods are: - The number of queues - The scheduling algorithm assigned to each queue - The method used to promote/demote processes to different queues - The method that determines which queue a process enters --- Thomas Lee

A variable declared in the header of a method whose initial value is obtained during method invocation (using the actual parameter). So: int method(/*Formal Parameters*/){ //Method Actions return 0; }

A signed integer represents both positive and negative values, while an unsigned integer represents only positive values. Range depends on the number of bits the compiler assigns for the representation.

bits max-negative max-positive max-unsigned

8 -128 +128 255

16 -32768 +32767 65535

32 -2147483648 +2147483647 4294967295

64 -9223372036854775808 +9223372036854775807 18446744073709551615

I also had this problem few dayz before and it just made me mad, i was felt into that situation that i even cannot format ma windows so, finally i researched upon it and found the solution :-

1. Go to your first drive for example c:/ and delete the hiden file autorun.inf also delete from recycle bin

2. Then create a folder name autorun.inf after delete first one as soon as possible

3. do the same thing with all of your drives

4. Log off ur PC your PC

bingo ! you have your PC recovered back

The function of the RAC recovery program is to find over payments and under payments in the Unites States health care industry to improve the budget issues and efficiency.

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.