ABG Cement Interview Questions and Answers

Round duration - 70 Minutes
Round difficulty - Medium

There were 5 people in the zoom meet, including me. Rest all 4 were interviewers, 3 from India and 1 from the United Kingdom.
They started with my introduction and then moved on to the questions from my resume, starting with my internship at Samsung Bangalore and then projects.
Then another interviewer asked about my weakness and strength. Then comes the turn of coding questions.
Starting with finding the minimum element in O(1) time, rotating the 2-D array by 90 degrees, OOPS questions were also asked like- polymorphism, abstraction, virtual class. Some OS questions were- cache, paging algorithms.
Then come my POR and other activities.

Q1. 
Kth Smallest Element Problem Statement
You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...read more
Ans. 
Find the K-th smallest element in an array of distinct integers.
• Sort the array and return the element at index K-1.

• Use a min-heap to find the K-th smallest element efficiently.

• Implement quickselect algorithm for optimal performance.
Answered by AI
Add your answer
Q2. 
Inplace Rotate Matrix 90 Degrees Anti-Clockwise
You are provided with a square matrix of non-negative integers of size 'N x N'. The task is to rotate this matrix by 90 degrees in an anti-clockwise directi...read more
Ans. 
Rotate a square matrix by 90 degrees anti-clockwise without using extra space.
• Iterate through each layer of the matrix from outer to inner layers

• Swap elements in groups of 4 to rotate the matrix in place

• Handle odd-sized matrices separately by adjusting the loop boundaries
Answered by AI
Add your answer
Q3. What are the page replacement algorithms in Operating Systems?
Ans. 
Page replacement algorithms are used in operating systems to decide which page to replace when a new page needs to be brought in.
• FIFO (First In, First Out) - replaces the oldest page in memory

• LRU (Least Recently Used) - replaces the page that has not been used for the longest time

• LFU (Least Frequently Used) - replaces the page that has been used the least number of times

• Optimal - replaces the page that will not be used
Answered by AI
Add your answer

Q1. It went well, results awaiting
Add your answer

Q1. On core subject, logical questions
Add your answer

Q1. About Bio, As per resume
Add your answer

Q1. Self and previous experience and about family
Add your answer

Q1. Privious salery expectation and joining dates
Add your answer

C, DS understanding and

C and C++ and domain knowledge

General aptitude test

Online coding test and aptitude

Q1. Dsa and memory management basics
Add your answer

Q1. Puzzles and Dsa
Add your answer

General Aptitude - Time Series, Probability & statistics

Q1. General Interview questions on Operator Overriding , Method Overloading
Add your answer

Q1. Questions were mainly focused on cloud and testing field
Add your answer

Q1. Write code on Merge sort
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts them, and then merges the sorted halves.
• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer

Q1. Explain on PCA , SVM and image processing concepts
Ans. 
PCA is a dimensionality reduction technique, SVM is a machine learning algorithm, and image processing involves manipulating images.
• PCA (Principal Component Analysis) is used to reduce the dimensionality of data by finding the most important features.

• SVM (Support Vector Machine) is a supervised machine learning algorithm used for classification and regression tasks.

• Image processing involves techniques like filtering, s...read more
Answered by AI
Add your answer

Q1. Tell me about your project challenges
Add your answer