IVP (India) Interview Questions, Process, and Tips for Freshers

MCQ round on OOPS (java) , JS, C#, SQL(dbms)

Q1. Two DSA questions , Happy Number (leetcode Q.202) , First Unique character in String (leetcode Q.387)
Add your answer
Q2. Polymorphism, Function Overloading & Overriding (code), Constructor, Access Specifier
Add your answer
Q3. Project (about nextjs, diff. b/w next & react, advantage of nextjs, SPA, some discussion about tailwind, miui (library), js)
Add your answer
Q4. DBMS query of second highest employee , find employeeid of manager whose employee name is 'something' (based on self join & only one table)
Ans. 
Use self join in a DBMS query to find the employeeid of the manager whose employee name is 'something'.
• Use a self join on the table to compare employee and manager names

• Order the results by employeeid in descending order to get the second highest employee

• Select the manager's employeeid where the employee name is 'something'
Answered by AI
Add your answer

Tricky questions from js, sql, c#

Q1. Uses of B Tree
Ans. 
B Trees are used for indexing in databases and file systems.
• Used for efficient searching, insertion, and deletion operations in databases.

• Helps in maintaining sorted data for quick retrieval.

• Commonly used in file systems to store large amounts of data efficiently.

• Each node in a B Tree can have multiple children, reducing the height of the tree.
Answered by AI
Add your answer
Q2. What is CTE in sql
Ans. 
CTE stands for Common Table Expression in SQL, used to create temporary result sets that can be referenced within a SELECT, INSERT, UPDATE, or DELETE statement.
• CTEs improve readability and maintainability of complex queries

• CTEs can be recursive, allowing for hierarchical data querying

• CTEs are defined using the WITH keyword followed by the CTE name and query
Answered by AI
Add your answer

Q1. Program to reverse a linked list
Ans. 
Reverse a linked list by changing the next pointers of each node to point to the previous node.
• Start with three pointers: current, prev, and next.

• Iterate through the linked list, updating the next pointers to point to the previous node.

• Update prev, current, and next pointers in each iteration until the end of the list is reached.
Answered by AI
Add your answer
Q2. Puzzles from geeksforgeeks
Add your answer

Q1. General HR questions like difficulties, strength weakness etc.
Add your answer