i
IBS Software Services
Filter interviews by
I applied via LinkedIn and was interviewed in Mar 2024. There were 2 interview rounds.
Top trending discussions
Prototype in JS refers to the mechanism by which objects in JavaScript inherit properties and methods from other objects.
Prototype chain allows objects to inherit properties and methods from other objects
Prototype-based inheritance is a key feature of JavaScript
Example: Creating a new object using a constructor function and adding methods to its prototype
I applied via Naukri.com and was interviewed before Jul 2023. There were 3 interview rounds.
Basic maths questions select answer from four question
Tge interview held on call basic
Figma then convert it into html
I applied via AmbitionBox and was interviewed in Jul 2023. There were 3 interview rounds.
Uging tag , elements, div, selector, flex box etc
Bootstrap is a front-end framework that helps in creating responsive websites by using a grid system and predefined classes.
Bootstrap provides a grid system with 12 columns that automatically adjusts based on screen size.
It includes responsive utility classes like 'd-none' and 'd-md-block' to show/hide content based on screen size.
Bootstrap also offers responsive navigation components like the navbar that collapses int
I appeared for an interview before Apr 2024, where I was asked the following questions.
UI/UX design focuses on enhancing user satisfaction through effective design and usability principles.
User-Centered Design: Prioritizing user needs and preferences in the design process. Example: Conducting user interviews.
Usability: Ensuring the product is easy to use. Example: Simplifying navigation in a mobile app.
Accessibility: Designing for users with disabilities. Example: Using alt text for images.
Visual Hierarc...
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DBMS.
Data integrity refers to the accuracy, consistency, and reliability of data throughout its lifecycle.
Data integrity ensures that data is accurate and consistent in storage and transmission.
It involves maintaining the quality and reliability of data over time.
Methods for ensuring data integrity include checksums, encryption, and error detection codes.
Examples of data integrity violations include data corruption, unautho
A trigger is a special type of stored procedure that automatically executes when certain events occur in a database.
Triggers are used to enforce business rules, maintain data integrity, and automate repetitive tasks.
They can be triggered by INSERT, UPDATE, or DELETE operations on a table.
Examples of triggers include auditing changes to a table, updating related tables when a record is modified, or enforcing referential
Clustered indexes physically order the data in the table, while non-clustered indexes do not.
Clustered indexes determine the physical order of data in the table, while non-clustered indexes do not.
A table can have only one clustered index, but multiple non-clustered indexes.
Clustered indexes are faster for retrieval of data, especially range queries, compared to non-clustered indexes.
Non-clustered indexes are stored se...
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions on DBMS.
UNION combines and removes duplicates, UNION ALL combines without removing duplicates.
UNION merges the result sets of two or more SELECT statements and removes duplicates.
UNION ALL merges the result sets of two or more SELECT statements without removing duplicates.
UNION is slower than UNION ALL as it involves removing duplicates.
Example: SELECT column1 FROM table1 UNION SELECT column1 FROM table2;
Example: SELECT column...
A cursor in PL/SQL is used to retrieve and process multiple rows of data one at a time.
Allows iteration over a result set
Retrieves data row by row
Can be used to update or delete rows in a table
Must be declared, opened, fetched, and closed
SQL query to fetch the nth highest salary from a table
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to fetch the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
This was a managerial round with typical behavioral problems.
Tip 1 : Since this was a SQL post, I would suggest you to get the basics intact and try practicing few queries.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview in Jan 2021.
To find the maximum length BST in a given binary tree.
Traverse the tree in post-order fashion
For each node, check if it satisfies the BST property
If it does, calculate the size of the BST rooted at that node
Keep track of the maximum size seen so far
Algorithm to find absolute max subsequence of an array with positive and negative numbers in O(n) time.
Initialize max_so_far and max_ending_here as 0
Loop through the array and for each element, add it to max_ending_here
If max_ending_here becomes negative, reset it to 0
If max_ending_here is greater than max_so_far, update max_so_far
Return max_so_far
Eliminate duplicates in an array of strings and print it in linear time complexity.
Use a hash set to keep track of unique elements
Iterate through the array and add non-duplicate elements to the hash set
Print the hash set elements to get the final array
Balancing of Btrees / AVL trees is important for efficient search and insertion operations.
Btrees and AVL trees are self-balancing binary search trees.
Balancing ensures that the height of the tree is minimized, leading to faster search and insertion operations.
Btrees are used in databases while AVL trees are used in memory.
Balancing is achieved by performing rotations and node splitting.
AVL trees have a stricter balanc...
139 teams in a knock-out tournament, find the number of matches to choose the champion.
In a knock-out tournament, each team plays only one match per round.
The number of matches required to choose the champion is one less than the number of teams.
Therefore, the number of matches required is 138.
My resume includes projects such as a web-based inventory management system and a mobile app for tracking fitness goals.
Developed a web-based inventory management system using PHP and MySQL
Created a mobile app for tracking fitness goals using React Native
Implemented RESTful APIs for communication between front-end and back-end
Utilized version control tools such as Git for collaborative development
Designed and implement...
Algorithm to mirror a given Binary Tree
Create a function to swap left and right child nodes of a given node
Recursively call the function on left and right child nodes
Base case: if node is null, return
Call the function on the root node of the binary tree
Find the next largest int with same number of 1's in binary.
Count the number of 1's in the binary representation of the given int.
Increment the given int until a number with the same number of 1's is found.
Return the next largest int with same number of 1's.
based on 1 interview
Interview experience
Senior Software Engineer
603
salaries
| ₹4.1 L/yr - ₹14 L/yr |
Software Engineer
424
salaries
| ₹2 L/yr - ₹9.5 L/yr |
Technical Lead
283
salaries
| ₹5.4 L/yr - ₹21 L/yr |
Solution Architect
210
salaries
| ₹8 L/yr - ₹30.6 L/yr |
Solution Engineer
197
salaries
| ₹3 L/yr - ₹7.5 L/yr |
KPIT Technologies
Thomson Reuters
Oracle Cerner
NextComm Corporation