C Programming

dont bother just use c++

# include < stdio.h >

# include < stdlib.h >

struct list

{

char info[20];

struct list *next;

struct list *prev;

};

struct list *new1,*node;

void create(struct list *s,struct list *e)

{

char ch;

node=s;

printf("\nWant to create a node(y/n):");

ch=getche();

while (ch != 'n')

{

node->next = (struct list *) malloc(sizeof(struct list));

node->next->prev= node;

node = node->next;

printf("\n Enter the string value:- ");

gets(node->info);

node->next = e;

e->prev=node;

printf("\n Enter choice--'n' for break: ");

ch = getche();

}

}

void displayL (struct list *s,struct list *e)

{

node = s->next;

while (node!=e)

{

printf(" 0x%x--%s", node,node->info);

node = node->next;

}

printf("\n");

}

void displayR (struct list *e,struct list *s)

{

node = e->prev;

while (node!=s)

{

printf(" 0x%x--%s", node,node->info);

node = node->prev;

}

printf("\n");

}

void insertA(struct list *s)

{

struct list *new1;

int c=1,count;

printf("\nEnter the location:");

scanf("%d",&count);

fflush(stdin);

new1 = (struct list *) malloc(sizeof(struct list));

printf("\nEnter the new value:");

gets(new1->info);

node=s->next;

while(node)

{

if(c==count)

break;

node=node->next;

c++;

}

node->prev->next=new1;

new1->prev=node->prev;

new1->next=node;

node->prev=new1;

}

void main()

{

struct list *start,*end;

clrscr();

start=(struct list *) malloc(sizeof(struct list));

end=(struct list *) malloc(sizeof(struct list));

create(start,end);

printf("\n Created list is as follows(L ->R)\n");

displayL(start,end);

printf("\n Created list displayed from R->L\n");

displayR(end,start);

printf("\nInserting a new location at user specified location\n");

insertA(start);

printf("\n now the listfrom L ->R\n");

displayL(start,end);

printf("\n list from R to L after insertion\n");

displayR(end,start);

getch();

}

#include <iostream>

int main (void)

{

std::cout << "\nBitwise AND (&):\n";

for (int a=0; a<=1; ++a)

for (int b=0; b<=1; ++b)

std::cout << a << " & " << b << " is " << a & b << std::endl; std::cout << "\nLogical AND (&&):\n";

for (int a=0; a<=1; ++a)

for (int b=0; b<=1; ++b)

std::cout << a << " && " << b << " is " << a && b << std::endl;

return 0;

}

if single line comment just place // before for single line comment else if multiple line denote as like this /*.............................

..............................*/

Strictly speaking, // is non.standard in C only in C++

Languages like C, Pascal, Basic do not use classes, polymorphism, etc, they promote functional style of programming.

Languages like PHP, Perl, Python, Ruby provide you with the opportunity to choose whether you like to program using classes, in other words in the object-oriented way, or adhere to functional programming - depending on what is optimal for the project you are working on.

#include<stdio.h>

int main(){

int a[3][3],i,j;

float determinant=0;

printf("Enter the 9 elements of matrix: ");

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

for(j=0;j<3;j++)

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

printf("\nThe matrix is\n");

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

printf("\n");

for(j=0;j<3;j++)

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

}

printf("\nSetting zero in upper triangular matrix\n");

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

printf("\n");

for(j=0;j<3;j++)

if(i>=j)

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

else

printf("%d\t",0);

}

return 0;

}

memcpy function is used to copy memory area. Syntax ------ void *memcpy(void *dest, const void *src, size_t n); *dest is a destination string. *src is a source string. n is a number of characters to be copied from source string. Example: #include #include main() { char src[]="Hello World"; char des[10]; memcpy(des,src,5); printf("des:%s\n",des); //It will contain the string "Hello". }

Semantic or Syntax errors are errors in the way a programmer has written his code. The code does not conform to language standards and is incorrect.

Ex:

for(int i = 0, i++, i<10) {

}

The above is a syntactically incorrect declaration of a for loop in Java. The compiler would not let you compile this code successfully.

no

They don't. All compilers produce machine code by default, with the exception of the Java compiler which emits Java byte code suitable for interpretation by the Java virtual machine at runtime.

What you call assembly is actually the disassembled machine code. That is, the machine code produced by the compiler is translated into the equivalent disassembly. This is the code you see when you hit a breakpoint and examine the disassembled machine code. You will also see disassembly when debugging code for which no source code exists (as is the case with most 3rd party libraries).

If you wish to view the actual assembly, along with your comments and source code, then you have to configure your compiler to emit assembly rather than the default machine code. You would do this if you wished to tweak the assembled code prior to final assembly, for instance, to take advantage of manual optimisations. However, modern compilers are capable of optimising code more efficiently and more easily than any human can so there's rarely a need to manually optimise.

No. Pass by value always receives a copy of the value being passed. Even if it were possible to physically pass a user-defined identifier into a function by value, the compiled code would not recognise the name since all identifiers are stripped out by the compiler and replaced with memory addresses.

Strictly speaking, even pass by reference does not pass the variable name, as the function argument is simply an alias, an alternate but informal name, for the formal name you actually pass. In essence you are passing the memory address of the variable, rather the value of the memory address as you would with pass by value.

#include <stdio.h>

int main (void) { puts ("123 894 765"); return 0; }

Most likely you haven't installed any compilers, otherwise you would know.

Maybe you misinterpret something? There doesnt seem to be a declaration of value, but maybe declaration of variable?

#include<stdio.h>

#include<math.h>

int main()

{

int num,a,b,c,d,y,k=0;

printf("Enter no.\n");

scanf("%d",&num);

y=num;

for(a=0;a<=num;a++)

{ c=pow(10,a);

d=num/c;

if (d>=1)

k=k+1;

else

break;}

printf(" an aaray of dimension %d" ,k);

int v1[k],v2[k];

int l=0,i,e,f;

for(i=k-1;i>=0;i--)

{

e=pow(10,i);

f=num/e;

v1[l]=f;

l++;

num=num%e;

}

int q,r,t=0,s=0;

q=y;

for(i=k-1;i>=0;i--)

{while(q!=0)

{

r=q%10;

v2[t]=r;

t++;

q=q/10;

}}

for (i=0;i<=k-1;i++)

{if(v1[i]==v2[i])

s++;}

if(s==k)

printf("the no.is palindrome\n");

else

printf("not a palindrome");

return 0;

}

if the queue contains one element then front end is equal to the rear end.

The std::cout and std::cin streams are peculiar to the C++ standard library. They are not available in the C standard library, but are analogous to stdin and stdout which is in the C standard library.

#!/usr/bin/perl

print factorial($ARGV[11]);

sub factorial {

my($num) = @_;

if($num == 1) {

return 1; # stop at 1, factorial doesn't multiply times zero

} else {

return $num * factorial($num - 1); # call factorial function recursively

}

}

Primitive Operations

:

enqueue(o)

Put object o on the end of the queue.

dequeue()

Remove and return the object at the front

of the queue.

head()

Reveal the front object in the queue, but

do not remove it.

size()

Return the number of objects currently in

the queue.

capacity()

Return the maximum number of objects

the queue can hold.

Other operations can be defined in terms of these primitive on

es. For

example:

•

isEmpty()

can be defined by testing whether size() is 0.

•

isFull()

can be defined by testing whether size() equals the capac-

ity().

These last two could also be considered primitive operation

s. There is

a balance between minimizing the set of primitive operation

s, versus

providing many convenient operations for users.

2^64-1 = 18446744073709551615

public class PrintValues {

public static void main(String[] args) {

for (int i = 1; i <=20; i++) {

System.out.println("Value is: " + i);

int sq = i * i;

System.out.println(i + " Squared is: " + sq);

}

}

}

It's called compiler.

matrix

void strsectdel (char *str, size_t offs, size_t ndel)

{

size_t len= strlen (str);

if (offs>len) return;

if (ndel>len-offs) ndel= len-offs;

if (ndel==0) return;

memmove (str+offs, str+offs+ndel, ndel);

len -= ndel;

str [len]= '\0';

}