harikannan.mit15
BAN USERHARI KANNAN V S.
7/8 CSE, Mobile: +91-9791081160
MIT Campus, Email: harikannan.mit15@gmail.com
Anna University,
Chennai – 600044
OBJECTIVE:
To seek a career in a reputed organization that will help me to grow with the organization and to acquire new knowledge and skills and apply my knowledge in that field.
EDUCATIONAL QUALIFICATION:
LEVEL INSTITUTION MARKS YEAR OF PASSING
B.E
(Computer Science & Engineering) Madras Institute of Technology, Anna University. CGPA = 8.318
( Up to 6th Semester) April 2012
12th
( State Board ) Govt.Boys Hr.Sec.School,
Podatur pet. 95.41%
( 1145 / 1200 ) March 2008
10th
( State Board ) Govt.Boys Hr.Sec.School,
Podatur pet. 93.8 %
( 469/500 ) March 2006
AREA OF INTEREST:
Programming and Data Structures
Object Oriented Concepts
Operating System Concepts
SOFTWARE SKILLS:
Programming Languages : C, C++, Java Basics
Scripting Languages : HTML, JavaScript, JSP (basics)
Database Systems : Mysql
PROJECTS COMPLETED:
ATM:
. This was designed to implement the operation of ATM with using data structure in C. In this user can do the operation of enquiry of balance, withdrawal and users authorization is checked while entering PIN number.
Technologies Used:
Language : C
Secured Data Transmission:
This was designed to provide secured data and message transmission between the two nodes by implementing the encryption and decryption techniques.
Technologies Used:
Language : JAVA
Railway Management:
This was designed to simulate the basic needed activities on railway management .in this admin can increase the no of trains available based upon the ticket booking status .we have implemented easy way of online booking facilities too.
Technologies Used:
Front End : HTML,JSP
Back End : Mysql
Connectivity : ODBC
ECOPS:
This project implement the concept of making online complaints to the police .the admin will assign police officer to the corresponding complaints based on region .the reports from cops will be forwarded to admin and action will be taken. The consolidate report will be forwarded to people who registered complaints.
Technologies Used:
Front End : HTML,JSP
Back End : Mysql
Connectivity : ODBC
Cluster and Cluster based routing protocol in Delay tolerant Networks:
This is a currently doing project which is aimed at improving the routing performance in delay tolerant network in a cluster based approach. Clustering details are updated at each timeslot. We are making an efficient algorithm for clustering and cluster head selection .we are mainly concentrates on multi hop routing for end to end connection.
Technologies Used:
Simulator : Network Simulator
ACHIEVEMENTS:
Secured School First in 12th exam.
Secured District 3rd in 12th standard among Government schools.
Secured School First in 10th standard.
RESPONSIBILITIES UNDERTAKEN:
School Representative in 12th Standard
Class Representative in 3rd Semester
Class Committee member during 3rd and 4th semester
Had been one of the Organizers of “SAMHITA”, National Level Technical Symposium in 2010.
Organized technical events conducted by computer society in 5th and 6th semester.
Secretary in Technical team in Computer Society.
CO-CURRICULAR ACTIVITES:
Active member in Online Programming Judges such as “SPOJ” .
Participated in various Online Programming Contests conducted by IIT-M, SSN, and CEG.
Participated in Intra College Technical Symposium Enigma’09 and Enigma’10 Conducted by MIT , Anna University.
Winner in “Juggernaut” (Algorithm Stream) in Enigma’10.
Participated and Finalist for more than six times in Intra College Programming Competition “Juggernaut” during 2009-11.
Finalist in “DB MANIA” event in National Level Technical Symposium Abacus’10 Conducted in CEG, Anna University.
Participated in Workshop on “WEB 2.0” conducted by IBM and “Ethical Hacking” workshop in National Level Technical Symposium Abacus’10 Conducted in CEG, Anna University.
Participated in National Level Technical Symposium Converita’10 Conducted by SSN college of Engineering.
Participated in NSS camp in school and college.
Participated in various cultural programs in school and college.
HOBBIES:
Watching and Playing Cricket
Playing Chess
PERSONAL DETAILS:
FATHER’S NAME : Mr. V K Shanmugam
DATE OF BIRTH : 04.06.1991
AGE : 20
SEX : Male
MOTHER TONGUE : Tamil
LANGUAGES KNOWN :
TO READ : Tamil, English
TO WRITE : Tamil, English
TO SPEAK : Tamil, English
PERMANENT ADDRESS : 144, Ottraivadai Street,
Podatur pet, Thiruvallur District -631208
CONTACT ADDRESS : Room no: 4108,
New Hostel, MIT Hostels,
Chrome pet, Chennai-600044.
Mobile: +91-9791081160
I hereby declare that the information furnished above is true to the best of my knowledge.
Place: Chennai. Yours faithfully,
Date:
(HARI KANNAN V S.)
<pre lang="" line="1" title="CodeMonkey29943" class="run-this">#include<stdio.h>
#include<string.h>
#include<math.h>
int a[100],n;
void print()
{
int i,k,j;
for(i=0;i<pow(2,n);i++)
{
j=0;
k=i;
while(k)
{
if(k%2)
printf("%d",a[j]);
k/=2;
j=j+1;
}
printf("\n");
}
}
main()
{
int i;
printf("howmany nentumbers u want to enter ?");
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
print();
}
</pre><pre title="CodeMonkey29943" input="yes">
this code works for single digit integers</pre>
<pre lang="" line="1" title="CodeMonkey19527" class="run-this">#include<stdio.h>
#include<string.h>
#include<math.h>
int a[100],n;
void print()
{
int i,k,j;
for(i=0;i<pow(2,n);i++)
{
j=0;
k=i;
while(k)
{
if(k%2)
printf("%d",a[j]);
k/=2;
j=j+1;
}
printf("\n");
}
}
main()
{
int i;
printf("howmany nentumbers u want to enter ?");
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
print();
}
</pre><pre title="CodeMonkey19527" input="yes">
</pre>
//i think below cide gives no of ways for given n steps;
#include<stdio.h>
int stair(int n)
{
if(n==0)
{
return 0;
}
else if(n==1)
{
return 1;
}
else
{
return(stair(n-2)+stair(n-1)+2);
}
}
main()
{
int n;
scanf(" %d",&n);
printf("\nno of ways to climb up is %d",stair(n));
}
<pre lang="" line="1" title="CodeMonkey9503" class="run-this">#include<stdio.h>
- harikannan.mit15 August 20, 2011#include<string.h>
#include<math.h>
int a[100],n;
void print()
{
int i,k,j;
for(i=0;i<pow(2,n);i++)
{
j=0;
k=i;
while(k)
{
if(k%2)
printf("%d",a[j]);
k/=2;
j=j+1;
}
printf("\n");
}
}
main()
{
int i;
printf("howmany nentumbers u want to enter ?");
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
print();
}
</pre><pre title="CodeMonkey9503" input="yes">
this code works for single digit integers</pre>