Taro Logo

Applications Support Engineer Interview Experience

April 15, 2013
Neutral ExperienceNo Offer

Process

1st round: HR phone interview

2nd round: Technical phone interview (awaiting response)

They usually expect elaborate answers from candidates, so don't be surprised if the interviewer asks for more points within the same answer.

Questions

Discrete Math:

  • Linear functions
  • Big O notation
  • Hash tables, BSTs, arrays, and linked lists: Time complexities for insertion and deletion
  • Pigeonhole principle
  • Linked list deletion operations
  • Hash functions

C:

  • #include <stdio.h>
  • Difference between using angle brackets <> and double quotes "" for include directives
  • const and #define
  • typedef
  • malloc()
  • Comparison with calloc()
  • struct and class
  • Difference between class ClassName; and class ClassName {};

C++:

  • Operator overloading
  • Operators that cannot be overloaded

OS:

  • Cache
  • Cache miss and hit
  • Mutex
  • Multithreading
    • Advantages

Java:

  • Classpath
  • Generics
  • Is Java machine independent?
  • Is JVM machine independent?
  • JRE and JDK
  • final class
  • final variable
  • abstract class
  • == and .equals()

Was this helpful?

Interview Statistics

The following metrics were computed from 957 interview experiences for the MathWorks Applications Support Engineer role in United States.

Success Rate

14%
Pass Rate

MathWorks's interview process for their Applications Support Engineer roles in the United States is extremely selective, failing the vast majority of engineers.

Experience Rating

Positive47%
Neutral44%
Negative9%

Candidates reported having very good feelings for MathWorks's Applications Support Engineer interview process in United States.

MathWorks Work Experiences