getjar.com/todotasklist my android app
BAN USERI am a person with balanced personality, hard working, positive attitude, optimist.
KAMLESH KUMAR YADAV Contact Details:
Mo Nawagarhi, Bahraich
Uttar Pradesh -271801
E-Mail:kamleshlu2009@gmail.com
Contact No: +91 9718202184
Career Objective :
To attain a position in the Industry by excelling Analytical, Technical, Managerial and
Interpersonal skills.
Educational Qualification
• MCA (Master of Computer Application) Department of Computer Science
University of Delhi 72.2% Year 2009-12
• BCA(Bachelor of Computer Application) Department of Computer Science
University of Lucknow 66.2% Year : 2006-09
• 10+2 CBSE 76.8% Year 2006
• 10th CBSE 87.4% Year 2004 (Topped in School)
Software Proficiency:
• Languages : C, C++, Java ( Core) with Data Structures
• Software Packages : Netbeans, Eclipse, Dev C++
• DBMS Packages : Oracle 10 g
• Operating Systems : Windows(XP,Vista,7), Linux
Academic Projects :
• Design and Analysis of a new technique for Searching on Encrypted data :
Designed a new technique using Bloom Filter for Searching on Encrypted data and reduced the complexity from O(N) to constant order.(Individual project)
(Language Used : Java Encryption Technique : AES with 128 bit key )
• Simulation of the Unix Shell in C : (Individual Project)
• Implementation of Chat Server in JAVA. (Group project)
• Implementation of a two pass assembler in C: (Group Project)
• Implementation of UNIX File System in C++. (Group project)
Independent Projects:
• Implementation of Malloc, Calloc and Free functions in C.
• Implementation of Producer Consumer Problem in C++.
Technical Papers/Posters :
• Presented poster on “Social Network Analysis” at IBM Research Center New Delhi
on 26 October 2009 .
• Technical Research Paper entitled “Searching on Encrypted Data Using Bloom Filter ”
accepted by IBM Research India and also presented poster at IBM Research
Center Banglore on 22 October 2010 .
Awards and Achievements :
Special Achievement : Awarded by “Best C++ Programmer” by Bharti Vidyapeeth University Delhi.
• Figured in the top ten in Long Term Programming(LTP) contest organized by
IIT Roorkee.
• 1st prize : JAVA programming in TECHNOPHILIA 2011, the Annual Technical Fest at Jawahar Lal Nehru University Delhi.
• 1st Prize : Blind Coding(C/C++ Programming) in TECHNOPHILIA 2011, the Annual Technical Fest at Jawahar Lal Nehru University Delhi.
• 1st prize: On The spot Programming in NERDZ 2011, the Annual Technical Fest of Jamia Humderd University Delhi .
• 1st prize: Dark Coding(C/C++) in NERDZ 2011, the Annual Technical Fest of Jamia Humderd University Delhi .
• 1st prize : C/C++ programming in TATVA 2011 the annual IT Fest of Lal Bahadur Shastri Institute of Technology, IP University ,Delhi.
• 1st prize : C/C++ programming in ASC 2011 the IT Fest of Bharti Vidyapeeth.
• 1st prize : C/C++ programming in ASC 2010 the IT Fest of Bharti Vidyapeeth.
• 2nd Prize : JAVA Programming in NERDZ 2009, at Jamia Humderd University.
.
Leadership Skills And Extra Curricular Activities:
• Placement Coordinator, currently taking charge as “Placement Coordinator” of
Department of Computer Science, University of Delhi.
• School Captain , Jawahar Navodaya Vidyalaya Bahraich ,while in Class 12th and also
awarded by “Next Generation Leader” award for excellent work as School captain.
• Head Coordinator , Technical Activities of Department of Computer Science,University
of Lucknow during 3rd year of graduation.
• Team Leader of a team of 7 people who won 1st Rank during 2 days of Technical Fest
at Jawahar Lal Nehru University and 2nd RANK at Jamia Humderd University.
• Team Leader of the team who Coordinated “JAVA Programming” and “C/C++
Programming” event in Sankalan 2011, the Annual Technical Fest of Delhi University.
- 0of 0 votes
Answersgiven a NxM matrix , where each array entry is a character, we need to find all the valid words that can be formed using elements in a row, column and diagonal. like crosswords puzzle.
- getjar.com/todotasklist my android app in India
We are given a dictionary and a function
boolean isValid(String word)
which returns whether the word passes to this function is valid dictionary word or not.| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
Answersgiven an integer find the next(smallest number greater than given number) integer which is palendrom
- getjar.com/todotasklist my android app in India
for ex 111 next palendrom 121
301 next palendrom 313| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm - 0of 0 votes
Answersgiven a village with demons and a sleeping man, The man is always sleeping ,never wakes up. Now a demon can eat the sleeping man , but after that
- getjar.com/todotasklist my android app in -
he will fall asleep , any demon can eat another sleeping demon.
If demons are very smart and would always choose to stay alive than to eat the man and risk their lives.
so if initially there are 65 demons and 1 sleeping man ,, what would happen in the village ???| Report Duplicate | Flag | PURGE
Brain Teasers - 0of 0 votes
AnswersGiven a sorted array of Infinite size, find an element ‘K’ in the array without using extra memory in O (lgn) time. (Remember the array size is infinite that is no upper bound
- getjar.com/todotasklist my android app in India| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm - 0of 0 votes
AnswersA person can climb stairs in 3 ways: Either a single stair at a time or 2 steps together or 3 steps at a time. So, if you have total N stairs give a recurrence relation to solve the above proble
- getjar.com/todotasklist my android app in -| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm - 0of 0 votes
Answershow compiler generates unique names for overloaded functions, if two functions have same name and same parameters but differnt return type , can it be possible i said no he asked why . i explained about the name mangling and showed that return type does not play any role in name mangling.
- getjar.com/todotasklist my android app in -| Report Duplicate | Flag | PURGE
Samsung Software Engineer / Developer C++ - 0of 0 votes
Answersgiven a expresion
- getjar.com/todotasklist my android app in India
2*3+5-3 it consisitof 3 opertors(+,-,*),but they can occur more than time.
we have to maximise the vlaue of expression by adding parathesis
like 2*3+5-3=8 no paranthesis
2*(3+5)-3=13
2*(3+5-3)=10
and so on maximise it with differnt possible parathesis| Report Duplicate | Flag | PURGE
Microsoft Software Engineer / Developer - 0of 0 votes
Answersan interseting problem
- getjar.com/todotasklist my android app in -
for a fibonacci series
the recurrence relation is
t(n)=t(n-1)+t(n-2)+O(1)
on solving it gives upper bound of O(n^2)
but when draw tree for the recurcsion we see that it is growing exponentially giving a complexity of O(2^n).
so what is the complexity for fibonaacci series n^2 or 2^n| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm - 0of 0 votes
Answersgiven a set of integers [6,8,41,36,58,69]
- getjar.com/todotasklist my android app in -
is there any way with time complexity better than 2^n to find 1 subset whose sum is equal to a given sum.
for eg:sum 49 ans 8,41
sum 105 ans 6 ,41 58| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
Answersgiven two arrays [5 6 2 8 1] or [4 7 9 2 4]...such arrays are given, you have to find
- getjar.com/todotasklist my android app in -
possible pairs where sum of numbers in both arrays of a pair is equal....eg
for the first case it will be [5 6] and [2 8 1]
write a program to implement this| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm - 0of 0 votes
Answersgiven a matrix with all 1,s or 0,s. find the square sunmatrix with all 1's at border.
- getjar.com/todotasklist my android app
ex:
0 1 0 1 0 1 1 1
0 1 1 1 1 1 1 0
1 1 0 1 1 0 1 1
0 1 0 0 1 0 1 0
0 1 1 1 1 1 1 1
so the submatrix from (1,1)to (4,6) is the answer
see it is not square but i have just wriiten to make it clear the ques .
given matrix will bee square matrix and we have find square submatrix as well| Report Duplicate | Flag | PURGE
Software Engineer / Developer - 0of 0 votes
AnswersThere is an array and the distance between any two consequent elements is one(+1 or -1) and given a number. You have to check whether the number is in array or not with minimum complexity.
- getjar.com/todotasklist my android app| Report Duplicate | Flag | PURGE
Software Engineer / Developer - 0of 0 votes
Answersgiven an infinite array containing only 0's and 1's in sorted manner. Give algo to find the position where first 1 appeared with minimum complexity (Interviewer gave hint to use random number generator algo, don't know why).
- getjar.com/todotasklist my android app| Report Duplicate | Flag | PURGE
Software Engineer / Developer Algorithm
- 1 Answer need advice i am a fresher. ...
need advice
- getjar.com/todotasklist my android app September 15, 2011
i am a fresher.
in interview if we get a question which i already know what should i do.
should i tell that i know the question or i have already solved.
the problem is the person who is regularly visting careercup may get many questions that r reapeated so to do there.
experinced people pls answer pls answer| Flag | PURGE
here is the generic solution works for all buckets
#include <cstdlib>
#include <iostream>
using namespace std;
int ways;
void fill(int b[],int n,int sum,int toFill,int filled[],int index)
{
if(sum==toFill)
{
ways++;
cout<<"\n";
for(int i=0;i<index;i++)
cout<<filled[i]<<" ";
return;
}
if(index<n)
{
for(int i=0;i<=b[index];i++)
{
filled[index]=i;
fill(b,n,sum+i,toFill,filled,index+1);
}
}
}
int main(int argc, char *argv[])
{
int b[]={2,3,2};
int filled[3];
fill(b,3,0,4,filled,0);
cout<<"Total Number Of ways :"<<ways;
system("PAUSE");
return EXIT_SUCCESS;
}
O(N^2) solution is possible
- getjar.com/todotasklist my android app October 06, 2011nice thing u pointed out
it requires an array of 2^59 size which may not be posssible.
so how it is possible in o(N) can any body tell
i dont know why these r more interested in knowing that ques is homework or something else rather than posting the solving them.
- getjar.com/todotasklist my android app September 15, 2011i dont know why these r more interested in asking in knowing that ques is homework or something else rather than posting the solving them.
- getjar.com/todotasklist my android app September 15, 2011fine it is possible in order n i know
but when we make tree it grows exponentially in (recursion tree)
can be done in constant space but time complexity will be greater than O(n).
- getjar.com/todotasklist my android app September 14, 2011tries can be used .
if hashtables are used then we cant search part or illegel word.
for ex. "program" is a complete word.
if we search for "prog" which is not legal so it will say " word does not exist"
but if we use tries we can show the most similar word and also show some suggetions for the word.
pls correct me if i m wrong.
improved binary search dear
- getjar.com/todotasklist my android app September 13, 2011what is the complexity? is it better than O(N*M) ?
N number of words in file.
M length of word to be searched.
please explain
what answer u given
- getjar.com/todotasklist my android app September 13, 2011what answer u given
- getjar.com/todotasklist my android app September 13, 2011@ guest123
can u elaborate ur answer , at least give ur approach when answering a question
@ guest123
can u elaborate ur answer , at least give ur approach when answering a question
amazon
- getjar.com/todotasklist my android app August 29, 2011yes i think
- getjar.com/todotasklist my android app August 29, 2011sorry for n/4 sol is wrong
req number can be in between the intervals
consider an array of 16 elements
for n/2 elemnt will appear more than 8 times
sort the array mid index will contain the requiored elemnt
for n/4 after sorting required number will be at
(0 and 4 both) or
(4 and 8 both) or
(8 and 12) check in interval of 4
+1 to rockshan
- getjar.com/todotasklist my android app August 25, 2011
Reprichardcstrong, Accountant at AppPerfect
I am a modern magician, except I transform complicated technical ideas into user-friendly images before the eyes of your company ...
RepMarryJohan, Consultant at ASAPInfosystemsPvtLtd
I am successfully manage and coordinate graphic design projects from concept through completion. Create and conduct highly persuasive sales and ...
Repkalerkant98, abc at ADP
I am DennisRue, seeking an entry level position where my strong work ethics and ability to learn quickly will contribute ...
Repmariacbrister, Graphics Programmer at Graphic Systems
Hey, I am Maria and I am from Bluefield. Currently, I work as a freelancer graphic artist. From an early ...
RepMariaHobbs, Consultant at Adobe
Hi, I am Maria Hobbs from NewYork.Teach career development courses for designated areas. Develop, evaluate and revise course materials ...
Repashleymbosse, Associate at Accenture
I am an enthusiastic, hard-working and disciplined Catering Assistant with excellent track-record in working in the food industry. I am ...
is the person sent u the questions.
- getjar.com/todotasklist my android app October 22, 2011