Anonymous
BAN USER
MY RESUME
( B.Tech,IT,Fresher 08-12 )
Harish Kumar Upadhyay
Address :C/O T.M.Abbas,HMT P.O.,Hidayat Nagar,Kochi-682022,Kerala.
Cell: 0091-8891732298
email:inimitableharish@gmail.com
_________________________________________________________________________________________________
Objective :
Seeking an opportunity to apply my skills with focus on quality, dedication and ingenuity.
_________________________________________________________________________________________________
Education :
Degree/Certificate Institute Year Attended Percentage
B.Tech.(Information Technology) Cochin University of Science and Technology (2008-present) 71%
12th - ICSE Mount Assisi School 2007 76%
10th - ICSE Mount Assisi School 2005 88%
_________________________________________________________________________________________________
Academic Projects :
1) Music Store , November 2011 – February 2012
jQuery UI,javascript,jsp,CSS,HTML,XML,MySql and commercially free and open source tools.
2) Android , june 2011-November 2011
Presented IEEE paper- Research on Mobile Location Service Design Based on ANDROID (Geolocation).Use of SDK and API for building elementary application .
3) Multimedia , June 2011 –November 2011
Road Safety- 3D animation using 3ds Max 2010 as animation tool.
4) Hacking and Security , November 2010- March 2011
5) Online Voting System , june 2010-November 2010
JSP ,MYSQL.HTMl pages with dreamweaver and Notepad, Notepad++,Netbeans as IDE.
_________________________________________________________________________________________________
Technical Skills :
Languages/skills : Java/C/C++,
jQuery,
CSS,
HTML5,
JSP,
Javascript,
Python(elementary),
HTML
LAMP ( linux,apache,mysql,php )
Shell scripting
OS : Linux (Ubuntu 10.04/11.04,mint 11 , Android ,windows (7 / vista) , Backtrack–User Level.
Tools : VMware Player ,NetBeans, 3dsMax 2010,andLinux,Ecllipse,DreamWeaver,Virtualbox.
others : MySQL,
Wordpress (.com),
Cryptography
Ethical Hacking with good networking concepts.
good communication and presentation skill. git (beginner)
_________________________________________________________________________________________________
Personal Achievements :
Attended OSI days Nov 20-22,2011 - Asia's mega convention on free and open source.
Technical Head of IT Association at School of Engineering, cusat .
Event coordinator and attendee of Ethical Hacking Workshop by Ankit Fadia ,1st oct 2011. Participated in hands on Ethical Hacking Workshop , IIT Bombay -By Sunny Vaghela from TECH DEFENSE in 2010 .
Scored 92 %ile in eLitmus PH test (Top 8% of the appeared students in the aptitude test).
Active member of AISEC Kochi. Participated in the event balkalakaar.
Attended Yahoo Open Hack India 2011, Banglore - tech talk by Yahoo developers .
Attended a webinar on Linux by IIT Bombay -2011.
Volunteer in DHISHNA 2011(events Code Esperto –Algo design and Tux Pain–Linux debugging).Active participation in IT-TUDE-2009 and Xplendor-2010 .
Winner in volleyball,football,runner-up cricket ,chess,2nd runner up table tennis at high school.
_________________________________________________________________________________________________
Personal Details :
Likes : browsing,playing volleyball,playing chess.
Job offer from TCS , CTC -3.16
Expected CTC > 5 lpa
- 0of 0 votes
AnswersI have a linked list .The first half that is the left side is sorted and the 2nd half -right side is sorted independently.How do I sort them in with out using seperate linked list .I need an efficient solution
- Anonymous in United States| Report Duplicate | Flag | PURGE
Algorithm - -1of 1 vote
Answers/*
- Anonymous in India
Question 2 / 36 (FizzBuzz)
Write a program which prints the numbers from 1 to N, each on a new line. But for multiples of three print “Fizz” instead of the number 3 and for the multiples of five print “Buzz”. For numbers which are multiples of both three and five print “FizzBuzz”. Read in the input number from STDIN.
Sample Input #00:
15
Sample Output #00 :
1
2
Fizz
4
Buzz
Fizz
7
8
Fizz
Buzz
11
Fizz
13
14
FizzBuzz
Explanation:
Position 3,6,9,12 have the word "Fizz" because they are multiples of 3.
Positions 5 and 10 have the word "Buzz" because they are multiples of 5.
Position 15 has the word FizzBuzz because it is a multiple of both 3 and 5.
*/
import java.io.*;
class Solution {
public static void main(String args[] ) throws Exception {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the value of N");
int N=Integer.parseInt(br.readLine());
Solution objSolution=new Solution();
objSolution.fizzBuzz(N);
}
public static void fizzBuzz(int N) throws IOException
{
for(int i=0;i<=N;i++)
{
if((i%5==0)&&(i%3==0))
{
System.out.println("fizzBuzz");
}
else
{
if((i%3)==0)
{
System.out.println("Fizz");
}
if((i%5)==0)
{
System.out.println("Buzz");
}
if((i%3!=0)&&(i%5!=0))
{
System.out.println(i);
}
}
}
}
}
----------------------------------------
What is the complexity of this algorithm ?
Is there any solution with better efficiency ?| Report Duplicate | Flag | PURGE
Amazon SDE1
import java.io.*;
class microsoftQ
{
public static void main(String args[]) throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the number ");
int i=Integer.parseInt(br.readLine());
int d=i/26;
int mod=i%26;
int l=d-1;
String s=" ";
int c=0;
while(c<=l)
{
s+="a";
c++;
}
switch(mod)
{
case 1:s+="a";
break;
case 2:s+="b";
break;
case 3:s+="c";
break;
case 4:s+="d";
break;
case 5:s+="e";
break;
case 6:s+="f";
break;
case 7:s+="g";
break;
case 8:s+="h";
break;
case 9:s+="i";
break;
case 10:s+="j";
break;
case 11:s+="k";
break;
case 12:s+="l";
break;
case 13:s+="m";
break;
case 14:s+="n";
break;
case 15:s+="o";
break;
case 16:s+="p";
break;
case 17:s+="q";
break;
case 18:s+="r";
break;
case 19:s+="s";
break;
case 20:s+="t";
break;
case 21:s+="u";
break;
case 22:s+="v";
break;
case 23:s+="w";
break;
case 24:s+="x";
break;
case 25:s+="y";
break;
case 26:s+="z";
break;
}
System.out.println("the string to be printed is "+s);
}
}
Is there any efficient solution than n-sqaure ??? ??
- Anonymous December 07, 2013I've this code here which works for me :
import java.io.*;
import java.lang.*;
import java.util.ArrayList;
class Solution {
public static void main(String args[] ) throws Exception {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
Solution objSolution=new Solution();
int N,K;
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the value of n -number of inputs");
N=Integer.parseInt(br.readLine());
int arrayOfNumbers[]=new int[N];
System.out.println("Enter the value of k- the difference");
K=Integer.parseInt(br.readLine());
objSolution.inputNumbers(arrayOfNumbers);
System.out.println("The size of array is "+N);
for(int i=0;i<N;i++)
{
System.out.println(arrayOfNumbers[i]);
}
objSolution.calculateDifference(arrayOfNumbers,N,K);
}
public static void inputNumbers(int arrayOfNumbers[])throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int lengthOfArray=arrayOfNumbers.length;
System.out.println("The length of the array is "+lengthOfArray);
for(int i=0;i<lengthOfArray;i++)
{
System.out.println("Enter another integers for the list");
arrayOfNumbers[i]=Integer.parseInt(br.readLine());
}
}
public static void calculateDifference(int arrayOfNumbers[],int N,int K) throws IOException
{
int count=0;
for(int i=0;i<N;i++)
{
for(int j=i+1;j<N;j++)
if((arrayOfNumbers[i]-arrayOfNumbers[j]==K)||(arrayOfNumbers[j]-arrayOfNumbers[i]==K))
{
count++;
}
}
System.out.println("The number of such pairs found is "+count);
}
}