polynomial addtion using linked list

#include
#include
#include

struct link{

int coeff;

int pow;

struct link *next;

};

struct link *poly1=NULL,*poly2=NULL,*poly=NULL;

void create(struct link *node)

{

char ch;

do

{
15.
printf("\n enter coeff:");
16.
scanf("%d",&node->coeff);
17.
printf("\n enter power:");
18.
scanf("%d",&node->pow);
19.
node->next=(struct link*)malloc(sizeof(struct link));
20.
node=node->next;
21.
node->next=NULL;
22.
printf("\n continue(y/n):");
23.
ch=getch();
24.
}
25.
while(ch=='y' || ch=='Y');
26.
}
27.
void show(struct link *node)
28.
{
29.
while(node->next!=NULL)
30.
{
31.
printf("%dx^%d",node->coeff,node->pow);
32.
node=node->next;
33.
if(node->next!=NULL)
34.
printf("+");
35.
}
36.
}
37.
void polyadd(struct link *poly1,struct link *poly2,struct link *poly)
38.
{
39.
while(poly1->next && poly2->next)
40.
{
41.
if(poly1->pow>poly2->pow)
42.
{
43.
poly->pow=poly1->pow;
44.
poly->coeff=poly1->coeff;
45.
poly1=poly1->next;
46.
}
47.
else if(poly1->powpow)
48.
{
49.
poly->pow=poly2->pow;
50.
poly->coeff=poly2->coeff;
51.
poly2=poly2->next;
52.
}
53.
else
54.
{
55.
poly->pow=poly1->pow;
56.
poly->coeff=poly1->coeff+poly2->coeff;
57.
poly1=poly1->next;
58.
poly2=poly2->next;
59.
}
60.
poly->next=(struct link *)malloc(sizeof(struct link));
61.
poly=poly->next;
62.
poly->next=NULL;
63.
}
64.
while(poly1->next || poly2->next)
65.
{
66.
if(poly1->next)
67.
{
68.
poly->pow=poly1->pow;
69.
poly->coeff=poly1->coeff;
70.
poly1=poly1->next;
71.
}
72.
if(poly2->next)
73.
{
74.
poly->pow=poly2->pow;
75.
poly->coeff=poly2->coeff;
76.
poly2=poly2->next;
77.
}
78.
poly->next=(struct link *)malloc(sizeof(struct link));
79.
poly=poly->next;
80.
poly->next=NULL;
81.
}
82.
}
83.
main()
84.
{
85.
char ch;
86.
do{
87.
poly1=(struct link *)malloc(sizeof(struct link));
88.
poly2=(struct link *)malloc(sizeof(struct link));
89.
poly=(struct link *)malloc(sizeof(struct link));
90.
printf("\nenter 1st number:");
91.
create(poly1);
92.
printf("\nenter 2nd number:");
93.
create(poly2);
94.
printf("\n1st Number:");
95.
show(poly1);
96.
printf("\n2nd Number:");
97.
show(poly2);
98.
polyadd(poly1,poly2,poly);
99.
printf("\nAdded polynomial:");
100.
show(poly);
101.
printf("\n add two more numbers:");
102.
ch=getch();
103.
}
104.
while(ch=='y' || ch=='Y');
105.
}

CIRCULAR LINKED LIST

#include h>

#include h>

#include h>

#include h>



/*****  Structure template  *****/

struct list{

    int roll_no;

    char name[20];

    float marks;

    struct list *next;

};



/*****  Redefining struct list as node  *****/

typedef struct list node;



void init(node*);

void ins_aft(node*);       /*** FUNCTION FOR DELETING A NODE AFTER ***/

node* ins_bef(node*);      /*** FUNCTION FOR INSERTING A NODE BEFORE ***/

node* del(node*);          /*** FUNCTION FOR DELETING A NODE ***/

void search(node*);        /*** FUNCTION FOR SEARCHING CRITERIA INPUT ***/

void disp(node*);          /*** FUNCTION DISPLAYING THE NODES ***/

void rollsrch(node*);      /*** FUNCTION SEARCHING THROUGH ROLL NUMBER ***/

void namesrch(node*);      /*** FUNCTION SEARCHING THROUGH NAME ***/

void marksrch(node*);      /*** FUNCTION SEARCHING THROUGH MARKS ***/



/*****  Main function  *****/

void main()

{

    node *head;               /* HEAD OF THE LINK LIST */

    char ch;                  /* Choice inputing varible */

    int opt;                  /* Option inputing variable*/

    static int flag=0;        /* Unchanged after iniialization */

    clrscr();

    head=(node*)malloc(sizeof(node));

    head->next=NULL;   /* NULL is being over written in init function */

    do

    {

again:

    printf("\nEnter your option\n");

    printf("\n1. Initialize the node\n");

    printf("\n2. Insert before a specified node\n");

    printf("\n3. Insert after a specified node\n");

    printf("\n4. Delete a particular node\n");

    printf("\n5. Search the nodes\n");

    printf("\n6. Display all the nodes\n");

    scanf("%d",&opt);

    if(flag==0 && opt!=1)

    {

        printf("\nNo. You must first initialize at least one node\n");

        goto again;

    }

    if(flag==1 && opt==1)

    {

        printf("\nInitialisation can occur only once.\n");

        printf("\nNow you can insert a node\n");

        goto again;

    }

    if(opt==4 && head->next==head)

    {

        printf("\nYou cannot delete the one and only the single node\n");

        goto again;

    }

    if(flag==0 && opt==1)

        flag=1;

    switch(opt)

    {

    case 1:

        init(head);

        break;

    case 2:

        head=ins_bef(head);

        break;

    case 3:

        ins_aft(head);

        break;

    case 4:

        head=del(head);

        break;

    case 5:

        search(head);

        break;

    case 6:

        disp(head);

        break;

    }

    printf("\nDo you wish to continue[y/n]\n");

    ch=(char)getche();

    }while(ch=='Y' || ch=='y');

    printf("\nDone by \"SHABBIR\"\n");

    printf("\nPress any key to exit\n");

    getch();

}



/*****  Initialisation function  *****/

void init(node *start)

{

    printf("\nEnter Roll number\n");

    scanf("%d",&start->roll_no);

    printf("\nEnter the name\n");

    fflush(stdin);

    gets(start->name);

    printf("\nEnter the marks\n");

    scanf("%f",&start->marks);

    start->next=start;

}



/*****  Function for inserting before a particular node  *****/

node* ins_bef(node *start)

{

    int rno;                    /* Roll number for inserting a node*/

    node *newnode;              /* New inputed node*/

    node *current;              /* Node for travelling the linked list*/

    newnode=(node*)malloc(sizeof(node));

    current=start;

    printf("\nEnter the roll number before which you want to insert a node\n");

    scanf("%d",&rno);

    init(newnode);

    if(current->roll_no==rno)

    {

        newnode->next=start;

        while(current->next!=start)

            current=current->next;

        current->next=newnode;

        start=newnode;

        return(start);

    }

    while(current->next!=start)

    {

        if(current->next->roll_no==rno)

        {

            newnode->next=current->next;

            current->next=newnode;

            return(start);

        }

        current=current->next;

    }

    /*

    If the function does not return from any return statement.

    There is no match to insert before the input  roll number.

    */

    printf("\nMatch not found\n");

    return(start);

}



/*****  Function for inserting after a particular node  *****/

void ins_aft(node *start)

{

    int rno;                    /* Roll number for inserting a node*/

    int flag=0;

    node *newnode;              /* New inputed node*/

    node *current;              /* Node for travelling the linked list*/

    newnode=(node*)malloc(sizeof(node));

    printf("\nEnter the roll number after which you want to insert a node\n");

    scanf("%d",&rno);

    init(newnode);

    current=start;

    while(current->next!=start)

    {

        /***  Insertion checking for all nodes except last  ***/

        if(current->roll_no==rno)

        {

            newnode->next=current->next;

            current->next=newnode;

            flag=1;

        }

        current=current->next;

    }

    if(flag==0 && current->next==start && current->roll_no==rno)

    {

        /***  Insertion checking for last nodes  ***/

        newnode->next=current->next;    /** start is copied in newnode->next**/

        current->next=newnode;

        flag=1;

    }

    if(flag==0 && current->next==start)

        printf("\nNo match found\n");

}



/*****  deletion function  *****/

node* del(node *start)

{

    int rno;                    /* Roll number for deleting a node*/

    node *delnode;          /* Node to be deleted */

    node *current;              /* Node for travelling the linked list*/

    printf("\nEnter the roll number whose node you want to delete\n");

    scanf("%d",&rno);

    current=start;

    if(current->roll_no==rno)

    {

        /***  Checking condition for deletion of first node  ***/

        delnode=current; /*  Unnecessary step  */

        while(current->next!=start)

            current=current->next;

        current->next=start->next;

        start=start->next;

        free(delnode);

        return(start);

    }

    else

    {

        while(current->next->next!=start)

        {

            /***  Checking condition for deletion of   ***/

            /*** all nodes except first and last node  ***/

            if(current->next->roll_no==rno)

            {

                delnode=current->next;

                current->next=current->next->next;

                free(delnode);

                return(start);

            }

            current=current->next;

        }

        if(current->next->next==start && current->next->roll_no==rno)

        {

            /***  Checking condition for deletion of last node  ***/

            delnode=current->next;

            free(delnode);

            current->next=start;

            return(start);

        }

    }

    printf("\nMatch not found\n");

    return(start);

}



void search(node *start)

{

    int ch;                          /* Choice inputing variable */

    printf("\nEnter the criteria for search\n");

    printf("\n1. Roll number\n");

    printf("\n2. Name\n");

    printf("\n3. Marks\n");

    scanf("%d",&ch);

    switch(ch)

    {

    case 1:

        rollsrch(start);

        break;

    case 2:

        namesrch(start);

        break;

    case 3:

        marksrch(start);

        break;

    default:

        rollsrch(start);

    }

}



/*****  Search function searching the appropriate roll number *****/

void rollsrch(node *start)

{

    int rno;                    /* Roll number to be searched */

    node *current;              /* Node for travelling the linked list*/

    current=start;

    printf("\nEnter the roll number to search\n");

    scanf("%d",&rno);

    while(current->next!=start)

    {

        if(current->roll_no==rno)

            printf("\n %d  %s  %f\n",current->roll_no,current->name,current->marks);

        current=current->next;

    }

    if(current->next==start && current->roll_no==rno)

        printf("\n %d  %s  %f\n",current->roll_no,current->name,current->marks);

}



/*****  Search function searching the appropriate name *****/

void namesrch(node *start)

{

    char arr[20];               /* Name to be searched */

    node *current;              /* Node for travelling the linked list*/

    current=start;

    printf("\nEnter the name to search\n");

    fflush(stdin);

    gets(arr);

    while(current->next!=start)

    {

        if(strcmp(current->name,arr)==NULL)

            printf("\n %d  %s  %f\n",current->roll_no,current->name,current->marks);

        current=current->next;

    }

    if(current->next==start && strcmp(current->name,arr)==NULL)

        printf("\n %d  %s  %f\n",current->roll_no,current->name,current->marks);

}



/*****  Search function searching the appropriate marks *****/

void marksrch(node *start)

{

    float marks;                /* Marks to be searched */

    node *current;              /* Node for travelling the linked list*/

    current=start;

    printf("\nEnter the marks to search\n");

    scanf("%f",&marks);

    while(current->next!=start)

    {

        if(current->marks==marks)

            printf("\n %d  %s  %f\n",current->roll_no,current->name,current->marks);

        current=current->next;

    }

    if(current->next==start && current->marks==marks)

        printf("\n %d  %s  %f\n",current->roll_no,current->name,current->marks);

}



/*****  Output displaying function  *****/

void disp(node *start)

{

    node *current;              /* Node for travelling the linked list*/

    current=start;

    while(current->next!=start)

    {

        printf("\n %d  %s  %f",current->roll_no,current->name,current->marks);

        current=current->next;

    }

    printf("\n %d  %s  %f",current->roll_no,current->name,current->marks);

}

data structure - array based ADT

#include
#define max 50;
stuct list
{
char a[max];
int size;
}
typedef struct list LIST;
void traversal(LIST);
void insertfirst(LIST*,char);
void insertpos(LIST*,char,int);
void insertlast(LIST*,char);
void deletefirst(LIST*);
void deletepos(LIST*,int);
void deletelast(LIST*);
int find(LIST*,char);
int isempty(LIST*);
int iffull(LIST*);
void deletea(LIST*,char);
char findelm(LIST*,int);

//implementation file

#include"header.h"
//to check empty list
int isempty(LIST *L)
{
if(L->size==0)
return 0;
else
return 1;
}
//to check full list
int isfull(LIST *L)
{
if(L->size==max)
return 1;
else
return 0;
}
//travesre operation
void traversal(LIST L)
{
int i;
for(i=0;isize-1,i>=0;i--)
L->a[i+1]=L->a[i];
L->a[0]=x;
L->size++;
}
else
printf("cannot be inserted");
}
//insertat end
void insertend(LIST *L,char x)
{
int i,a;
a=isfull(L);
if(a==1)
{
i=L->size;
L->a[i]=x;
L->size++;
}
else
printf("cannot be inserted");
}
//to insert at given positon
void insertpos(LIST *L,char x,int ps)
{
int i,a;
a=isfull(L);
if(a==1)
{
for(i=L->size-1;i>=ps-1;i--)
L->a[i+1]=L->a[i];
L->a[ps-1]=x;
L->size++;
}
else
printf("cannot be inserted");
}
// delete at first
void deletefirst(LIST *L)
{
inti,a;
a=isempty(L);
if(a==1)
{
for(i=0;isize-1;i++)
L->a[i]=a->a[i+1];
L->size--;
}
else
printf("deletion not possible");
}
//to delete last
void deletelast(LIST *L)
{
int i,a;
a=isempty(L);
if(a==1)
L->size--;
else
printf("deletion not posible");
}
// delete by positon
void deletepos(LIST *L,int pos)
{
int i,a;
a=isempty(L);
if(a==1)
{
for(i=pos;isize-1;i++)
L->a[i-1]=L->a[i]
L->size--;
}
else
printf("deletion is not possible");
}
//delete the given elemt
void deletea(LIST *L,char x)
{
int i=0;int pos=0;
for(i=0;isize;i++)
{
if(L->a[i]!=x)
pos++;
break;
}
deletepos(&L,pos); }
//to contruct
void read (LIST *L)
{
int n;
printf("ENTER NO OF ELEMENTS:")
scanf("%d,&n");
L->size=n;
for(i=0;i<=n;i++) scanf("%c",&L->a[i]);
}
//to find positon when char is given
int find(LIST *L,char x)
{
int i=0;int pos=0;
for(i=0;isize;i++)
{
if(L->a[i]!=x)
pos++;
break;
}
return(pos);
}
//to find ele,wen pos given
char findele(LIST *L,int p)
{
int i,a;
char x;
a=isempty(L);
if(a==1)
return(L->a[p-1]);
else
return(NULL);
}

Learn C by example in just 5 hours.C tutorial on-line.

---

Have you always wanted to master a programming language. Well today if you are glancing at this page you have chosen a language which perhaps without doubt is the most versatile. But to learn C for say basic programmers is a challenge. While the old basic used interpreters C uses compilers and basically is very portable. But let quit all this jibrish and get to the heart of this page. I say you can learn C programming in 3 hours. Well atleast the basics that will help you to build more powerful programs.You say I can't show you C in 5 hours. Well let's test that ...

---

A simple hello program.(demonstrates the const function in all c programs--the main() function.)
(example-1)
main()
{
puts("hello world guess who is writing a c program");
return(0);
}

That's it. In all c programs there is a main function which is followed by a { and closed by a } after a return()function.It doesn't have to be return(0) but that depends upon the type of c compiler you have. Check your compiler before you start your programming.

You saw above that puts function is used to put a whole sentence on the screen; but are there functions that will put characters on the screen/take characters: Yes and next is a table of what they are and what they do. Read them and the examples that follow.

getchar()	Gets a single character from the input/keyboard.

putchar()	Puts a single character on the screen.

The printf function is a function used to print the output to the screen.printf() needs to know if the output is an integer,real,etc example-2
main()
{
printf(hello);
}
Assuming hello was defined earlier say by #define hello "Hello!" the output is Hello!. But if the output is an integer then %d has to be attatched to the printf statement.

This above can be shown as printf("I am %d years old",12) which will result in the following result:I am 12 years old

The %d tells that an integer is to be placed here.

Now we will look into a function called scanf().This lets you input from the kewyboard and for that input to be taken by the program and processed.Once again it is important to tell scanf() what type of data is being scanned.

Here is an example of a program that demonstrates both scanf and printf in unison.
example-3

main() {
int count;
puts("Please enter a number: ");
scanf("%d", &count);
printf("The number is %d",count);
}

---

That concludes the first hour of your tutorial.Now this is a list of data type identifiers.

%f=float %c=char %s =s tring %e=inputs number in scientific notation.

As you saw in the first hour of our tutorial c is a language in which you program using functions. Functions are usually identified by the following characteristic:>> functionname() In c the main() function is essential. Think of it as a constant function for all your programs and all other functions can be accessed from the main().Before I show you how we do that let us have an example where we want to pause a program before the screen is changed. This would involve the foll- owing procedure:>> write a main function then use puts function to put statements on the screen like we did in section 1 above and then before the next set of puts statements declare a pause.

This is how it is done:

example-4
main()
{
puts("hello there");
puts("what is your name?")
pause()
puts("It is nice to meet you")
}
pause();
{
int move_on;
printf("press entere to continue");
move_on=getchar();
return(0);
}

This above will pause until a key is pressed on the keyboard. Granted that the above program makes no sense from a practical point of view but I want to show is the use of another function inside the main function.

C has many functions that comes with it. See your compiler manual to see what you have.Now we are going to look at conditions in c programming:>> the if command and do command.

Here is an example of th if command:

example-5
main()
{
float cost,tax,luxury,total;
luxury=0.0;
printf("Enter the cost of the item: ");
scanf("%f", &cost);
tax=cost*0.06;
if(cost>40000.0)
luxury=cost*0.005;
total=cost+tax+luxury;
printf("the total cost is %0.2f",total);
}

This is a simple example of one if statement. Another If statement is the if -else statement. This can be shown as this

example-6
if(cost >40000)
{
luxury=cost*0.005;
printf("The luxury tax is %.2f",luxury);
}
else
{
puts("There is no luxury tax for the items");
luxury=0.0;
}

Now the format a do statement is as follows:

do
{
instruction;
instruction
}
while(condition);

The format for a FOR statement is as follows:

for(initial=value;condition;increment)
instruction;

Now for an example:

example-7
main()
{
int row,column;
puts("\t\tMY Handy multipication table");
for(row=1;tow<=10;row++) { for(column=1;column<=10;column++)
printf("%6d", row*column);
putchar('\n');
}
}

The output is a multipication table of 10x10 size.

example-8
main()
{
int temp;
float celsius;
char repeat;
do
{
printf("Input a temperature:");
scanf("%d", &temp);
celsius=(5.0/9.0)*(temp-32);
printf(%d degrees F is %6.2f degrees celsius\n",temp, celsius);
printf(("do you have another temperature?");
repeat=getchar();
putchar('\n');
}
while(repeat=='y'|| repeat=='y');
}

This shows you to how to use the do command for conditional programming in c.

---

Now we are in our 3rd hour.

Now we will concentrate on arrays:

What is a flag?

A flag is an algorithm that informs the program that a certain condition has occured.

example-9

main()
{
int temp;
float celsius;
char repeat;
char flag;
do
{
flag='n";
do
{
if(flag=='n')
printf("Input a valid temperature :");
else
printf("input a valid temperature,stupid:");
scanf("%d",&temp);
flag='y';
}
while (temp<0||temp>100);
celsius=(5.0/9.0)*(temp-32);
printf("%d degrees F is %6.2f degrees celsius\n",temp,celsius);
printf("Do you have another temperature?");
repeat=getchar();
putchar('\n');
}
while (repeat=='y' || repeat=='Y");
}

That was an example of how flags work.

What is the break command?

The break command ends the loop in which it is placed just as if the while condition, or the condition in a for loop becomes false.

• Mission
• Vision
• Salient Features
• Achievements
• Infrastructure
• Computer Systems
• Department Library
• R & D
• Placement
• Industrial Visit
• Prizes Won by the B.E.(CSE) Students
• Exhibition/Symposium
• Projects Vendor
• Expert Lectures
• Paper Presented by Faculty
• Paper Presented by Students
• Faculty
• AICTE-ISTE Sponsored Course on Advanced Web Technology
• MEPCONCT '06

Computer Science Department established in 1987 Headed by Dr.K.Muneeswaran Courses offered B.E. (Computer Science and Engineering) M.E. (Computer Science and Engineering) Mission To produce globally competent, quality computer professionals and to inculcate the spirit of moral values for the cause of development of our nation Vision To become a centre of excellence in computer education and research and to create the platform for industrial consultancy Salient Features The department is headed by Dr. K. Muneeswaran, Professor & Head. He has B.E. Electronic and Communication Engineering M.E., Computer Science and Engineering Ph.D in Computer Science and Engineering in the area of Image processing and Computer Vision 21 years of Teaching Experience at both UG and PG Level Qualified and Experienced team of faculty members with varied experience in areas of System Software, Computer Architecture, Artificial Intelligence, Mobile and Computer Networks, Object Oriented Design, Computer Graphics and Image Processing, Distributed Computing, Database Management System, Multimedia and Neural Networks. Department has undertaken two AICTE Sponsored research projects. Faculty members are carrying Research work in the areas of Digital Image Processing, Multimedia, Computer Networks and Distributed Operating System. More than 100 technical papers presented by the faculty in various national and international journals and conferences. Faculty members have acquired certificates from leading man industries in areas like Advanced Java Technology and Component Based Technology. Active Interaction with industries like BHEL for mutual technological transfer. The IT Infrastructure of the college is maintained by the department The department carries out all In house software development and maintenance. Regular value added courses on advanced topics are run to supplement the curriculum for the students. Many final year projects are done in association with industries. Intranet facility is available for providing Ebooks, Course Schedules, Lab manuals, assignments, placement tips, Aptitude test papers and Internal exam results to the students. Industrial visits are also organized apart from the industrial tour to the students. Anna University Sponsored Faculty Development Programme on Computer Architectures and Advanced Operating System was held during the year 2003 Academic Achievements 79 University ranks including 8 first ranks among 16 batches. Every year, students present on an average of 50 papers in various National and International symposium. Got 34th rank in ACM-International Collegiate Programming Contest among 82 teams from 9 countries conducted at Amirtha University, Coimbatore in 2005 Infrastructure Laboratories Computer Center Programming Lab System software and DBMS Lab Hardware Lab Network and Internet Lab Post Graduate Lab Computer Systems Common Servers: Mail Server (College mail account for all staff and students) DNS server Web server Proxy servers (2 Nos) Database server Department Servers: Windows 2000 Server for Students domain and Intranet server Free BSD Linux Data base Server Workstations: 250 pentium based systems with multimedia facilities Capable of getting connected to all server and every other systems over TCP/IP backbone All systems having access with Internet/Intranet Software: Windows OS Linux (with all programming and Script languages) Free BSD Oracle IBM DB2 PowerBuilder Sybase MS Office Visual Studio Mathematica IDL (Image Processing Tools) MathCAD Rational Rose Dream Weaver Macromedia Flash Front Page Express Novell Netware Photoshop JDK and J2EE Internet Facilities: 256 Kbps leased line from BSNL 1:1 Mbps Upstream and downstream uncompressed bandwidth from Reliance Access: 8.30 A.M to 9.30 P.M (Monday – Friday) 8.30 A.M to 4.30 P.M (Saturday) 24x7 for PG and all needy B.E. students Department Library: Number of Titles available: 1100 Number of Volumes available: 1200 Number of CD's available: 150 Research and Development: Area of Current work Image Processing Networks Multimedia Distributed OS Data mining Mobile computing Neuro Fuzzy Computing PLACEMENT List of Companies recruited the students (Campus Placement): HCL Technologies, Chennai CTS, Chennai Wipro Technologies, Bangalore iNautix Technologies, Chennai Future Soft, Chennai Ramco, Chennai Sify, Chennai TCS, Chennai Industrial Visit Organized: FACT Industry, Kochin Modern food Industry,Kochin Kochin Refineries, Kochin CIFNET-Central institute of fisheries nautical and engineering training, Kochin Kochin shipyard, Kochin Kaavian Software Systems Private Limited, Chennai Salar Jung Museum, Hyderabad Jupiter Enterprises, Karox, Mumbai Jain Software, Mumbai Bushi Dam, Tata Power, Mumbai EXHIBITIONS / SYMPOSIUM ORGANIZED BY CSE DEPARTMENT: Sl.No Name of the Event Year Details of the Event 1. MEPCOMP-97 1997 MEPCOMP-97 was a State level Technical Symposium It included events like paper presentation, software demo, Software contest and a quiz. 2. MEPCOMEX-99 1999 MEPCOMEX-99 Exhibition featured working models from the various engineering departments of the college and from the creative psyche of talented students belonging to schools across the state. The exhibition lived true to it's ideals of creating Engineering and Scientific awareness among the students. Number of students visited the exhibition 3000 3. MEPCOMEX-02 2002 MEPCOMEX-02 Exhibition contains display of computers software, peripherals and hardware. It was conducted to create Engineering and Scientific awareness among school students Number of students visited the exhibition 5000 4. REVONS-03 2003 REVONS-03 was a National level Technical Symposium Organized by CSE Department It included paper presentation, software demo, Software contest and a quiz. The chief guest was Dr. R.Srinivasan, Principal Consultant, TCS, Chennai Number of students attended the symposium 500 5. ICARUS-04 2004 ICARUS-04 was a National Level Symposium Organized by CSE Department and CSI Students branch It included a Paper Presentation session which put forth 25 selected papers on cutting edge technologies like AI, WAP and so on. It provided a high utility Panel Discussion with Experts from leading technological services across the country. A Technical Quiz was also conducted. Mr. Sathya Narayanan, Head, Cognizant Academy acted as the Chief Guest for the function. Number of students attended the conference: 600 6. Cognition v1.0 2004 Cognition v1.0 was a National Level Students Technical Symposium Organized by IT and CSE Department and CSI Students branch It included a Paper Presentation session which put forth 24 selected papers on cutting edge technologies like Nano Technology, Network Security, Data Mining and so on. Other events were Technical Quiz and Surprise event. Mr.N.Sivaram Training Manager, Honeywell Technology Solutions Lab, Madurai acted as the Chief Guest for the Inaugural function. Dr.K.Ramar, Head, CSE Dept (U.G.), National Engineering College, Kovilpatti acted as the Chief Guest for the Valedictory function. Number of students attended the conference: 600 List of industries provided Final Year Projects to the students: Many of the students get associated with industries for doing their final year project work. The following is the list of industries that offered project work for the students. Web Soft Solutions, Chennai Synergy Infotech P Ltd, Chennai CPDE, Anna University , Chennai Pentasoft Technologies, Chennai Scallion Tech, Chennai Wipro, Chennai Fortuna Impex P Ltd, Calcutta Ayyanar Spining Mills, Virudhunagar Netsavvy Solutions, Chennai. EMARYES IGCAR, Kalpakkam Ramco Systems, Chennai I Tutor India Pvt.Limited, Chennai HCL Technologies Chennai U & I System design Ltd., Bangalore NOC, Madras Atomic Power Station, Kalpakkam Alkali Chemicals & Fertilizers, Tuticorin India Technologies, Chennai Embedded Technologies, Madurai BHEL, Trichy Music world entertainment Ltd, Chennai Network System & Technologies cyber campus, Tiruvandrum CTS, Chennai US Software India Pvt. LTD National Aerospace Laboratories, Bangalore Cyber Globe India Pvt Ltd, Chennai COSMOSOFT Tech. Ltd., Chennai HCL peripherals, Chennai Sun Infosys Ltd, Chennai Graced Technologies, Chennai Ebrahma Technologies, Coimbatore TWAD BOARD, Chennai Bitech softwares, Chennai Ruby International Advanced Software Solutions [RIASS] HCL Info systems, Madurai NCCT enports Software Division, Chennai KG ISL Coimbatore Tandem Infotech, Madurai BSNL, Tirunelveli Dynamic software solutions, Chennai TMB and BOB EXTERNAL EXPERT LECTURES ORGANIZED : TOPIC SPEAKERS Life Science Project-Issues Mr.Travis IBM USA Projects and Placement Opportunities at IBM Mrs. Ju Immaculate Tinu IBM USA VLSI Design ,Testing and Implementation Mr.Robert Kingsley Intel USA Use Case Driven Requirements Specification Mr.N.Sivaram, Honeywell Technologies, Madurai DNA Computing Mr.L.Murugesan Lecturer, Arasan Ganesan Polytechnic Sivakasi. Artificial Intelligence Dr. V.Sadasivam, Prof.& Head Dept. of Computer Science Engineering, Manonmaniam Sundaranar University Tirunelveli. Usability Engineering Mr.Sathya Narayanan, Head, Cognizant Academy, Cognizant Technology Solutions Chennai. Recent Trends in IT Mr.R.Vigneshwaran, Project Manager , Hexaware Software (P) Solutions Ltd., Chennai. Embedded Systems Mr.S.Prem Chandran Manager-Training , Embedded Technologies, Madurai . Opportunities in Open Source / Linux Technologies Mr.Shuveb Hussain, Software division , Winways Systems Private Limited, Madurai . Mobile Computing Dr.P.Marichamy Professor, ECE Dept, National Engg College (NEC), Kovilpatti. Recent Trends in .NET Technology and it’s Applications in end to end solution Mr.Ganesan Perumal, System Architect, HTC Global services, Detroit, Michigan, USA Tips and Guidelines for Application Design and Architecture Concepts Mr.V.Srinivasan, Associative Consultant, i-Flex Solutions, Los Angeles, USA Developing Entrepreneurship Skills Mr. Suhas Gopinath, CEO, Globals Inc Ltd., USA Engineers as Managers Prof.M.Rajasekaran, Dept. of BBA, ANJA College, Sivakasi Need of versioning, competency, innovation and the reusability for the IT Professionals Mr.N.Sivaram Training Manager, Honeywell Technology Solutions Lab, Madurai Communication Skills Mrs.Chitra Manohar Recent Trends in IT Industries Mr. K. Ramkumar, Chief Executive Officer, Dhyan Infotech Pvt. Ltd., Chennai Introduction to .NET and J2EE Technologies Mr. Selvaraj, Manager SSI, Sivakasi Networking Mr.David Livingston, Tandem Software Pvt. Ltd, Madurai How to prepare for Career Development Dr.R.Srinivasan Principal Consultant Tata Consultancy Services Chennai Career Upgradation Mr. Muthukrishnamoorthy, HR, Titan Industries Communication Skills Mr. Lawrence, American college, Madurai Linux Mr.Shuveb Hussion, IBM Habbits today Success tomorrow Mr.A.V.Ramanathan, Deputy Manager (HRD Trainer), Hydro Electric Power Station, Tutocorin The Field of Robotics Mr. G. Balaji, Software Engineer, IBM Global Services India ltd Mr. Vignesh Sankaran, Prakitant System Development, KUKA Innotec Ltd. Germany List of Papers presented by Faculty members in National and Inter National Conference Prizes and Awards won by Students Sl.No. Event / Paper Presentation Conducted By Participants Awards/ Prizes won 1 Paper presentation Arulmigu Kalasalingam College of Engineering Mr.M.Anand and Mr.R.Ravindran I prize 2 Paper presentation Anna University Mr.K.L.Narasiman II prize 3 Quiz and Cross word contests Arulmigu Kalasalingam College of Engineering Mr.V.Anbucheeralan, Mr.S.Parthiv Mr.Anto Abraham I prize 4 Paper presentation contest Noorul Islam College of Engineering Mr.S.Siva Mr.Kamala Narayanan I prize 5 Software contest Vellore Institute of Technology Mr.A.M. Sundravel Mr.P.Santa Sundar Mr.R.Sudharsan and Mr.N.Arun Babu IIprize 6 Paper presentation contest Thiyagarajar College of Engineering Mr.S.Aiyasamy Deepan, Mr.P.Harihara Balaji I prize 7 Software contest Karunya University Mr.K. Ruba Soundar IIprize 8 Master Mind contest Karunya University Mr.S.Stalin IIprize 9 Physics Model Presentation . Sri Sai Ram Engg. College S. Hannah Lovely and J.Sahaya Brainy I prize 10 Software presentation. Kumaraguru college of Technology Ms.S.R.Ramya Ms.M.Aysha Banu I prize 11 Quiz NIT Calicut Mr.R.Parasaran III Prize 12 Paper Presentation NIT Calicut Mr.R.Parasaran II Prize 13 Paper presentation Karunya University. Mr. P.Shankar I Prize 14 Paper presentation Pavai Engineering college Nammakal Mr.G.Balasubramanian Mr.M.Arun Kumar I Prize 15 Paper presentation Vellore Institute of Technology Mr.N.Selva Kumar I prize 16 Paper presentation software treasure hunt Mixed bag NIT,Trichy Ms.B.ShenbagaPriya Ms.M.Janani III prize Iprize IIprize 17 “Web Design” NIT,Trichy Mr.R. Parasaran Mr. D.Vimal Kumar I Prize 18 “Relationship Tracking in Linux” PSG Technology, Coimbatore Mr.N.Selvakumar I Prize 19 “Design and Analysis of a high performance content delivery Networks” Noorul Islam College of Engineering Mr.N.Hari Hara Balaji, Mr.S.Aiyasamy Deepan Mr.M.Bhavathi Perumal I Prize 20 “An Algorithm for Virtual partitioning based on DFS concepts” MIT, Chennai Mr.M.Arun Balaji I Prize 21 “Design and Analysis of a high performance content delivery network” Sona College of Technology, Salem Mr.S.Aiyasamy Deepan Mr.M.Bhagavathi Perumal I Prize 22 “Smart Card Technology” Cape Institute of Technology, Nagercoil Mr. Kamalesh.T.V, II Prize 23 Software Contest Thiayagarajar College of Engineering, Madurai Mr. T.Bakeerathan Mr.Alagu Sakthivel I Prize 24 Software Design Contest Thiayagarajar College of Engineering, Madurai Mr. R.Balamurugan I Prize 25 Technical quiz Contest Thiayagarajar College of Engineering, Madurai Mr. R.Balamurugan Mr.S.Ashok III Prize 26 Rotary club Event Kalasalingam University, Krishnan Koil. Mr.G.Sankaralingam Mr.J.M.Sabarish Rotary Youth Leadership Award (RYLA)

FACULTY