C Programming

#include<stdio.h>

#include<conio.h>

#include<string.h>

void main()

{

int i,j,d;

char ch[20],temp;

clrscr();

printf("\nEnter the no.of string:");

scanf("%d",&d);

printf("\nEnter the strings:");

for(i=0;i<d;i++)

{

gets(ch[i])

}

printf("\nThe strings are:");

for(i=0;i<d;i++)

{

printf("\n%s",ch[i]);

}

for(i=0;i<d;i++)

{

for(j=i+1;j<d;j++)

if(ch[i]>ch[j])

{

temp=ch[i];

ch[i]=ch[j];

ch[i]=temp;

}

}

getch();

}

Old:

function (par1, par2)

int par1;

char *par2;

{...}

New:

int function (int par1, char *par2)

{...}

1, 2, 6, 24, 120, 720, 5040, 40320.

for loop it consists of 3 parts 1. initialization 2. condition 3. incrementation like

for(i=1;i<=10;i++).This loop executes 10 times.

While loop: This is an entry check loop. First it checks for the condition and if the condition is true then only loop will be executed and this continues till the condition becomes false.

ex: i=0;

while(i<10)

{i++;

} This loop executes 10 times.

Do loop: This is an exit check loop. This executes the loop at least once even when the condition is false.

ex: 1=0;

do

{

i++;

}while(i<10);

Here's one: there's no namespace in C

GB is acronym for gigabyte and is used to indicate storage capacity on a computer. A gigabyte is 2^30 bytes or 1,073,741,824 bytes.

Note that disk manufacturers and memory chip manufacturers use different notations. Memory chips are precisely specified such that a 1 GB memory chip is guaranteed to provide storage for exactly 1,073,741,824 bytes. However, hard drives only give approximate storage capacities such that 1 GB only guarantees storage capacity for at least 10^9 bytes, or 1 billion bytes, which is the equivalent of a 0.93 GB memory chip.

Technically, hard-drive manufacturers use the correct notation since the prefixes kilo-, mega- and giga- literally equate to some power-of-ten (10^3, 10^6 and 10^9 respectively). However, it is not possible to create a memory chip with exactly 10^3 bytes, it has to be an exact power-of-two (2^10, 2^20 and 2^30, respectively).

The reason memory has to be an exact power-of-two stems from the way in which memory is addressed on a binary computer. In order to address 1000 bytes we'd need at least 10 bits in the range 0000000000 through 1111100111 (0 to 999 decimal) which means there are 24 invalid addresses in the range 1111101000 through 1111111111 (1000 to 1023 decimal). This over-complicates circuit design; it's much easier to make all bit patterns valid by adding on those missing 24 addresses thus giving us the full kilo-binary-byte capacity of 1024 bytes. Hard-drive manufacturers are less constrained in the way storage is addressed, because the addressing is subject to the operating system and the way in which the hard-drive is formatted. Typically, a hard-drive is divided up into addressable clusters which are themselves some power-of-two bytes in length, such as clusters of 512, 1024, 2048 or 4096 bytes.

In an effort to avoid confusion, the terms kilo-binary-byte (KiB), mega-binary-byte (MiB) and giga-binary-byte (GiB) are used to indicate precise memory capacities while KB, MB and GB are used to indicate the more generalised hard disk capacities. However, these terms is not widely adopted. For instance, Windows operating systems use the term KB to mean 1024 bytes whether reporting memory capacity or hard drive capacity, hence a 300 GB hard-drive only has capacity for 279.4 GB of storage on Windows. But 279.4 GB is 300 billion bytes so, strictly-speaking, it is quite correct to call it a 300 gigabyte drive.

Branching in 'C' (or any other programming language) is where the flow of execution of code can change depending on some test condition. In 'C', this can be achieved with the "if" statement or the "switch" statement:

void branching (int i)

{

if ( i < 10) {

// Branch 1 - less than 10

printf("i is less than 10");

}

else {

// Branch 2 - 10 or more

printf("i is greater than or equal to 10");

}

}

The conditional statement in foxpro is DID YOU GET IT

#include

int main()
{
int num[100];
printf("please input your numbers.enter any letter for the end\n");
int i=0,j=0,k=0;
while(scanf("%d",&num[i++]));
i--;
printf("you input %d numbers\n",i);
for(j=i-1;j>=0;j--){
for(k=0;k<=j;k++){
if(num[k]>num[k+1]){
int temp;
temp=num[k+1];
num[k+1]=num[k];
num[k]=temp;
}
}
}
for(j=0;j<=i-1;j++){
if(j%5)
printf("%d ",num[j]);
else{
printf("\n");
printf("%d ",num[j]);
}
}
return 0;
}

Utility programs are non-applications. Applications allow you to work productively with your computer (MSWord, Excel, etc). Utility programs allow you to configure, diagnose, repair or monitor computer activity. Examples of utility programs are SCANDISK (to repair partitions) and FORMAT (to configure partitions). Control Panel applets are also utilities.

Searching is slower for linked-lists rather than (ordered) trees because you need to iterate through each element serially, whereas for an ordered (binary) tree you use a "divide and conquer", otherwise known as binary search, method.

Think of it this way. Think of a number between 1 and 128. Perhaps the number is 97. With an ordered list, it would take 97 comparisons to find the item. With an unordered list, it would take an average of 64 comparisons - if the order was random. With a binary tree, i.e. a binary search, you only need 7 comparisons. In fact, you never need more than 7 comparisions for a tree size of 128, and on average, you would use less than that.

Cache memory is built into the central processing unit, commonly known in short as the CPU, or it can be located on a separate chip next to the CPU.

In other sense, cache is located between CPU and Main Memory in the memory hierarchy of a computer system.

just type allinurl:cache memory, in Google search and you will find your answer with more pictures and a lot more about cache memory.

#include<stdio.h>

#include<conio.h>

void main()

{

int n,a=2;

clrscr();

printf("\n enter n");

scanf("%d",&n);

if(i<=a-1)

{

if(a%i==0)

{

printf("\n the given number is not a prime number");

break;

}

i++;

if(a==i)

{

printf("\n the given number is a prime number");

}

getch();

output:

enter the value of n:2

the given number is prime number

There are a few ways of going about this. The easiest way would be through a literal string:

printf("X X X X X X X X X");

If you want to print an arbitrary number of X's (in this case, 9), a for() loop would work:

for (count=0; count<9; count++) printf("X ");

This code would generate a final space at the end. To fix this and only use spaces to separate X's:

for (count=0; count<9; count++) printf("%sX", count?" ":"");

it will give the substring of length(as per the user) from the actual string,and the starting length from where it has to copy the substring from actual should be given by the user.

binary language

Design of the database (Database Design) refers to a given application environment, optimize the structure of the database, the database and applications, which can efficiently store data to meet the application needs of various user information needs and processing requirements). At www. myelibrary.net.In you can clearly understand what is the database design.

A type system is generally very useful. It prevents you from making many mistakes. For example adding 1 to "cool" would result in a garbage answer but you might do it accidentally without types.

However types are sometimes constraining and inflexible. Perhaps I really do want to add 1 to 'c' because I know exactly what new ascii value it would give me. Type systems also increase compile time, run time, or both.

Note: You may be confusing no typing with dynamic typing. With dynamic typing you generally do not label a variable with a type in its declaration. Scripting languages like python are often like this. However they remain strongly typed languages. Assembly is an example of a untyped or one type language.

In a segment of memory, whose name is 'data segment'

No. Generally, one instruction in a high level language corresponds to many instructions in machine language.

in dynamic list after adding a new element size of the list disturbed so deletion and insertation is necessary to add a new element

Yes, please do. Here is an example:

#include <stdio.h>

int main (void)

{ puts ("Hello, World"); return 0; }