RubicoIT Software Engineer Interview Questions and Answers

Consists of 3 sections: maths, english and C/C++ questions

Q1. Questions based on C/C++ coding.
Add your answer
Q2. Sorting, recursion and other coding questions asked.
Add your answer

Q1. What is your family background?
Add your answer
Q2. Where do you see yourself in 5 years?
Add your answer
Q3. Tell me about yourself.
Add your answer

Q1. Inheritance, Contructord, Polymorphism etc
Add your answer

Q1. Exception Handing, Datatypes, Unix, Sql
Add your answer

Easy and moderate level quantitative and verbal questions

Q1. String manipulation
Add your answer
Q2. OOPS based concepts
Add your answer

Q1. Company's culture
Ans. 
Company culture emphasizes collaboration, innovation, and inclusivity, fostering a supportive environment for all employees.
• Teamwork is encouraged through regular collaborative projects, enhancing communication and problem-solving skills.

• Innovation is celebrated with hackathons and idea-sharing sessions, allowing employees to contribute creatively.

• Inclusivity is prioritized, with diverse hiring practices and employee r...read more
Answered by AI
Add your answer
Q2. Salary negotiations
Add your answer

Aptitude Test Time limit was neary 1hr

Q1. Basics of C,Networking and Some C programming.
Add your answer

Q1. Bit manipulation and it's importance
Ans. 
Bit manipulation is the process of manipulating individual bits in a binary number.
• Efficient for tasks like setting, clearing, or toggling specific bits in a binary number

• Used in tasks like encryption, compression, and optimization algorithms

• Can be used to perform arithmetic operations like addition, subtraction, and multiplication
Answered by AI
Add your answer

Q1. Python basics and modules
Add your answer
Q2. Networking protocols basic networking
Add your answer

Q1. 2D array implementation
Add your answer
Q2. Binary search in array
Ans. 
Binary search is an efficient algorithm for finding an item from a sorted array by repeatedly dividing the search interval in half.
• 1. Precondition: The array must be sorted for binary search to work.

• 2. Start with two pointers: low (beginning) and high (end) of the array.

• 3. Calculate the middle index: mid = (low + high) / 2.

• 4. Compare the target value with the middle element:

• - If equal, return the index.

• - If targe...read more
Answered by AI
Add your answer

Q1. 1. C basics 2. Bitwise operators 3. Pointers 4. Embedded protocols 5. Linux Commands
Add your answer