Browse For Jobs: 2011

Saturday 29 January 2011

2010 Passed out B.E, B.Tech, ME, M.Tech specializing in CSE, IT, ECE, EEE, EIE only with 70% and above (aggregate) academics (10th, 12th & Degree).

Candidates should be open to relocate to Bangalore, Hyderabad or Madurai .

Requirement – Engineer Trainee -Selected candidates will go through 5 months of comprehensive training at Madurai.

Selection Procedure - Written Test on 30th Jan , Technical Interviews , Group Discussion and HR Interview

Candidates are required to carry with them copy of their Resume, Certificates and any Identification proof

•Date: Sunday - January 30, 2011

•Time – 9:00 AM

Venue: Mother Earth Building, Honeywell, Bannerghatta Road, Bangalore

Thursday 27 January 2011

Shell Infotech

Shell Infotech is pleased to inform you regarding a career opportunity with one of our client. Please find the following details regarding the opening and kindly forward your updated profile as soon as possible.

Dotnet Professionals

Mandatory: dotnet. Framework 3.5/4.0 is must

Preffered: wcf,wpf,linq,silverlight

Location: Hyderabad

Please provide us the following details:

1. Current Organization:
2. Total Exp:
3.Relevant Exp:
4. Current CTC:
5. Expected CTC:
6. Notice Period:
7. Reason for change:
8.date of Birth:
9.Full Name:
10:Will you able to join within 10 days:

Please forward your updated profile as soon as possible and kindly forward this mail to your friends/Colleagues who are looking for similar opening.
Looking forward to be a part of your career progress.

Regards
Mukesh
Sr Recruiter
Hyderabad.
040-66414348

Wednesday 19 January 2011

140 Google Interview Questions

Here's a list of 140 Google interview questions.

Link to Google interview questions for:

Product Marketing Manager

Product Manager

Software Engineer

Software Engineer in Test

Quantitative Compensation Analyst

Engineering Manager

AdWords Associate

Google Interview Questions: Product Marketing Manager

Why do you want to join Google?
What do you know about Google's product and technology?
If you are Product Manager for Google's Adwords, how do you plan to market this?
What would you say during an AdWords or AdSense product seminar?
Who are Google's competitors, and how does Google compete with them?
Have you ever used Google's products? Gmail?
What's a creative way of marketing Google's brand name and product?
If you are the product marketing manager for Google's Gmail product, how do you plan to market it so as to achieve 100 million customers in 6 months?
How much money you think Google makes daily from Gmail ads?
Name a piece of technology you’ve read about recently. Now tell me your own creative execution for an ad for that product.
Say an advertiser makes $0.10 every time someone clicks on their ad. Only 20% of people who visit the site click on their ad. How many people need to visit the site for the advertiser to make $20?
Estimate the number of students who are college seniors, attend four-year schools, and graduate with a job in the United States every year.

Google Interview Questions: Product Manager

How would you boost the GMail subscription base?
What is the most efficient way to sort a million integers?
How would you re-position Google's offerings to counteract competitive threats from Microsoft?
How many golf balls can fit in a school bus?
You are shrunk to the height of a nickel and your mass is proportionally reduced so as to maintain your original density. You are then thrown into an empty glass blender. The blades will start moving in 60 seconds. What do you do?
How much should you charge to wash all the windows in Seattle?
How would you find out if a machine’s stack grows up or down in memory?
Explain a database in three sentences to your eight-year-old nephew.
How many times a day does a clock’s hands overlap?
You have to get from point A to point B. You don’t know if you can get there. What would you do?
Imagine you have a closet full of shirts. It’s very hard to find a shirt. So what can you do to organize your shirts for easy retrieval?
Every man in a village of 100 married couples has cheated on his wife. Every wife in the village instantly knows when a man other than her husband has cheated, but does not know when her own husband has. The village has a law that does not allow for adultery. Any wife who can prove that her husband is unfaithful must kill him that very day. The women of the village would never disobey this law. One day, the queen of the village visits and announces that at least one husband has been unfaithful. What happens?
In a country in which people only want boys, every family continues to have children until they have a boy. If they have a girl, they have another child. If they have a boy, they stop. What is the proportion of boys to girls in the country?
If the probability of observing a car in 30 minutes on a highway is 0.95, what is the probability of observing a car in 10 minutes (assuming constant default probability)?
If you look at a clock and the time is 3:15, what is the angle between the hour and the minute hands? (The answer to this is not zero!)
Four people need to cross a rickety rope bridge to get back to their camp at night. Unfortunately, they only have one flashlight and it only has enough light left for seventeen minutes. The bridge is too dangerous to cross without a flashlight, and it's only strong enough to support two people at any given time. Each of the campers walks at a different speed. One can cross the bridge in 1 minute, another in 2 minutes, the third in 5 minutes, and the slow poke takes 10 minutes to cross. How do the campers make it across in 17 minutes?
You are at a party with a friend and 10 people are present including you and the friend. your friend makes you a wager that for every person you find that has the same birthday as you, you get $1; for every person he finds that does not have the same birthday as you, he gets $2. would you accept the wager?
How many piano tuners are there in the entire world?
You have eight balls all of the same size. 7 of them weigh the same, and one of them weighs slightly more. How can you find the ball that is heavier by using a balance and only two weighings?
You have five pirates, ranked from 5 to 1 in descending order. The top pirate has the right to propose how 100 gold coins should be divided among them. But the others get to vote on his plan, and if fewer than half agree with him, he gets killed. How should he allocate the gold in order to maximize his share but live to enjoy it? (Hint: One pirate ends up with 98 percent of the gold.)
You are given 2 eggs. You have access to a 100-story building. Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100th floor. Both eggs are identical. You need to figure out the highest floor of a 100-story building an egg can be dropped without breaking. The question is how many drops you need to make. You are allowed to break 2 eggs in the process.
Describe a technical problem you had and how you solved it.
How would you design a simple search engine?
Design an evacuation plan for San Francisco.
There's a latency problem in South Africa. Diagnose it.
What are three long term challenges facing Google?
Name three non-Google websites that you visit often and like. What do you like about the user interface and design? Choose one of the three sites and comment on what new feature or project you would work on. How would you design it?
If there is only one elevator in the building, how would you change the design? How about if there are only two elevators in the building?
How many vacuum’s are made per year in USA?

Google Interview Questions: Software Engineer

Why are manhole covers round?
What is the difference between a mutex and a semaphore? Which one would you use to protect access to an increment operation?
A man pushed his car to a hotel and lost his fortune. What happened?
Explain the significance of "dead beef".
Write a C program which measures the the speed of a context switch on a UNIX/Linux system.
Given a function which produces a random integer in the range 1 to 5, write a function which produces a random integer in the range 1 to 7.
Describe the algorithm for a depth-first graph traversal.
Design a class library for writing card games.
You need to check that your friend, Bob, has your correct phone number, but you cannot ask him directly. You must write a the question on a card which and give it to Eve who will take the card to Bob and return the answer to you. What must you write on the card, besides the question, to ensure Bob can encode the message so that Eve cannot read your phone number?
How are cookies passed in the HTTP protocol?
Design the SQL database tables for a car rental database.
Write a regular expression which matches a email address.
Write a function f(a, b) which takes two character string arguments and returns a string containing only the characters found in both strings in the order of a. Write a version which is order N-squared and one which is order N.
You are given a the source to a application which is crashing when run. After running it 10 times in a debugger, you find it never crashes in the same place. The application is single threaded, and uses only the C standard library. What programming errors could be causing this crash? How would you test each one?
Explain how congestion control works in the TCP protocol.
In Java, what is the difference between final, finally, and finalize?
What is multithreaded programming? What is a deadlock?
Write a function (with helper functions if needed) called to Excel that takes an excel column value (A,B,C,D…AA,AB,AC,… AAA..) and returns a corresponding integer value (A=1,B=2,… AA=26..).
You have a stream of infinite queries (ie: real time Google search queries that people are entering). Describe how you would go about finding a good estimate of 1000 samples from this never ending set of data and then write code for it.
Tree search algorithms. Write BFS and DFS code, explain run time and space requirements. Modify the code to handle trees with weighted edges and loops with BFS and DFS, make the code print out path to goal state.
You are given a list of numbers. When you reach the end of the list you will come back to the beginning of the list (a circular list). Write the most efficient algorithm to find the minimum # in this list. Find any given # in the list. The numbers in the list are always increasing but you don’t know where the circular list begins, ie: 38, 40, 55, 89, 6, 13, 20, 23, 36.
Describe the data structure that is used to manage memory. (stack)
What's the difference between local and global variables?
If you have 1 million integers, how would you sort them efficiently? (modify a specific sorting algorithm to solve this)
In Java, what is the difference between static, final, and const. (if you don't know Java they will ask something similar for C or C++).
Talk about your class projects or work projects (pick something easy)… then describe how you could make them more efficient (in terms of algorithms).
Suppose you have an NxN matrix of positive and negative integers. Write some code that finds the sub-matrix with the maximum sum of its elements.
Write some code to reverse a string.
Implement division (without using the divide operator, obviously).
Write some code to find all permutations of the letters in a particular string.
What method would you use to look up a word in a dictionary?
Imagine you have a closet full of shirts. It’s very hard to find a shirt. So what can you do to organize your shirts for easy retrieval?
You have eight balls all of the same size. 7 of them weigh the same, and one of them weighs slightly more. How can you fine the ball that is heavier by using a balance and only two weighings?
What is the C-language command for opening a connection with a foreign host over the internet?
Design and describe a system/application that will most efficiently produce a report of the top 1 million Google search requests. These are the particulars: 1) You are given 12 servers to work with. They are all dual-processor machines with 4Gb of RAM, 4x400GB hard drives and networked together.(Basically, nothing more than high-end PC’s) 2) The log data has already been cleaned for you. It consists of 100 Billion log lines, broken down into 12 320 GB files of 40-byte search terms per line. 3) You can use only custom written applications or available free open-source software.
There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. For example Output[0] will be multiplication of A[1] to A[N-1] and Output[1] will be multiplication of A[0] and from A[2] to A[N-1]. Solve it without division operator and in O(n).
There is a linked list of numbers of length N. N is very large and you don’t know N. You have to write a function that will return k random numbers from the list. Numbers should be completely random. Hint: 1. Use random function rand() (returns a number between 0 and 1) and irand() (return either 0 or 1) 2. It should be done in O(n).
Find or determine non existence of a number in a sorted list of N numbers where the numbers range over M, M>> N and N large enough to span multiple disks. Algorithm to beat O(log n) bonus points for constant time algorithm.
You are given a game of Tic Tac Toe. You have to write a function in which you pass the whole game and name of a player. The function will return whether the player has won the game or not. First you to decide which data structure you will use for the game. You need to tell the algorithm first and then need to write the code. Note: Some position may be blank in the game। So your data structure should consider this condition also.
You are given an array [a1 To an] and we have to construct another array [b1 To bn] where bi = a1*a2*...*an/ai. you are allowed to use only constant space and the time complexity is O(n). No divisions are allowed.
How do you put a Binary Search Tree in an array in a efficient manner. Hint :: If the node is stored at the ith position and its children are at 2i and 2i+1(I mean level order wise)Its not the most efficient way.
How do you find out the fifth maximum element in an Binary Search Tree in efficient manner. Note: You should not use use any extra space. i.e sorting Binary Search Tree and storing the results in an array and listing out the fifth element.
Given a Data Structure having first n integers and next n chars. A = i1 i2 i3 ... iN c1 c2 c3 ... cN.Write an in-place algorithm to rearrange the elements of the array ass A = i1 c1 i2 c2 ... in cn
Given two sequences of items, find the items whose absolute number increases or decreases the most when comparing one sequence with the other by reading the sequence only once.
Given That One of the strings is very very long , and the other one could be of various sizes. Windowing will result in O(N+M) solution but could it be better? May be NlogM or even better?
How many lines can be drawn in a 2D plane such that they are equidistant from 3 non-collinear points?
Let's say you have to construct Google maps from scratch and guide a person standing on Gateway of India (Mumbai) to India Gate(Delhi). How do you do the same?
Given that you have one string of length N and M small strings of length L. How do you efficiently find the occurrence of each small string in the larger one?
Given a binary tree, programmatically you need to prove it is a binary search tree.
You are given a small sorted list of numbers, and a very very long sorted list of numbers - so long that it had to be put on a disk in different blocks. How would you find those short list numbers in the bigger one?
Suppose you have given N companies, and we want to eventually merge them into one big company. How many ways are theres to merge?
Given a file of 4 billion 32-bit integers, how to find one that appears at least twice?
Write a program for displaying the ten most frequent words in a file such that your program should be efficient in all complexity measures.
Design a stack. We want to push, pop, and also, retrieve the minimum element in constant time.
Given a set of coin denominators, find the minimum number of coins to give a certain amount of change.
Given an array, i) find the longest continuous increasing subsequence. ii) find the longest increasing subsequence.
Suppose we have N companies, and we want to eventually merge them into one big company. How many ways are there to merge?
Write a function to find the middle node of a single link list.
Given two binary trees, write a compare function to check if they are equal or not. Being equal means that they have the same value and same structure.
Implement put/get methods of a fixed size cache with LRU replacement algorithm.
You are given with three sorted arrays ( in ascending order), you are required to find a triplet ( one element from each array) such that distance is minimum.
Distance is defined like this : If a[i], b[j] and c[k] are three elements then distance=max(abs(a[i]-b[j]),abs(a[i]-c[k]),abs(b[j]-c[k]))" Please give a solution in O(n) time complexity
How does C++ deal with constructors and deconstructors of a class and its child class?
Write a function that flips the bits inside a byte (either in C++ or Java). Write an algorithm that take a list of n words, and an integer m, and retrieves the mth most frequent word in that list.
What's 2 to the power of 64?
Given that you have one string of length N and M small strings of length L. How do you efficiently find the occurrence of each small string in the larger one?
How do you find out the fifth maximum element in an Binary Search Tree in efficient manner.
Suppose we have N companies, and we want to eventually merge them into one big company. How many ways are there to merge?
There is linked list of millions of node and you do not know the length of it. Write a function which will return a random number from the list.
You need to check that your friend, Bob, has your correct phone number, but you cannot ask him directly. You must write a the question on a card which and give it to Eve who will take the card to Bob and return the answer to you. What must you write on the card, besides the question, to ensure Bob can encode the message so that Eve cannot read your phone number?
How long it would take to sort 1 trillion numbers? Come up with a good estimate.
Order the functions in order of their asymptotic performance: 1) 2^n 2) n^100 3) n! 4) n^n
There are some data represented by(x,y,z). Now we want to find the Kth least data. We say (x1, y1, z1) > (x2, y2, z2) when value(x1, y1, z1) > value(x2, y2, z2) where value(x,y,z) = (2^x)*(3^y)*(5^z). Now we can not get it by calculating value(x,y,z) or through other indirect calculations as lg(value(x,y,z)). How to solve it?
How many degrees are there in the angle between the hour and minute hands of a clock when the time is a quarter past three?
Given an array whose elements are sorted, return the index of a the first occurrence of a specific integer. Do this in sub-linear time. I.e. do not just go through each element searching for that element.
Given two linked lists, return the intersection of the two lists: i.e. return a list containing only the elements that occur in both of the input lists.
What's the difference between a hashtable and a hashmap?
If a person dials a sequence of numbers on the telephone, what possible words/strings can be formed from the letters associated with those numbers?
How would you reverse the image on an n by n matrix where each pixel is represented by a bit?
Create a fast cached storage mechanism that, given a limitation on the amount of cache memory, will ensure that only the least recently used items are discarded when the cache memory is reached when inserting a new item. It supports 2 functions: String get(T t) and void put(String k, T t).
Create a cost model that allows Google to make purchasing decisions on to compare the cost of purchasing more RAM memory for their servers vs. buying more disk space.
Design an algorithm to play a game of Frogger and then code the solution. The object of the game is to direct a frog to avoid cars while crossing a busy road. You may represent a road lane via an array. Generalize the solution for an N-lane road.
What sort would you use if you had a large data set on disk and a small amount of ram to work with?
What sort would you use if you required tight max time bounds and wanted highly regular performance.
How would you store 1 million phone numbers?
Design a 2D dungeon crawling game. It must allow for various items in the maze - walls, objects, and computer-controlled characters. (The focus was on the class structures, and how to optimize the experience for the user as s/he travels through the dungeon.)
What is the size of the C structure below on a 32-bit system? On a 64-bit?

struct foo {

char a;

char* b;

};

Google Interview: Software Engineer in Test

Efficiently implement 3 stacks in a single array.
Given an array of integers which is circularly sorted, how do you find a given integer.
Write a program to find depth of binary search tree without using recursion.
Find the maximum rectangle (in terms of area) under a histogram in linear time.
Most phones now have full keyboards. Before there there three letters mapped to a number button. Describe how you would go about implementing spelling and word suggestions as people type.
Describe recursive mergesort and its runtime. Write an iterative version in C++/Java/Python.
How would you determine if someone has won a game of tic-tac-toe on a board of any size?
Given an array of numbers, replace each number with the product of all the numbers in the array except the number itself *without* using division.
Create a cache with fast look up that only stores the N most recently accessed items.
How to design a search engine? If each document contains a set of keywords, and is associated with a numeric attribute, how to build indices?
Given two files that has list of words (one per line), write a program to show the intersection.
What kind of data structure would you use to index annagrams of words? e.g. if there exists the word "top" in the database, the query for "pot" should list that.

Google Interview: Quantitative Compensation Analyst

What is the yearly standard deviation of a stock given the monthly standard deviation?
How many resumes does Google receive each year for software engineering?
Anywhere in the world, where would you open up a new Google office and how would you figure out compensation for all the employees at this new office?
What is the probability of breaking a stick into 3 pieces and forming a triangle?

Google Interview: Engineering Manager

You're the captain of a pirate ship, and your crew gets to vote on how the gold is divided up. If fewer than half of the pirates agree with you, you die. How do you recommend apportioning the gold in such a way that you get a good share of the booty, but still survive?

Google Interview: AdWords Associate

How would you work with an advertiser who was not seeing the benefits of the AdWords relationship due to poor conversions?
How would you deal with an angry or frustrated advertisers on the phone?

Sources

http://news.ycombinator.com/item?id=266663

http://tihomir.org/crazy-questions-at-google-job-interview/

http://www.drizzle.com/~jpaint/google.html

http://www.gamedev.net/community/forums/topic.asp?topic_id=299692http://careers.cse.sc.edu/googleinterview

http://job-interview.blogspot.com/2005/02/google-interview-product-marketing.html

http://www.theregister.co.uk/2007/01/05/google_interview_tales/

http://money.cnn.com/2007/08/29/technology/brain_teasers.biz2/index.htm

http://blogs.lessthandot.com/index.php/ITProfessionals/EthicsIT/google-interview-questions

http://placementsindia.blogspot.com/2007/09/google-top-interview-puzzles.html

http://linkmingle.com/user/interview_questions/google_interview_questions

http://discuss.joelonsoftware.com/default.asp?interview.11.626758.33

http://mindcipher.com/puzzle/78-clock-works

http://www.glassdoor.com

http://bluepixel.ca/blog/?p=69

http://www.businessinsider.com/my-nightmare-interviews-with-google-2009-11

Tuesday 11 January 2011

FRESHERS JOBS @ PYRAMID IT : Trainee Testing/ Software : Hyderabad/Noida

Company	:	PYRAMID IT
Job Location	:	Hyderabad/Noida
Job Description	:	Pyramid IT Consulting Trainee Testing/ Software Job Description : Required Trainee for Software Development Team. B.Tech/ B.E. (Mandatory) Good Technical Knowledge Excellent Communication skills. Desired Profile : Software Testing for In house Software Team. Contact Details : Company : Pyramid IT Consulting Email : shikha.bajaj(at)pyramidci.com, opportunities(at)pyramidconsultinginc.com

FRESHERS JOBS @ SWASTHIK SAHITS : Java Programmer : Chennai

Company	:	SWASTHIK SAHITS
Job Location	:	Chennai
Job Description	:	Swasthik Sahits Java Programmer - ( Freshers ) Experience: 0 - 1 Years Compensation: Salary is not a constraint for the right candidate Job Description : -Should have at least 6 months in the relevant field or should have completed any Java certified courses. -Good knowledge in Java, J2EE, Core Java Desired Profile : - Should have Excellent Communication skills - Any Technical Degree - Good Typing skills ( up to 20 wpm) Contact Details : Name: Prabhu A Swasthik Sahits Solutions Pvt. Ltd. Email : career(at)swasthiksahits.com

FRESHERS JOBS @ GENIUSPORT : BE/BTech/MTech/MCA : iPhone/Android Developer : Bangalore

Company	:	GENIUSPORT
Job Location	:	Bangalore
Job Description	:	GeniusPort iPhone/Android Developer Experience: 0 - 2 Years Compensation: Rupees 2,00,000 - 4,00,000 Job Description : We need bright freshers for Mobile developers requirement. Shortlisted candidates will under go a paid training and internship on iPhone/ Android. In this job guaranteed program candidates need to meet criteria followed by Aptitude, C, C++ test Desired Profile : 1. B.E/ B.Tech/ M.Tech/ MCA from 2009/2010/2011. 2. Strong C, C++ and OOPS Concepts. 3. Need to clear Logical reasoning/Aptitude, C, C++ Test. 4. Good Communication Skills and Team Player. 5. Willing to learn next generation technologies. Contact Details : Company : GeniusPort Email : hr(at)geniusport.com

FRESHERS JOBS @ DISK DOCTOR LABS : Search Engine Optimization Executive & Trainee :

Company	:	DISK DOCTOR LABS
Job Location	:	Bangalore
Job Description	:	Disk Doctor Labs Inc. Fresher SEO/Search Engine Optimization Executive & Trainee/Bangalore Experience: 0 - 2 Years Compensation: Rupees 80,000 - 1,25,000 Job Description : Search Engine Optimization, On page and Off page Optimization, Drive Targeted traffic to websites through Search Engine and Social Media Marketing. Job Description / Requirement: * On page and off page Optimization * Content Writing * Article & PR Submission * Blog Postings * Forum & Message Board posting * Social Media Marketing * Analysis of top keywords * Search engine results tracking * Creating and implementing linking strategy * Providing daily ranking and performance reports * Generating and analysing Competitor information Desired Profile : * Excellent Written and Verbal Communication skills * Must be Internet savvy * Good Knowledge about Computers & Internet * Innovative & Quick Learner * Basic knowledge of SEO & HTML Contact Details : Name: HR Department Address: Disk Doctors 18/10, 3rd Floor Saleh Center Cunningham Road BANGALORE, India 560052 Email : hrindia(at)diskdoctors.net

FRESHERS JOBS @ LELESYS INFOTECH : Trainee Web Developer : Goa

Company	:	LELESYS INFOTECH
Job Location	:	Goa
Job Description	:	Lelesys Infotech Pvt. Ltd. Trainee Web Developer, contract, work in Goa, ANY GRADUATE MAY APPLY Experience: 0 Years Compensation: Incremental salary plan as per your progress Job Description : We would like to hire candidates on following basis : 1. Any graduate interested to start working as web developer 2. 2 to 5 years of contract to work in Goa 3. Company will provide all training from Basics to PHP, mySQL, Linux and modern web techniques 4. Incremental salary plan as per your progress. More about your work: 1. Most of the work will be on PHP, mySQL, Linux, Apache, Zend framework and TYPO3. 2. Mobile development using Java 3. High quality XHTML / CSS 4. TYPO3 CMS 5. 100% EOU company - so all projects are from USA and Europe. 6. Healthy work environment and lifestyle in Goa Desired Profile : Candidate should have following basic skills : 1. Very good English read - write - spoken 2. Basic computer knowledge 3. Graduate or Diploma in any discipline 4. Liking towards working as web developer 5. This is a contract job so you should be able to work with us for a long term with written commitment Please apply only if you are currently in Goa or can shift to Goa for long term. Experienced candidates need not apply. Contact Details : Name: Hrishikesh Lele Lelesys Infotech Pvt. Ltd. Email : jobsgoa(at)lelesys.com

FRESHERS JOBS @ HMS SYSTEMS : Technical Support Representative : Bangalore

Company	:	HMS SYSTEMS
Job Location	:	Bangalore
Job Description	:	HMS Systems Pvt.Ltd. Technical Support Representative Experience: 0 - 1 Years Compensation: Rupees 1,00,000 - 2,00,000 Job Description : * Troubleshooting of Windows XP, Windows Vista, Networking tools, System tools and Hardware analysis * Excellent Communication Skill * Willing to work in Night (US) Shift. Desired Profile : • Technical Knowledge in Windows XP, Windows Vista, Networking tools, System tools and Hardware analysis • Excellent Communication Skill. Any graduates and graduates with backlog are eligible too. Contact Details : Company : HMS Systems Pvt.Ltd. Email : lakshmi(at)hmssystems.net

FRESHERS JOBS @ SUMEDHA CONSULTANCY : Java, PHP Freshers : Hyderabad

Company	:	SUMEDHA CONSULTANCY
Job Location	:	Hyderabad
Job Description	:	Sumedha Consultancy Services Pvt. Ltd. Freshers In IT / Software Industry (Java, PHP) Job Description : * Open to learn New Technologies (Java, PHP) * Candidates with Good Skills on PHP or Java are Preferred * Any Graduate / Post Graduate (Min' 15yrs of regular/full time education) * The minimum qualification mark of candidate 50% Contact Details : Name: Mahesh Address: Sumedha Consultancy Services Pvt Ltd # 13-1-105/G2, Beside Nalanda Vidya Bhavan E-Seva Road, Moti Nagar, HYDERABAD, India Email : kamaraj.b(at)sumedhaconsultancy.com Telephone: 91-40-23831557

FRESHERS JOBS @ iMOMENTOUS SOFTWARE : BE/BTech : Java Trainee : Hyderabad

Company	:	iMOMENTOUS SOFTWARE
Job Location	:	Hyderabad
Job Description	:	iMomentous Inc. Java Trainee Job Description : B-tech (computers) with 70 % aggregate. Should have good commands on java. Desired Profile : Good Communication Skills Handle Multiple tasks at a time Contact Details : Name: Shiv Thakur iMomentous Software Pvt Ltd Email : hr(at)bijahealth.com

FRESHERS JOBS @ INFINITI DIGITECH : Service Engineer : Mumbai

Company	:	INFINITI DIGITECH
Job Location	:	Mumbai
Job Description	:	Infiniti Digitech Pvt. Ltd. Service Engineer Experience: 0 - 1 Years Compensation: Rupees 80,000 - 1,25,000 Job Description : Maintenance of Fire Alarm System, CCTV and access control system. Desired Profile : To supervise, maintain, fault tracing & rectification, commissioning, installation, of Fire Alarm system, Access control system and CCTV System Contact Details : Company : Infiniti Digitech Pvt Ltd Email : hr(at)idpl.co.in, infiniti.digitech(at)gmail.com

FRESHERS WALKINS @ BENCHMARK BUSINESS SOFTWARE : PHP / FLASH Developers : On 10, 11 Jan 2011 : Chennai

Company	:	BENCHMARK BUSINESS SOFTWARE
Job Location	:	Chennai
Job Description	:	Benchmark Business Software Freshers Walk-In : PHP / FLASH Developers @ Chennai Job Position : PHP / FLASH Developer Job Category : IT / Software Job Location : Chennai, Tamilnadu Desired Qualification : Any Graduates Mandatory Skills : PHP, Java Script / FLASH, Action Script Job Description : • Application Development in PHP, Java Script (or) FLASH, Action Script Walk-In Date : On 10th & 11th January 2011 : 10 AM to 1 PM Walk-In Venue : Benchmark Business Software, 42, Venkatachala Chetty Street, Triplicane, Chennai - 600005 Landmark: Near Parthasarthy Temple, Adjacent street to Adyar Ananda Bhavan or Krishna Sweets Contact Person : Dwaraknath.L Contact Number : +91-44-28442731

FRESHERS WALKINS @ QSOURCE GLOBAL : Desk Top Support : On 11 Jan 2011 : Hyderabad

Company	:	QSOURCE GLOBAL
Job Location	:	Hyderabad
Job Description	:	QSource Global Consulting Walkin interveiw for freshers Job Description : Greetings from Qsource! We have excellent openings for freshers for Desk Top Support (Contract to hire) Job Location : Hyderabad Experience : Freshers Graduation : Any graduation / Diploma (10+2+3) 50% & above in graduation. Willing to work in shift Contract for 2years Point discussed on the position : 1. Contract Position (Working on payrolls of Qsource deputed in Wipro Technologies) 2. 2 years Contract. 3. IT Hardware Support (for Wipro Infrastructure Services - not for call centre or BPO) 4. Initial Training for 2 months (No Training Charges) 5. Rs 3000 Paid during Shadow (2nd month training) as stipend 6. CTC 8150(First Year) 7. CTC 10600 (Second Year onwards) 8. Need to mandatorily submit anyone document 9. Penalty 10000 during training,Post Training 20000 10. Flexible to Work in US & UK shift( Transportation will be provided) OR Walkin to below mentioned address with a print of this Posting Walk-in date : 11/01/11 Venue: Hotel Sai Prakash Station Road, Nampally Hyderabad - 500 001 Contact : Medha Contact # : 9686680215

FRESHERS WALKINS @ 3DPLM SOFTWARE : BE/BTech/MTech : Software Engineer : Pune

Company	:	3DPLM SOFTWARE
Job Location	:	Pune
Job Description	:	3DPLM Software Solutions Limited (3DPLM) Designation : Software Engineer - FEA/CAE Development Before going for walkin please fix your interview by telephone. Job Description : We are seeking Software Development Engineers with a Bachelor's/ Master's degree in mechanical/ civil/aerospace/ metallurgy engineering to develop pre and post processing capabilities to Finite Element suite of programs. The primary responsibility of this position is the design and development of the preprocessing capabilities to various analysis products, particularly in the area of mechanical attributes. Other responsibilities include bug fixing, quality assurance testing and interacting with product management teams to gather requirements for the products. Knowledge of C++ programming is a plus. The successful candidate will be provided additional training in the usage of the various analysis applications and in programming. The primary development languages used is C++. This is an excellent opportunity to grow your career in a technically challenging environment. Contact : Jayant Vispute 3D PLM Rajiv Gandhi Infotech Park HINJEWADI PUNE, India 411057 Telephone : 91-20-22906600

FRESHERS WALKINS @ LINCOLN INDIA : ITI & Diploma : On 11-13 Jan 2011 : Bangalore

Company	:	LINCOLN INDIA
Job Location	:	Bangalore
Job Description	:	Lincoln Helios (India) ltd, ITI & Diploma @ Bangalore Job Description : Job Position : ITI & Diploma Job Description : • Operate drilling and other conventional machines. • Operate the machine as per the work plan. • Ensure productivity and production. • Ensure product quality as per the standards. • Ensure Self inspection of the products produced. • Ensure 5S, Housekeeping and safety working conditions. • Conduct minor maintenance tasks. Desired Qualification : ITI / Technical Diploma Holders Desired Skills : • Experience in working on drilling / other conventional machines. • Experience in service / maintenance / assembly. • Willingness to work in the shifts. • Willingness to work through second party. • Should be physically fit. • Fresh ITI / Technical Diploma Holders can attend the interview. Walk-In From 10th to 13th January 2011, 9 AM to 1 PM Venue : Lincoln Helios (India) Ltd, Grindwell Norton Campus, Near Budigere Cross, Off Old Madras Road (Hoskote Road), Bangalore Contact : 80-28473008

Thursday 6 January 2011

FRESHERS WALKINS @ WIPRO MEGA Off-Campus : BE/BTech/ME/MTech/MCA : On 8, 9 Jan 2011 : Cochin

Company	:	WIPRO
Job Location	:	Cochin
Job Description	:	Wipro Technologies Mega Off Campus Recruitment Drive FOR SOFTWARE FUNCTION [NOT BPO] 2009, 2010 Batch BTech / MTech / MCA Recruitment Date: 08, 09 January 2011 Venue: ** KMEA Engineering College, Edapally-Pukkattupady Rd, Cochin Eligibility Criteria : * Year of Graduation: 2009, 2010 batch * BE / B Tech / ME / M Tech (All branches) / MCA * 50% in X, XII, 60% in UG & PG * No standing arrears on the day of interview * Maximum gap of 2 years between the academics * Candidates who have studied outside Kerala colleges are also eligible. * Candidates who attended Wipro INTERVIEW in the past 6 months are not eligible. * Candidates who wrote the test and did not clear the test / attend interview are ELIGIBLE. Selection Process : * Written Test - 8 / 9 January 2011 * Technical & HR Interviews - 9 [for candidates who take test on 8], 10 [for candidates who take test on 9 Salary: * BTech - 2.75 LPA * MTech - 3.0 LPA Confirmation / Hall Ticket: * Online Confirmation open * SHREDS [Login / New Registration] to confirm / access hall ticket. * Hall Tickets will be available in SHREDS Login within 24 hours from confirmation All the candidates should bring the following to test venue: * Writing Pad * Two copies of RESUME * Two sets of photocopies of your mark lists * Three copies of passport size photographs * Rs.100/- to be paid to SHREDS towards examination fees * Gum / Stapler * Any Photo ID [College, DL, PAN, Voters]

Wednesday 5 January 2011

WIPRO All India Referral Walk-in for Experienced Graduates on 8th & 9th of January

WIPRO Referral Walk-in for Experienced Graduates

Walk-in for B.Sc, BCA, BA, B.Com, Diploma

Graduates with 6 months to 2 years IT experience

Job Code: 119

Wipro has been recognized for nurturing graduates from all streams and grooming them into world-class IT professionals. We invite your friends to exciting opportunities with us in the software engineering space.

Eligibility

• B.Sc., BCA, BA, B.Com., Diploma graduates (Full time courses) with 6 months - 2 years IT experience

• Experience in Java / Oracle / UNIX / C++ / Testing / .NET

Date: 8th & 9th of January 2011

Time: 9 a.m. - 2 p.m.

Venue:

Bangalore Wipro Technologies, No 53/3, Ganapa Towers, (Near Madivala Police Station),Hosur Main Road,Bangalore - 560068, Karnataka	Hyderabad Wipro Technologies, Survey No.203/1, Gate No.1, Manikonda Village, Gachibowli, Hyderabad - 500 032, Andhra Pradesh
Greater Noida Wipro Technologies, Special Economic Zone, Plot #2,3 & 4, Knowledge Park- IV, Greater Noida - 201306, Uttar Pradesh	Chennai Sathyabama University, Jeppiaar Nagar, Rajiv Gandhi Road, Chennai - 600 119, Tamil Nadu
Mumbai Wipro Technologies, Logitech Park, Ground Floor Velocity, Sakinaka junction, Andheri East, Mumbai - 400 072, Maharashtra	Cochin Wipro Technologies, Info Park Special Economy Zone, Kusumagiri P.O, Kakkanad, Kochi - 682 030, Kerala
Pune Wipro Technologies, Plot No 2, MIDC, Rajiv Gandhi Pune Infotech Park, Phase - 1, Hinjewadi, Pune - 411 067, Maharashtra

This is a non incentive based employee referral program.

Note

• Refer candidates online through WipLinks > Refer Now > Refer a Fresher > Job Code 119

• Employees have to refer candidates online against the Job Code before candidates walk-in with their resumes to the above mentioned address

• Your referrals need to mention your name and employee number for completing the employee referral procedure

• Please ask the candidates you refer to carry a copy of their resume, 2 passport size photographs and a valid photo ID

To refer, log onto:

WT Employees: myWipro > My Forums > WipLinks > Refer Now > Refer a Fresher

WI Employees: myWipro > Talent Acquisition > LiveWire > WipLinkers > Refer Now > Refer a Fresher

WBPO Employees: my Wipro > My Participation Forum > WipLinks > Refer Now > Refer a Fresher

Employees outside Wipro network: http://gateway.wipro.com > myWipro > Follow the WT / WI / WBPO path to reach WipLinks

Wipro is an equal opportunity employer .We encourage persons with disabilities to apply too.

FRESHERS JOBS @ VEM TECHNOLOGIES : Jr. Engineer - Trainees : Hyderabad

Company	:	VEM TECHNOLOGIES
Job Location	:	Hyderabad
Job Description	:	Vem Technologies Pvt Limited Jr. Engineer - Trainees Job Description : Responsible for the production department & Quality department activities Should have knowledge in Relative subjects Minimum 60% in Diploma Desired Profile : Diploma (Mechanical). Preferable Local Candidates can apply Contact Details : Name: Mr. K Satya Address: Vem Technologies Pvt Limited 8-48/1 Bachupally Industrial Area Via Miyapur, Ranga Reddy District HYDERABAD, India 500001 Email : kvvsatya(at)vemtechnologies.com Telephone: 91-40-23046666

Tuesday 4 January 2011

FRESHERS WALKINS @ IBM INDIA : IT Help Desk : Hyderabad : On 8 Jan 2011

Company	:	IBM INDIA
Job Location	:	Hyderabad
Job Description	:	IBM IT Help Desk Interviews at IBM, Hyderabad on 8th January 2011 Job Description : IBM is Hiring Freshers (2010 pass outs with all the marks sheets and Provisional Degree certificates) and Experienced candidates. Graduates & Post Graduates from any discipline (BSc, BCom, BSc, BE, MCA, MBA) Freshers 2010, 2009, 2008, 2007 pass outs Also, Diploma holders (10+2+3) Experience : 0 to 18 months SKILLS REQUIRED: Good communication skills are requisite Knowledge of Computer Hardware and Networking concepts Willingness to work in shifts Industry Type : BPO/ITES Please do refer your friends for this opening Date - 8-Jan-11, Timings: 12PM to 1PM Venue Details: IBM India Pvt Ltd 3A, Mindspace, Hi-Tech City Hyderabad 500081 Remember, if you have the skill, then we have the job! Note: * Walk-in candidates are requested to carry Resume, one photo-id, * Please carry a print of this email. * Please do not carry bags with you for the interview. * Please do not respond back to this Id. You can directly walkin on the date mentioned * Candidates walking after 12PM will not be entertained. * Selection of candidates is at the sole discretion of the IBM Recruitment Team

FRESHERS WALKINS @ OUR WEB STUDIO : PHP Programmers : On 8 Jan 2010 : Hyderabad

Company	:	OUR WEB STUDIO
Job Location	:	Hyderabad
Job Description	:	Our Web Studio Software Solutions Pvt. Ltd Walk-In Interview On Saturday 8th January 2011 from 11am to 5pm Job Description : * Working along with the project manager to understand project requirements. * Develop the programming code from scratch or by adapting existing application to meet business requirements * Testing the application and identifying any technical problems Desired Profile : We currently have multiple vacancies for PHP Programmers. Freshers are welcome and should have strong command over C, C++ and SQL Contact Details : Name: Ms. Farheen Address: Our Web Studio Software Solutions Pvt Ltd 6-3-666/A, 4th Floor, Lumbini Towers Opp: NIMS, Panjagutta HYDERABAD, India Telephone: 91-40-66754011

FRESHERS JOBS @ SENSIPLE SOFT : Trainee Support Engineers : On 7 Jan 2011 : Chennai

FRESHERS JOBS @ SENSIPLE SOFT : Trainee Support Engineers : On 7 Jan 2011 : Chennai

Company	:	SENSIPLE SOFT
Job Location	:	Chennai
Job Description	:	Sensiple Software Solutions Pvt Ltd, Walk-In for freshers on 7-Jan-2011 between 10.00 a.m - 2.00 p.m Job Description : Walk In For Trainee Support Engineers (Application Support ) on 7-Jan-2011 between 10.00 a.m to 2.00 p.m Mandatory skills: • Interest to work in tech support • Good communication skills • Good Attitude • Good Analytical / Good problem solving skills Other required Info: • Need only Male candidates • 24/7 Application Support • Work timings would be shift bases. Optional: • Exposure to Linux environment • Experience in Tech support • Knowledge in SQL Contact Details : Name: Padmavathy Address: Sensiple Software Solutions Pvt Ltd, #43, First Avenue, Ashok Nagar CHENNAI, India 600083 Telephone: 91-44-24746043