Forum Posts
- 0 Answers Test Engineer At Google Over Developer At Microsoft?
Hi Guys,
- pretentious.bastard February 26, 2014
I am an SDET at Microsoft. My team is shifting focus from the traditional SDET job definition to something that would result in less coding and more manual testing and data analysis. I have always enjoyed the coding aspect of my job and now I've decided to make a move to a position where I can continue to do that. My goal is to move to a developer position. What I mean by that is something that is coding intensive than what I would do in the future in this team.
I am interviewing internally at MS for developer positions and I applied at Google for an SET position as well. I was offered the TE(Test Engineer) position instead of the SET position. Now here within MS, I am pretty sure I will get into a developer position somewhere or the other if I keep trying even though I do not have a lot of hardcore dev experience. I want to move to a dev position because I want to grow in my career as a developer and not "try" other stuff anymore.
Google told me that if I take up SET and SWE projects as a part of my work and display proficiency, I would be able to switch to those disciplines in 18 months or 2 years.
My question is, do you think it's worth going to Google as a TE and spending all that time just to reach a stage where I would be eligible for consideration to move to an SET/SWE position or do you think I should just grab an MS dev role if I get it and jump into it and put all the hard work into that? What are the pros and cons of taking either of these steps?
I would really appreciate some help deciding here. And please ask me any questions that would help you help me. Again, I am not a person with a hardcore dev background, but I am smart, hard working and rarely make the same mistakes twice. So, I think I can learn and grow in any position. But I'd also appreciate you giving it to me straight.
Thanks!
Pretentious Bastard| Flag | PURGE - 12 Answers Test Engineer At Google Over Developer At Microsoft?
Hi Guys,
- pretentious.bastard February 26, 2014
I am an SDET at Microsoft. My team is shifting focus from the traditional SDET job definition to something that would result in less coding and more manual testing and data analysis. I have always enjoyed the coding aspect of my job and now I've decided to make a move to a position where I can continue to do that. My goal is to move to a developer position. What I mean by that is something that is coding intensive than what I would do in the future in this team.
I am interviewing internally at MS for developer positions and I applied at Google for an SET position as well. I was offered the TE(Test Engineer) position instead of the SET position. Now here within MS, I am pretty sure I will get into a developer position somewhere or the other if I keep trying even though I do not have a lot of hardcore dev experience. I want to move to a dev position because I want to grow in my career as a developer and not "try" other stuff anymore.
Google told me that if I take up SET and SWE projects as a part of my work and display proficiency, I would be able to switch to those disciplines in 18 months or 2 years.
My question is, do you think it's worth going to Google as a TE and spending all that time just to reach a stage where I would be eligible for consideration to move to an SET/SWE position or do you think I should just grab an MS dev role if I get it and jump into it and put all the hard work into that? What are the pros and cons of taking either of these steps?
I would really appreciate some help deciding here. And please ask me any questions that would help you help me. Again, I am not a person with a hardcore dev background, but I am smart, hard working and rarely make the same mistakes twice. So, I think I can learn and grow in any position. But I'd also appreciate you giving it to me straight.
Thanks!
Pretentious Bastard| Flag | PURGE - 0 Answers Test Engineer At Google Over Developer At Microsoft?
Hi Guys,
- pretentious.bastard February 26, 2014
I am an SDET at Microsoft. My team is shifting focus from the traditional SDET job definition to something that would result in less coding and more manual testing and data analysis. I have always enjoyed the coding aspect of my job and now I've decided to make a move to a position where I can continue to do that. My goal is to move to a developer position. What I mean by that is something that is coding intensive than what I would do in the future in this team.
I am interviewing internally at MS for developer positions and I applied at Google for an SET position as well. I was offered the TE(Test Engineer) position instead of the SET position. Now here within MS, I am pretty sure I will get into a developer position somewhere or the other if I keep trying even though I do not have a lot of hardcore dev experience. I want to move to a dev position because I want to grow in my career as a developer and not "try" other stuff anymore.
Google told me that if I take up SET and SWE projects as a part of my work and display proficiency, I would be able to switch to those disciplines in 18 months or 2 years.
My question is, do you think it's worth going to Google as a TE and spending all that time just to reach a stage where I would be eligible for consideration to move to an SET/SWE position or do you think I should just grab an MS dev role if I get it and jump into it and put all the hard work into that? What are the pros and cons of taking either of these steps?
I would really appreciate some help deciding here. And please ask me any questions that would help you help me. Again, I am not a person with a hardcore dev background, but I am smart, hard working and rarely make the same mistakes twice. So, I think I can learn and grow in any position. But I'd also appreciate you giving it to me straight.
Thanks!
Pretentious Bastard| Flag | PURGE - 0 Answers Java SWT Tooltips
0 down vote favorite
- prithvirulzzz February 26, 2014
Please help me out on this, I have been breakin my head over this for weeks together.
I have a Class called InformationArea.java which displays an information area to the user. There a label called "enter a unique name" in the infomation area(basically an import dialog window). When I hover the mouse over that label there is a empty tooltip being displayed. I would want to remove that tooltip(I mean I dont want it to be shown). I can easily say tooltip.setVisibility(false) but I should not change the code inside the MouseTrackListener Anonymous class. I need to use a toltip property pr anythin else so that when I extend this class I need to have an option to easily set the visibility of this tooltip if needed or disable it if not needed.
Here is my Code snippet (JAVA SWT)
tooltip = new ToolTip(parent.getShell(), SWT.NONE);
MouseTrackListener mouseTrackListener = new MouseTrackListener() {
@Override
public void mouseEnter(MouseEvent e) {
if (text != null && !text.isEmpty()) {
tooltip.setLocation(Display.getCurrent().getCursorLocation().x,
Display.getCurrent().getCursorLocation().y + TOOLTIP_OFFSET_Y);
tooltip.setVisible(true);
}
}
@Override
public void mouseExit(MouseEvent e) {
if (text != null && !text.isEmpty()) {
tooltip.setVisible(false);
}
}
@Override
public void mouseHover(MouseEvent e) {
{
}};
label.addMouseTrackListener(mouseTrackListener);
iconLabel.addMouseTrackListener(mouseTrackListener);
I want an option such that the tooltip can be built or destroyed when ever needed in the derived class without changin the code in the MouseTrackListener| Flag | PURGE - 0 Answers What are infrastructure tools??
I have a scheduled interview with a project manager for an intern position. The only bit of information the recruiter was able to give me is that the project is on 'development of an infrastructure tool'.
- badboy13 February 25, 2014
Naturally, I want to be as prepared as I possibly can, but I'm having trouble finding any concrete information on this topic.
Is this something to do with data management/optimisation/servers?
Cana nyone point me in the right direction?| Flag | PURGE - 0 Answers could any one share me the interview model questions for amazon written test for Competencies evaluated: Aptitude and Tech interview (JAVA, Linux, SQL), Problem Solving
i have interview scheduled on March 1st. Could any one please share the model questions related to this criteria ?
- bhrth.dsra1 February 24, 2014| Flag | PURGE - 0 Answers How would you test a baby monitor?
Hello,
- softtesting83 February 18, 2014
We have a Computer Science project consisting of a baby monitor (a sender and a receiver) so when the baby is crying or a loud sound is perceived, an alert is sent to the parent.
I'm interested in how someone would test the sender, meaning how would you test the detection of a crying baby/loud sound. We have the algorythm to detect the sounds, but we need some help to know how would we have to think in terms of test cases.
Thank you.| Flag | PURGE - 1 Answer django
How to populate the choicefield with a few initial values?
- brijesharmy February 18, 2014| Flag | PURGE - 0 Answers Given a positive integer k ≥ 2...
Given a positive integer k ≥ 2, an array A[1..n] with n distinct integers, n = k^m ≥ 1, and
- mahitha.cams February 16, 2014
an integer key x. Design a k-ary search algorithm by extending the standard binary search
algorithm for searching the array A for x . Based on the number of comparisons between x
and the elements in A, set up and then solve the corresponding recurrence equation for the k-ary
search algorithm for Tw(n). Can you determine the value of k for the best performance k-ary
search algorithm.| Flag | PURGE - 0 Answers Given an array A[1..n] with n ...
Given an array A[1..n] with n distinct integers, n = 4^m ≥ 4. By dividing A into four
- mahitha.cams February 16, 2014
equal parts, design an efficient DAC merge sort algorithm by extending the standard merge
sort algorithm for sorting A. Assuming that it will take 2n-3 comparisons to merge the four
sub arrays together, based on the number of comparisons between elements in A, set up the
recurrence equation for Tw(n) and then compute it in closed-form.| Flag | PURGE - 0 Answers Given an array A[1..n] and a k...
Given an array A[1..n] and a key x, n = 3 ^k ≥ 1. If Pr(x belongs to A) = 3/8
- mahitha.cams February 16, 2014
and, if x is in A, the
probability that x is in the first third of the array is three times more likely for x to be in the
second third of the array, and the probability that x is in the second third of the array is twice
more likely for x to be in the last third of the array. Furthermore, if x is in any third part of the
array, x is equally likely to be found in any one of the positions in that part of the array. Based
on the number of comparisons, compute Ta(n) if sequential search is performed on A for x.
You must set up the equation for Ta(n) and then evaluate the sums. Do not simplify your
expression| Flag | PURGE - 0 Answers merge sort algorithm
Given an array A[1..n] and a key x, n = 3 ^k greater than or equal to 1. If Pr(x belongs to A) = 3/8
- mahitha.cams February 16, 2014
and, if x is in A, the
probability that x is in the first third of the array is three times more likely for x to be in the
second third of the array, and the probability that x is in the second third of the array is twice
more likely for x to be in the last third of the array. Furthermore, if x is in any third part of the
array, x is equally likely to be found in any one of the positions in that part of the array. Based
on the number of comparisons, compute Ta(n) if sequential search is performed on A for x.
You must set up the equation for Ta(n) and then evaluate the sums. Do not simplify your
expression| Flag | PURGE - 0 Answers merge sort algorithm
Given an array A[1..n] and a key x, n = 3k 1. If Pr(xA) = 3
- mahitha.cams February 16, 2014
8
and, if x is in A, the
probability that x is in the first third of the array is three times more likely for x to be in the
second third of the array, and the probability that x is in the second third of the array is twice
more likely for x to be in the last third of the array. Furthermore, if x is in any third part of the
array, x is equally likely to be found in any one of the positions in that part of the array. Based
on the number of comparisons, compute Ta(n) if sequential search is performed on A for x.
You must set up the equation for Ta(n) and then evaluate the sums. Do not simplify your
expression| Flag | PURGE - 12 Answers array puzzle load balance
There is a array indicating the load on each server like this
- pvpkiran February 14, 2014
0,0,10,0,0,0,0,0,0,0
each servers can share load with its neighbours, and it can only share 1 unit per second. like this
0,1,8,1,0,0,0,0,0,0
so how many seconds needed to distribute the load equally.
so for the above case the next step is
1,1,6,1,1,0,0,0,0,0
so totally this sequence needs 7 seconds to make it
1,1,1,1,1,1,1,1,1,1
for the case where input is 27,28
the result shud be 0. Because it can't be balanced.| Flag | PURGE - 0 Answers Variation in finding Stirling numbers of the first kind
There is a famous recursive relation to find Stirling numbers of the first kind, i.e.
- cadam940 February 13, 2014
C(n,k)=C(n−1,k−1)+(n−1)C(n−1,k)
This is a solution to the following problem:
Given a set of N distinct numbers, how many different permutations of the set exist such that there are exactly K left-to-right maxima?
This was not very hard, but the following little variation:
Given a multiset of N numbers (not necessarily distinct), how many different permutations of the set exist such that there are exactly K left-to-right maxima (see definition below)?
Example:
Let the multiset be S={1,2,2,3} [Note: the two 2s should be considered non-identical while permuting] and K=3. Then, the following permutations:
<1,2,2,3>
<1,2,2,3>
<1,2,3,2>
<1,2,3,2>
satisfy the required condition. Hence, the answer should be 4 (we do not need to find all the permutations but we are interested in the number of such permutations).
Definition: An element should be considered a maximum if and only if all the elements occurring before it are strictly less than it.
For example, in the above example <1,2,2,3>, the second 2 is not maximum but the first 2 is. Hence, this arrangement satisfy K=3 (not K=4).| Flag | PURGE - 2 Answers Palindrome number or not
find whether a number is palindrome or not if number is not palindrome ( i.e 112 ) make it in a palindrome form and check if it is palindrome or not.
- napender February 12, 2014
Example - 121 this is a palindrome number but 112 is not palindrome so make it 121 and check.| Flag | PURGE - 0 Answers Algorithm to generate minimum number of spheres to contain 3Dpoints
Given a set of input points (3D)
- p.phanikrishna February 11, 2014
A sphere can contain many points, and radius of sphere is variable.
How many spheres (minimum) are required to contain all given input points?| Flag | PURGE - 0 Answers Algorithm
Consider an implicit binary min-heap with n distinct elements. Let k be an integer much
- algorithm February 09, 2014
smaller than n, but not a constant. The root of the heap contains the smallest value. Where
in the heap can the kth smallest value be located? Be precise. Describe how to find the kth
smallest value, given a heap (which you cannot modify!) in time dependent on k, but not n.
What is the algorithm? What is its worst-case running time? Be precise.| Flag | PURGE - 3 Answers github link on resume
I'm wondering whether to link to my github account on my resume/CV
- SBD February 09, 2014
It's got half a dozen historical small projects I've done over the years, some complete, others not so. The oldest stuff dates back to 1994. There's one project in progress. My followers/starred/following counts are at 0.
Would an interviewer even bother to go and look at it?
I was thinking of putting something like:
github[link] includes: X86/SPARC interpreter, Android game, Python Kivy game, irc bot| Flag | PURGE