Senior Software Engineer Interview Questions in London, England | Glassdoor

# Senior Software Engineer Interview Questions in London, England

"Senior software engineers are the most experienced member of a software team and usually carry the most responsibility and authority of that team. Because of this, interviews will be designed to find candidates who have expert knowledge of the field and years of experience as a software engineer. Expect to be asked tough technical questions and to give examples of previous projects that you have worked on."

## Top Interview Questions

Sort: RelevancePopular Date

### Senior Software Engineer C++ at Bloomberg L.P. was asked...

Jan 5, 2014
 I completely froze on following question which could be useful in a function that reverses order of words. How would you move a chunk of memory in C++/C?2 Answersmemmove function Interviewer was really trying to pull this one out of me, but I was just stumped. He was like: "you can copy it, or you can - what?" I had no clue, never heard of it. I think this one finally destroyed my chances.i guess it can be moved by using pointer? Below is an answer on the stackoverflow http://stackoverflow.com/questions/6118432/how-to-reverse-words-one-by-one-in-c-using-pointers-and-arrays

### Senior Software Engineer at Goldman Sachs was asked...

May 8, 2010
 Write an algorithm to rotate a node of a binary tree.2 Answersvoid rotateLeft( Node p) { Node r = p.right; p.right = r.left; if (r.left != null) r.left.parent = p; r.parent = p.parent; if (p.parent == null) root = r; else if (p.parent.left == p) p.parent.left = r; else p.parent.right = r; r.left = p; p.parent = r; } void rotateRight(Node p) { Node l = p.left; p.left = l.right; if (l.right != null) l.right.parent = p; l.parent = p.parent; if (p.parent == null) root = l; else if (p.parent.right == p) p.parent.right = l; else p.parent.left = l; l.right = p; p.parent = l; }To help visualise, right rotation is shown below. Consider a given tree: R /\ / \ P C /\ / \ A B Imagine nodes as metal coins suspended by strings (branches). For right rotation: 1. Pick up node P and pull it up so that node R falls down to the right of P. 2. Take B (right child of P) and make it left child of node R. The tree has been right rotated now and looks like this: P /\ / \ A R /\ / \ B C Similar process can be applied to this tree to rotate it left. This time start by pulling up R above P. Hope it helps.

### Senior Software Engineer at SAP Concur was asked...

Sep 14, 2012
 How will you prevent the code in finally block from executing? The question isn't a very fair one as a good programmer would not write the code in finally block that he/she doesn't want to execute2 Answersif(false)Its just to check logic, finally will not run if system.exit(0) is called.

### Senior Software Engineer at The SYZYGY Group was asked...

Aug 9, 2015
 Around asp.net and wcf1 AnswerVery well

Jul 28, 2015

### Senior Software Engineer at Kainos was asked...

Aug 6, 2014
 The most difficult part was the accent. I had some problems with understanding the basic words like "synchronised".1 AnswerThe rejecting email said they could send you more detailed interview results, but they never did.

### Senior Software Engineer at Improbable was asked...

Sep 17, 2015
 Could you please sign this NDA and not post the questions in Glassdoor?1 AnswerYes, of course.

### Senior Software Engineer (C++) at Epoch Capital was asked...

Jan 18, 2018
 4 or 3 coding exercisesBe the first to answer this question

### Senior Software Engineer at Seerene was asked...

Jul 23, 2018
 Something about finding bugs in the productionBe the first to answer this question

Jun 29, 2015