Carl Zeiss Data Engineer Interview Questions and Answers

Q1. Basic fundamentals of cs, dsa
Add your answer
Q2. Puzzles, os concepts
Add your answer

Technical plus aptitude based on domain you choose( pre placemt talks)

Q1. Communication theory , aptitude, electronics basics for firmware domain(screening)
Add your answer
Q2. Coding related questions
Add your answer

Q1. Circuits related practical questions
Add your answer

Q1. General things only
Add your answer

Profit and loss ,time and work ,speed distance and time

Java ,ops ,collection frameworks

2 problem was given to solve
1) Smallest Negative balance - -----%20America%20-%20Weekly%20Algorithm%20Challenges/Week%2021%20Algorithm%20Challenge/Smallest%20Negative%20Balance.md
2) Find the absolute difference between alpha & beta from the array.
Alpha -An element k in a array occurs k consecutive time
Beta - An element k in an array occurs k consecutive time starting from index k

Sample input
Arr[] = {2,2,2,4,4,4,4,1,2,2]
Output
Alpha - 3
Beta - 1
Absolute difference - 1

Note : consider array index starts with 1

Quantitative Questions
Computer Science core MCQ questions
2 Coding Questions

Q1. Explain Projects mentioned on resume
Ans. 
Developed a web application for tracking inventory and sales data
• Used React.js for front-end development

• Implemented RESTful APIs for backend using Node.js

• Utilized MongoDB for database management
Answered by AI
Add your answer
Q2. Questions based on Linked List
Add your answer

Q1. Add two linked list
Ans. 
To add two linked lists, iterate through both lists simultaneously and add corresponding nodes, considering carry from previous addition.
• Create a dummy node to hold the result.

• Initialize current node to dummy node.

• Iterate through both lists, adding values and carry from previous addition.

• Move to next nodes in both lists.

• Handle cases where one list is longer than the other.

• Handle final carry if present.
Answered by AI
Add your answer
Q2. Find shortest path in graph
Ans. 
Use Dijkstra's algorithm to find the shortest path in a graph
• Implement Dijkstra's algorithm to find the shortest path between two nodes in a graph

• Maintain a priority queue to keep track of the shortest distance to each node

• Update the shortest distance to each node as you traverse the graph

• Track the path by storing the previous node for each node visited
Answered by AI
Add your answer

Q1. Check tree is BST
Ans. 
Check if a binary tree is a Binary Search Tree (BST)
• Perform an in-order traversal of the tree and check if the resulting array is sorted

• Keep track of the previous node value during traversal to compare with the current node value

• Ensure that each node's value is greater than the previous node's value in the in-order traversal
Answered by AI
Add your answer
Q2. Check substring palindrome or not
Ans. 
Check if a substring in an array of strings is a palindrome or not.
• Iterate through each string in the array

• For each string, check if any of its substrings are palindromes

• Return true if a palindrome substring is found, false otherwise
Answered by AI
Add your answer

Few standard dsa questions were asked.

Q1. Explain projects
Ans. 
Projects are specific tasks or assignments that require a set of skills and resources to achieve a particular goal or outcome.
• Projects involve defining objectives and deliverables

• They require planning, execution, and monitoring

• Projects often have timelines and budgets

• Examples: Data analysis project to identify customer trends, Project to implement a new software system
Answered by AI
Add your answer
Q2. Introduce urself
Ans. 
I am a data analyst with a strong background in statistics and data visualization.
• I have a Bachelor's degree in Statistics from XYZ University.

• I have 3 years of experience working as a data analyst at ABC Company.

• Proficient in using tools like Excel, SQL, and Tableau for data analysis.

• I have experience in creating reports and dashboards to present data insights to stakeholders.
Answered by AI
Add your answer