Jeppesen Software Engineer Interview Questions and Answers

The first round was an aptitude test, question ranging from medium to difficult .The marking scheme included -1,+1 for each incorrect and correct answer it was quite challenging . Additionally there were multiple-choice questions based on C++ output , which followed same marking scheme. Question were easy and most of the students were filtered out in this orund

Q1. Basic oops concepts and code to implement them.
Add your answer
Q2. Explain your projects, what technology, dataset you used ,challenges you faced.
Add your answer

Q1. What is the smart pointers?
Ans. 
Smart pointers are objects that store a pointer to dynamically allocated memory and provide automatic memory management.
• Smart pointers help prevent memory leaks by automatically releasing memory when the pointer is no longer needed.

• Examples include unique_ptr, shared_ptr, and weak_ptr in C++.

• unique_ptr is used for exclusive ownership, shared_ptr for shared ownership, and weak_ptr to break circular references.
Answered by AI
Add your answer
Q2. What is the lamda function?
Ans. 
A lambda function is a small anonymous function defined in a single line of code without a name.
• Lambda functions are often used in programming languages that support functional programming.

• They are commonly used for short, simple operations that do not require a named function.

• Lambda functions can take any number of arguments but can only have one expression.

• Example: lambda x: x*2 defines a lambda function that doubles
Answered by AI
Add your answer

Q1. What is threading?
Ans. 
Threading is a way for a program to split itself into multiple simultaneous tasks.
• Threading allows for parallel execution of tasks within a program.

• Each thread has its own stack and runs independently of other threads.

• Threads can communicate with each other and share resources.

• Example: A web server handling multiple client requests concurrently using threads.
Answered by AI
Add your answer
Q2. What is lamda function?
Ans. 
Lambda function is an anonymous function in programming that can have multiple parameters and can be used as an argument to other functions.
• Lambda functions are also known as anonymous functions because they do not have a name.

• They are often used for short, one-time tasks that do not require a separate function definition.

• Lambda functions can take multiple parameters and return a single value.

• Example: lambda x, y: x + ...read more
Answered by AI
Add your answer

MCQ(objective ) question... computer based exam about computer skills

They will give one concept and conduct debate candidates will speak argue advantage and disadvantage about that concept

Q1. Face to face technical round. They will ask what's html and what's python advantages of python ect....
Ans. Hyper text markup language, it will used for creating website and designing website
Answered Anonymously
Add your answer

Q1. Finally Hr round...face to face interview
Add your answer
Q2. Why we would hiring u
Add your answer
Q3. Why are you selecting this job
Add your answer
Q4. What you expect about your salary
Add your answer

Apti quest normal maths english

Medium leetchode question

Q1. Frequency of character
Ans. 
The question is asking about how often each character appears in a given string.
• Iterate through the string and count the frequency of each character using a hashmap.

• Return the hashmap with characters as keys and their frequencies as values.
Answered by AI
Add your answer

Q1. Basic and advanced concepts
Add your answer

It was open coding contest called Ode 2 Code organised on hackerearth. Top 100 students got interview calls

Q1. This was a 1:1 online technical interview.
Add your answer
Q2. Basic question on web development, regarding projects in resume. 1 problem solving question and DSA basics
Add your answer
Q3. I was asked to explain merge sort
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.
• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer