Google Search

Sunday, January 29, 2012

ANNA UNIVERSITY FIRST SEMESTER JANUARY 2012 RESULTS ANNOUNCING DATE(TENTATIVE) | ANNA UNIV 1ST SEMESTER RESULTS 2012 | JANUARY/FEBRUARY 2012 FIRST SEMESTER UG/PG RESULTS ANNOUNCING DATE | ANNA UNIVERSITY JANUARY 2012 BE/BTECH/BARCH/ME/MTECH/BSC/BCA/MBA/MCA/MSC/MARCH

ANNA UNIVERSITY 1ST FIRST SEMESTER UG/PG JANUARY 2012 RESULTS HAS BE ANNOUNCED ON 24.02.2012(8:30 PM), STUDENTS WHO ARE EAGERLY WAITING FOR RESULTS CAN CHECKOUT THEIR RESULTS IN BELOW LINKS @ REJINPAUL.COM

1ST FIRST SEMESTER RESULTS JANUARY 2012 ANNA UNIVERSITY,CHENNAI APPLICABLE TO CHENNAI,MADURAI,COIMBATORE,TRICHY,TRINELVELI AND ALL COLLEGES UNDER ANNA UNIVERSITY,CHENNAI 

Anna University,Chennai
Controller of Examinations
Results of UG/PG Examinations (Credit System)- Jan-2012
Registration No
LATEST UPDATES ON JANUARY 2012 RESULTS

THE ENTIRE ANSWER SCRIPT VALUATION DISTRICT WISE HAS BEEN COMPLETED - LATEST OFFICIAL INFORMATION


"ANNA UNIVERSITY JANUARY 2012 EXAMINATION RESULTS HAS BEEN ANNOUNCED OFFICIALLY - CONTROLLER OF EXAMINATION,AU,CHENNAI
--------------------------------------------------------
(fast server2)
LINK1 FOR JANUARY 2012 RESULTS CREDIT SYSTEM: CLICKHERE
--------------------------------------------------------
(slow server2 due to heavy traffic) 
LINK2 FOR JANUARY 2012 RESULTS CREDIT SYSTEM: CLICKHERE
--------------------------------------------------------
(moderate server3)
LINK3 FOR JANUARY 2012 RESULTS CREDIT SYSTEM: CLICKHERE
--------------------------------------------------------
(alternate server4)
LINK4 FOR JANUARY 2012 RESULTS CREDIT SYSTEM: CLICKHERE
--------------------------------------------------------
(alternate server5)


LINK5 FOR JANUARY 2012 RESULTS CREDIT SYSTEM: CLICKHERE
--------------------------------------------------------
(alternate server6)
LINK6 FOR JANUARY 2012 RESULTS CREDIT SYSTEM: CLICKHERE
--------------------------------------------------------
TAGS : 1ST SEM JAN 2012 RESULTS ,JANUARY 2012 FIRST BE/BTECH SEMESTER RESULTS,ANNA UNIV JANUARY 2012 RESULTS,FIRST SEMESTER JANUARY 2012 RESULTS,JANUARY 2012 ME/MTECH RESULTS, ANNA UNIVERSITY BSC/BCA/MBA JANUARY 2012 RESULTS , ANNA UNIVERSITY JANUARY 2012 RESULTS WILL BE PUBLISHED TODAY ?,ANNA UNIV JAN 2012 RESULTS FOR MSC,AU JANUARY 2012 RESULTS,AU CHENNAI JANUARY RESULTS , JANUARY 2012 ANNA UNIVERSITY RESULTS, JANUARY/FEBRUARY 2012 RESULTS ANNOUNCING DATE ,FIRST SEMESTER RESULTS ANNOUNCING DATE

C PROGRAM TO IMPLEMENT TREE TRAVERSAL


Algorithm for tree traversal

Preorder(root)
If root = null then exit
Process root->info
Preorder root->left;
Preorder root->right
Exit

Inorder(root)
If root = null then exit
Inorder root->left
Process root->info
Inorder root->right
Exit

Postorder(root)
If root = null then exit
Postorder root->left
Postorder root->right
Postorder root->info
exit


// traversing a tree

#include<stdio.h>
struct rec
{
  long num;
  struct rec *left;
  struct rec *right;
};
struct rec *tree=NULL;
struct rec *insert(struct rec *tree,long num);
void preorder(struct rec *tree);
void inorder(struct rec *tree);
void postorder(struct rec *tree);
int count=1;
main()
{
  int choice;
  long digit;
  do
  {
     choice=select();
     switch(choice)
        {
  case 1: puts("Enter integer: To quit enter 0");
   scanf("%ld",&digit);
   while(digit!=0)


          {
    tree=insert(tree,digit);
    scanf("%ld",&digit);
          }continue;
  case 2: puts("\npreorder traversing TREE");
   preorder(tree);continue;
  case 3: puts("\ninorder traversing TREEE");
   inorder(tree);continue;
  case 4: puts("\npostorder traversing TREE");
   postorder(tree);continue;
  case 5: puts("END");exit(0);
  }
 }while(choice!=5);
}
int select()
{
int selection;
  do
    {
    puts("Enter 1: Insert a node in the BT");
    puts("Enter 2: Display(preorder)the BT");
    puts("Enter 3: Display(inorder)the BT");
    puts("Enter 4: Display(postorder)the BT");
  puts("Enter 5: END");
  puts("Enter your choice");
  scanf("%d",&selection);
         if((selection<1)||(selection>5))
   {
        puts("wrong choice:Try again");
     getch(); }
     }while((selection<1)||(selection>5));
     return (selection);
}
struct rec *insert(struct rec *tree,long digit)
{
  if(tree==NULL)
    {
  tree=(struct rec *)malloc(sizeof(struct rec));
  tree->left=tree->right=NULL;
  tree->num=digit;count++;
    }
else
  if(count%2==0)
 tree->left=insert(tree->left,digit);
else
 tree->right=insert(tree->right,digit);
  return(tree);
}
void preorder(struct rec *tree)
{
  if(tree!=NULL)
    {
  printf("%12ld\n",tree->num);
  preorder(tree->left);
  preorder(tree->right);
    }
}


void inorder(struct rec *tree)
{
  if(tree!=NULL)
      {
  inorder(tree->left);
  printf("%12ld\n",tree->num);
  inorder(tree->right);
      }
}
void postorder(struct rec *tree)
{
  if(tree!=NULL)
    {
  postorder(tree->left);
  postorder(tree->right);
  printf("%12ld\n",tree->num);
    }

}
 


int select()
{
int selection;
  do
    {
    puts("Enter 1: Insert a node in the BT");
    puts("Enter 2: Display(preorder)the BT");
    puts("Enter 3: Display(inorder)the BT");
    puts("Enter 4: Display(postorder)the BT");
  puts("Enter 5: END");
  puts("Enter your choice");
  scanf("%d",&selection);
         if((selection<1)||(selection>5))
   {
        puts("wrong choice:Try again");
     getch(); }
     }while((selection<1)||(selection>5));
     return (selection);
}
struct rec *insert(struct rec *tree,long digit)
{
  if(tree==NULL)
    {
  tree=(struct rec *)malloc(sizeof(struct rec));
  tree->left=tree->right=NULL;
  tree->num=digit;count++;
    }
else
  if(count%2==0)
 tree->left=insert(tree->left,digit);
else
 tree->right=insert(tree->right,digit);
  return(tree);
}


void preorder(struct rec *tree)
{
  if(tree!=NULL)
    {
  printf("%12ld\n",tree->num);
  preorder(tree->left);
  preorder(tree->right);
    }
}
void inorder(struct rec *tree)
{
  if(tree!=NULL)
      {
  inorder(tree->left);
  printf("%12ld\n",tree->num);
  inorder(tree->right);
      }
}
void postorder(struct rec *tree)
{
  if(tree!=NULL)
    {
  postorder(tree->left);
  postorder(tree->right);
  printf("%12ld\n",tree->num);
    }

C PROGRAM TO MERGE TWO SORTED ARRAY


ALGORITHM TO MERGE TWO SORTED ARRAY

     ENTER (a[10],n)
1.  Repeat step 2 for i = 0 to (n-1)
2.  Input a[i]
3.  Return

DISPLAY(c[20],p)
1.  Repeat step 2 for k = 0 to p-1
2.  Print c[k]
3.  Return

MAIN( )
1.  Start 
2.  Input no. of elements in 1st & 2nd array as ‘n’ & ‘m’
3.  Enter (a.n)
4.  Enter (b,m)
5.  i = j = k = 0
6.  Repeat step 7 to 12 while ((i < n)&&(j < m))
7.  If (a[i] >= b[j]),goto step 9
8.  c[k+1] = a[i+1]
9.  If a[i] = b[j] ,goto step 11
10. c[k++] = b[j++]
      goto step 7
11. c[k++] = a[i++]
12. j++
13. Repeat step 14 while (i<n)
14. c[k++] = a[i++]
15. Repeat step 16 while m > j
16. c[k++] = b[j++]
17. Display merged arrays as display(c;k)
18. Exit

 
#include<stdio.h>
#include<conio.h>
void main( )
int n,m,i,j,k,c[40],a[20],b[20];
clrscr ();
printf("Enter limit for A:");
scanf("%d",&n);
printf  ("\nEnter limit for B:");


scanf("%d",&m);
printf("Enter elements for A:-\n");
 for(i=0;i<n;i++)
scanf("%d",&a[i]);
  printf("Enter elements for B:-\n");
for(j=0;j<m;j++)
scanf("%d",&b[j]);
i=j=k=0;
while(i<n&&j<m)
 {
  if(a[i]<b[j])
 c[k++]=a[i++];
else
if(a[i]>b[j])
c[k++]=b[j++];
else

{
 c[k++]=b[j++];
i++;
                        

j++;
}
}

if(i<n)
{
 int t;
for(t=0;t<n;t++)
   
  c[k++]=a[i++];
}
if(j<m)
{
 int t;
for(t=0;t<m;t++)
{
 c[k++]=b[j++];
}
}
printf("\n");
for(k=0;k<(m+n);k++)
printf("\t \n %d ",c[k]);
getch();