An applications support analyst provides technical support for businesses across diverse industries. During an interview, you can expect to answer questions about your technology experience and collaboration and problem-solving skills.
Here are three top applications support analyst interview questions and tips on how to answer them:
How to answer: This open-ended question allows you to demonstrate your understanding of the position and job requirements. Customer service skills are essential to the success of an applications support analyst, as are investigative and diagnostic skills, acceptance of ownership, attention to detail and having a proactive approach to problems. Refer to your ability to empathise with users.
How to answer: This open-ended question is used to determine how you face challenges in professional settings. Having empathy for customer issues and demonstrating patience while dealing with them are essential qualities of applications support analysts. Share specific examples of challenges you have overcome in your life, specifically related to work.
How to answer: This open-ended question lets you share your communication and interpersonal skills when working as a part of a team. Most issues in applications are abrupt and require everyone in the IT department to solve the problem quickly. Refer to how you work with others, including delegating duties, to get the job done. Share examples from past experiences if possible.
↳
Nop Not yet.. Still waiting.. Good luck for you alex.. Let me know if in case you get any response.. Less
↳
I had applied for the position which was posted for munich but during the Interview I was told that the training will be in the UK irrespective of the location you apply for. Less
↳
Ok Guys, I have got a feedback from Altera. They have invited me for a personal Interview to the UK. I think Munich was not feasible for them. I hope you all have got a response too.. Less
↳
I forgot to mention that you have to try to figure out the floor in the least amount of tries. so incase the minimum floor is 100, you shouldn't try all the floors. The solution posted above works, but is the least efficient. Less
↳
With 2 bulbs we can skip 3 floors at a time. 1) Drop bulb #1 at floor x 2) If it breaks then try floor x-1 else try floor x+3 Start with floor 1. Less
↳
The issue with a research-based answer is that parameters of the posed problem is not based in reality, i.e. dropping a light bulb from any floor would almost guarantee it breaking in real life. So the interviewer is really looking for problem solving skills for an hypothetical situation rather your attention to detail in a real world situation. Less
↳
I wont give the answer. Hint : know who divides you ;-)
↳
I think 2520 is perfect
↳
Answer is pretty simple: m%10=0 -----case 1 Lets assume n=m-1 Since the remainder is always same , when n is divider by any number from 10 to 1.. n%10 = n%9=.........=1 That means n+1 is completely divisible by all numbers from 10 to 1.. (Since it gives common remainder).. n + 1= Lcm of (1 to 10) = 2520 But we assumed n = m-1, so m -1+1 =m = 2520 Less
↳
Process: put buckle into socket until it locks. Benefit: your face doesn't become shredded to hell when it goes flying through the windshield in an accident. Less
↳
Process (front seat manual seat belt only for simplicity): Prerequisites: - Be inside car. - Be seated. - Be unbuckled. Step 1: move the hand farthest from your nearest window over your opposite shoulder, reaching just behind the window frame for the belt buckle. Step 2: Grab it and pull your hand across your body in a downward fashion, reaching for the space between your seat and the seat next to you, where you'll find the socket into which the buckle locks. Step 3: Match the hole in the socket with the buckle. It may take some practice. Step 4: CLICK! Benefits (from most to least likely to happen): - Avoiding minor injuries from hitting your head against the windshield when the person driving brakes too hard all of a sudden. - Being able to slide your nail against the side of the belt, making a "swish" noise which will potentially annoy everyone else inside the car, for endless fun. - Achieving a false sense of security. - Avoiding fines for not using it (where applicable). And not having to use one of these: http://static2.stuff.co.nz/1368495490/264/8670264.jpg - If you do end up having a real car crash, you won't have to worry about any nasty sequels, as you'll likely die caught in its relentless grip as your car explodes. - Avoiding dying when the car comes to an abrupt stop after having gathered enough momentum to throw you off through the windshield. Less
↳
flight attendant, assume crash position...
↳
Hey, did you hear back from them about the final decision? Also, were u coding in Java or Python? If python, why did they ask you questions on java? Could u share those questions because I have been invited too Less
↳
They ask you what language you feel most comfortable with and ask you questions based on that (I said Java). I haven't heard back but I have been contacted by another recruiter from their Manhattan office so maybe better luck on this second try. Good Luck! Less
↳
Thanks man, best wishes to you too.. Nail it this time
↳
i got it to be in the 14 th century ...
↳
Sorry it should be 08-31-1380
↳
how can the month no. will be more than 12 i think the answer should be 29-11-1192 :) correct me if i am wrong..... Less
↳
How was the phone interview? you didn't have on-site interview?
↳
Phone interview was good. They asked the questions which are there on the blackboard and there a set of mathwork interview questions on scribd.com. You can also refer that Less
↳
can we choose any two language out of 5.?
↳
Definition: A null pointer is a general pointer (int *i, char *c, etc..,) except that the address stored in i, c doesn't correspond to any memory location. (i=0, c=0) Less
↳
NULL is "Pointing to nothing" It can be referenced as 0 or NULL or nil. The RHS will decide the value If the RHS is pointer then 0 is pointing to nothing, and if RHS is not pointer e.g. integer the 0 has integer 0 value. so NULL is actually defined by the compiler/library designer and it has to be type cast to other types when we assigned it to different datatype values. NULL has no datatype of its own. [void != NULL] Less
↳
On most of the operating systems, programs are not permitted to access memory at address 0 because that memory is reserved by the operating system. However, the memory address 0 has special significance; it signals that the pointer is not intended to point to an accessible memory location. But by convention, if a pointer contains the null (zero) value, it is assumed to point to nothing. Less
↳
public static void main(String[] args) { int occurrence = 0; Map m = new HashMap(); List nos = new LinkedList(); nos.add(1); nos.add(1); nos.add(2); nos.add(3); nos.add(4); nos.add(3); nos.add(2); nos.add(4); nos.add(5); nos.add(100); Set uniqueNos = new HashSet(nos); for(int temp:uniqueNos) { for(int tempList:nos) { if(temp == tempList) { occurrence++; } } m.put(temp, "Appears "+occurrence +" times"); occurrence = 0; } System.out.println(m); } Less
↳
import java.util.Scanner; public class Occurrence { public static void main(String[] args) { int n, count = 0, i = 0; Scanner s = new Scanner(System.in); System.out.print("Enter no. of elements you want in array:"); n = s.nextInt(); int a[] = new int[n]; int x[] = new int[n]; System.out.println("Enter all the elements:"); for(i = 0; i < n; i++) { a[i] = s.nextInt(); } System.out.print("Enter the element of which you want to count number of occurrences:"); for(i = 0; i < n; i++) { x[i] = a[i]; } for(i = 0; i < n; i++){ count = 0; for(int j = 0; j < n; j++) { if(a[j] == x[i]) { count++; } } System.out.println("Number of Occurrence of the Element:"+a[i]+"is"+count); } } } Less
↳
import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class Test { public static void main(String[] args){ Map map = new HashMap(); Scanner s1 = new Scanner(System.in); int a[] = new int[10]; System.out.println("Please enter the 10 numbers"); for(int i=0;i<10;i++){ a[i]=s1.nextInt(); } for(int j=0;j<10;j++){ int count = 1; for(int k=0;k<10;k++){ if(j!=k){ if(a[j]==a[k]){ count++; } } } map.put(a[j],count); } for(Map.Entry m:map.entrySet()){ System.out.println("The value "+m.getKey()+" occurs "+m.getValue()+" times in the series which u have entered."); } } } Less
↳
I struggled with this a bit and got close. I believe answer is: 23:55
↳
The first pond started with 1 bacterium and doubled to 2 in five minutes. Therefore, the second pond will take 5 minutes less than the first to be full. ie: 23:55 Less
↳
This is a clear case of Geometric progression. Find the nth term Tn1 = a*r^(n-1). where n = (24 * 60)/5,a = 1 and r=2. when the initial value (a) = 2, the values become n = ?, a = 2 and r = 2. Since Tn1 = Tn2, Equate the RHS of both the equation. Since the base are equal, equate the powers, doing so will give the n value. When n is convert into minutes one get 23 hrs 55 minutes. Less