NexTurn Data Engineer Interview Questions and Answers

Q1. Question on sql and other stuff
Add your answer

Q1. Question on sql and other stuff
Add your answer

Q1. Question on sql and queries
Add your answer

Q1. 1) What is internal mechanism in spark . 2) tungsten project in spark explanation 3) sql problem to check where last two transaction belongs to particular retail
Ans. 
Questions related to Spark internals, Tungsten project, and SQL problem for retail transactions.
• Spark's internal mechanism includes components like Spark Core, Spark SQL, Spark Streaming, and MLlib.

• Tungsten project in Spark aims to improve the performance of Spark by optimizing memory usage and CPU utilization.

• To solve the SQL problem, we can use a query to filter transactions for a particular retail and then use the '...read more
Answered by AI
Add your answer

Q1. 1) scenario based question like , if a. job is launched with single executor will there be shuffling
Add your answer

Hackerrank test with medium level DSA and SQL questions

Q1. SQL joins and window functions
Add your answer
Q2. Big data optimisation techniques
Ans. 
Big data optimisation techniques involve strategies to improve the performance and efficiency of processing large volumes of data.
• Use of distributed computing frameworks like Hadoop and Spark to process data in parallel

• Implementing data compression techniques to reduce storage requirements

• Utilizing indexing and partitioning to optimize query performance

• Applying data pruning and filtering to reduce unnecessary data proc...read more
Answered by AI
Add your answer
Q3. DSA Medium level
Add your answer

Q1. Big data Eco system
Add your answer
Q2. SQL and Python related
Add your answer

Q1. Managerial round on a specific use case designing
Add your answer

1 hr medium level DSA questions

Q1. DFS in tree Data Structure
Ans. 
DFS (Depth First Search) is a traversal algorithm used in tree data structures to explore as far as possible along each branch before backtracking.
• DFS starts at the root node and explores as far as possible along each branch before backtracking.

• It uses a stack to keep track of nodes to visit next.

• DFS can be implemented recursively or iteratively.

• Example: In a binary tree, DFS would visit the left child of a node before
Answered by AI
Add your answer
Q2. SQL normalisation types and explanation
Ans. 
SQL normalisation types include 1NF, 2NF, 3NF, BCNF, and 4NF, each with specific rules for eliminating data redundancy.
• 1NF (First Normal Form) - Each column in a table must contain atomic values, and there should be no repeating groups.

• 2NF (Second Normal Form) - Table should be in 1NF and all non-key attributes should be fully functionally dependent on the primary key.

• 3NF (Third Normal Form) - Table should be in 2NF an...read more
Answered by AI
Add your answer

Q1. Preferred Location
Ans. 
I am open to opportunities in various locations, depending on the job offer and company culture.
• Open to relocation for the right opportunity

• Prefer locations with good work-life balance

• Interested in cities with strong tech communities
Answered by AI
Add your answer
Q2. About the company
Add your answer