Oges Infotech Software Engineer Trainee Interview Questions and Answers for Freshers

Giva a Full stack project. based on MERN AND MEAN stack

Q1. Dsa , were easy to medium
Add your answer
Q2. Some backend and azure related questions
Add your answer

Q1. 3 Basic DSA Questions
Add your answer
Q2. 1st Math based coding question
Ans. Can solve with normal loops and some if-else statements.
Answered Anonymously
Add your answer
Q3. 2nd String based
Ans. String manipulation and Traversal meanwhile keep tracking the max answer.
Answered Anonymously
Add your answer
Q4. 3rd Array Sorting Algorithm
Ans. 
Quick Sort is a popular in-place sorting algorithm that uses divide and conquer approach.
• Divide the array into two sub-arrays based on a pivot element

• Recursively sort the sub-arrays

• Combine the sorted sub-arrays to get the final sorted array

• Time complexity: O(nlogn) in average case and O(n^2) in worst case

• Space complexity: O(logn)

• Example: [5, 2, 9, 3, 7, 6, 8] -> [2, 3, 5, 6, 7, 8, 9]
Answered by AI
View 1 more answer
Q5. There was an Introduction too in starting.
Add your answer

Q1. Introduce Yourself
Ans. 
I am a software enthusiast with a passion for coding and problem-solving.
• I have a degree in Computer Science and Engineering.

• I have experience in programming languages such as Java, Python, and C++.

• I have worked on projects involving web development, data analysis, and machine learning.

• I am a quick learner and enjoy working in a team environment.
Answered by AI
View 1 more answer
Q2. Why should I hire you?
Ans. 
I am a quick learner with a passion for software development and a strong work ethic.
• I have a solid understanding of programming concepts and experience with multiple programming languages.

• I am a team player and enjoy collaborating with others to solve problems.

• I am highly motivated and always strive to improve my skills and knowledge.

• I have completed several projects on my own and am eager to apply my skills in a prof
Answered by AI
View 1 more answer

2 ( 1 medium + 1 hard ) coding questions , 2 ( 1 medium + 1 easy ) sql questions, 10 MCQS( os, cn, dbms, aptitude ).

Q1. 1 easy coding and design problem on how would you design a web app like book my show.
Add your answer

JavaScript, React Js

Q1. How many years of relevant experience
Add your answer
Q2. What is your current CTC
Add your answer
Q3. What is your Expectation
Add your answer

Q1. What is your Strength
Add your answer
Q2. What is weakness
Ans. 
One weakness I have is that I can be overly critical of my own work, which can sometimes lead to self-doubt.
• I tend to overthink things and can be indecisive at times

• I have a tendency to take on too many tasks at once, leading to feeling overwhelmed

• I struggle with public speaking and often get nervous in front of large groups
Answered by AI
Add your answer
Q3. What is your Goal
Add your answer

It was on Coder Byte , Easy String question

Q1. They asked Introduction and asked one coding question based on string-easy level question
Add your answer

It has general aptitude questions with moderate difficulty

It was mixed coding plus SQL question after the exam I had explain my solution.

Basic questions of c

Q1. Basic questions about test
Add your answer

Q1. About myself and why not mnc
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

This was the MCQ round and consisted of 19 MCQ's.

Q1. 
MCQ’s(Total -19)
Topics:trees(5), semaphores(3), deadlocks(5) and algorithms(6)
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round and was held after the aptitude and GD round. It was in the evening. 
 

Q1. Detect loop
  Detect loop in a linked list.
Ans. 
• Firstly I gave the interviewer a hashing solution but that was taking extra space so the interviewer asked me to reduce its time complexity thereafter I gave him the Floyd algorithm approach using two pointers that are fast and slow.
Answered by CodingNinjas
Add your answer
Q2. MergeSort Linked List
Merge sort on Linked List.
Ans. 
• It was a simple one, I firstly explained to him the approach of merge sort using recursion and then wrote him a proper neat and clean code on paper.
Answered by CodingNinjas
Add your answer