Genzeon Corporation Web Engineer Interview Questions and Answers

In the coding test, there were 2 problems based on arrays and hashing (easy to medium level leetcode)

Q1. Several OOP questions were asked.... like, Can we have a class inside an interface? Can we have a static constructor? Can we have multiple main methods?
Add your answer
Q2. DBMS question: Normalization questions and keys concepts.
Add your answer

Q1. DSA question (stack based) You have a stack full of numbers, you have to arrange them in ascending order in the same stack without using any other data structure.
Add your answer
Q2. OS and DBMS questions(sharding, semaphores, etc.)
Add your answer

Q1. Questions based on Consultadd principles.
Add your answer

Easy applitute question with 1 coding question at the end

Q1. String builder vs string buffer
Ans. 
String builder is faster but not thread-safe, while string buffer is slower but thread-safe.
• String builder is recommended for single-threaded applications for better performance.

• String buffer is recommended for multi-threaded applications to ensure thread safety.

• Example: StringBuilder sb = new StringBuilder(); StringBuffer sbf = new StringBuffer();
Answered by AI
Add your answer
Q2. Final keyword in oops
Ans. 
The final keyword in OOP is used to restrict the user from changing the value of a variable, overriding a method, or inheriting from a class.
• Final variable: value cannot be changed once assigned

• Final method: cannot be overridden in child classes

• Final class: cannot be inherited by other classes
Answered by AI
Add your answer
Q3. Bsf graph explanation
Ans. 
BSF graph explanation
• BFS (Breadth-First Search) is a graph traversal algorithm that explores all the neighbor nodes at the present depth before moving on to the nodes at the next depth.

• It uses a queue data structure to keep track of the nodes to visit next.

• BFS is often used to find the shortest path in an unweighted graph.

• Example: BFS can be used to find the shortest path in a maze from the starting point to the exit.
Answered by AI
Add your answer

Q1. A Lot of OOPS and Virtual concept
Add your answer
Q2. Basic SQL till joins
Add your answer
Q3. Java script medium
Add your answer
Q4. C# oops output based
Add your answer

Dsa problems dp and tress problem

Q1. Tell me about your self
Ans. 
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
• 5 years of experience in software development

• Proficient in developing web applications

• Skilled in using various technologies

• Passionate about software engineering
Answered by AI
Add your answer
Q2. Projects and intership
Add your answer

Q1. Phone screen about previous experience
Add your answer

Q1. Mobile app development basics
Add your answer

Q1. Culture fit questions
Add your answer

Q1. About the project. and asked what i did in project. how to create schema in pyspark. what is ADE. what are the difficulties i faced in project. what is spark submit command how we write sparksubmit command...read more
Add your answer
Q2. No of occurrences of letter in a string.
Ans. 
Count occurrences of a letter in a string.
• Iterate through each character in the string and count occurrences of the specified letter.

• Use a hashmap to store the count of each letter.

• Handle both uppercase and lowercase letters to ensure accurate counting.
Answered by AI
Add your answer

Basics of python , java ,oops, dbms