Fendahl Technology Graduate Trainee Interview Questions, Process, and Tips

(On campus) This round consists of two sections. 10 questions from Aptitude + Verbal (Trains , boats, interest, average, English error spotting) and 10 were pseudocodes of C mostly of loops and pointers. Pseudocode level was easy but apti was moderate.

This was pen and paper test. 2 questions were there 1. Valid parenthesis checker and 2. Fibonacci triangle pattern. Preferred language was C# C++ Java. Python was not preferred.

Q1. Interview begun with introduction. I told everything including projects hobbies internships academics etc.
Add your answer
Q2. Questions based on project: Java and PostgreSQL connection and why used postgresql?
Add your answer
Q3. What is data-table? How you retrieved data? Where is was stored after retrieving?
Ans. 
A data-table is a way to organize data in rows and columns. Data can be retrieved using SQL queries or programming languages.
• Data-table is a structured way to store data in rows and columns.

• Data can be retrieved using SQL queries like SELECT * FROM table_name.

• Data can also be retrieved using programming languages like Python or Java.

• After retrieving data, it is typically stored in memory for processing or analysis.
Answered by AI
Add your answer
Q4. OOPs concepts in details. Every basics of java was asked by him. (My preferred lang was JAVA). Basics must be strong for Fendhal.
Add your answer
Q5. SQL questions. Fendhal technology need strong SQL knowledge. He asked questions on CRUD, joints, aggregates,etc
Add your answer
Q6. HTML tags and basic css. (I was also having one web projects that's why he asked about web)
Add your answer
Q7. Write a program for printing prime numbers in given range
Ans. 
Program to print prime numbers in a given range
• Iterate through the range of numbers and check if each number is prime

• Use a nested loop to check for factors of each number

• Print the number if it has only 2 factors (1 and itself)
Answered by AI
Add your answer
Q8. Merge sort and selection difference. Explain merge sort working. Time complexities of some famous sorting algorithms.
Ans. 
Merge sort and selection sort are both sorting algorithms, but they differ in their approach and efficiency. Merge sort is a divide-and-conquer algorithm with a time complexity of O(n log n).
• Merge sort divides the array into two halves, sorts each half recursively, and then merges the sorted halves back together.

• Selection sort selects the smallest element from the unsorted portion of the array and swaps it with the fir...read more
Answered by AI
Add your answer
Q9. Ternary operator. How it differs from if else
Ans. 
Ternary operator is a shorthand for if-else statement in programming.
• Ternary operator is written as condition ? expression1 : expression2

• It is used to assign a value based on a condition in a more concise way

• If-else statement is written as if (condition) { expression1 } else { expression2 }
Answered by AI
Add your answer
Q10. Pre increment and post increment output questions he asked during the interview.
Add your answer