Zenon Software Engineer Interview Questions and Answers

Offline test of 3 sections, 1st aptitude, 2nd coding and 3rd dbms

Q1. 2 technical rounds. Question were about trees, sql, oops etc
Add your answer
Q2. Buid a binary tree
Ans. 
A binary tree is a data structure where each node has at most two children.
• Start by creating a Node class with left and right child pointers.

• Implement methods to insert nodes, search for a specific value, and traverse the tree (inorder, preorder, postorder).

• Consider edge cases like inserting duplicate values or handling empty trees.
Answered by AI
Add your answer
Q3. Save bst to disk
Ans. 
To save a binary search tree (BST) to disk, you can serialize the tree and write it to a file.
• Serialize the BST using pre-order, in-order, or post-order traversal

• Write the serialized data to a file on disk

• When reading the data back, deserialize it to reconstruct the BST
Answered by AI
Add your answer
Q4. Sql queries, specially joins
Add your answer
Q5. Infinite stream of numbers, store 10 maximum number. (Heap)
Ans. 
Use a max heap to store the 10 maximum numbers from an infinite stream of numbers.
• Implement a max heap data structure to keep track of the 10 maximum numbers.

• As new numbers come in from the infinite stream, compare them with the root of the heap.

• If the new number is greater than the root, replace the root with the new number and heapify.

• Keep the heap size limited to 10 to store only the 10 maximum numbers.
Answered by AI
Add your answer