AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
GivingForce Technologies SDE Interview Questions and Answers
GivingForce Technologies SDE Interview Experiences
1 interview found
(1 Question)
- Q1. Can there be multiple index on a table?
- Ans.
Yes, multiple indexes can be created on a table to improve query performance.
Multiple indexes can be created on a table to speed up data retrieval for different types of queries.
Each index can be created on one or more columns of the table.
Indexes can be unique or non-unique, depending on the requirements.
Examples: creating separate indexes on 'name' and 'age' columns of a 'users' table.
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
18 Questions
- Q1. Detail questions on copy constructors were asked
- Q2. Deep copy, shallow copy (need for explicitly writing copy constructor)
- Ans.
Deep copy creates a new object with its own copies of the original's data, while shallow copy shares references to the original's data.
Shallow Copy: Copies the reference of an object, not the actual object. Example: `List<int> shallow = original;`
Deep Copy: Creates a new object and recursively copies all objects found in the original. Example: `List<int> deep = new List<int>(original);`
Need for Copy C...
- Q3. Operating system concepts such as memory Management and semaphores, critical section
- Q4. Overloading, Overriding(Function and operator both)
- Q5. Virtual Functions
- Q6. Resume based interview
- Q7. Some more discussions on virtual classes and functions, overloading, overriding, copy constructors
- Q8. Puzzles such as no of 0s in 100!, and water- jug problem
- Q9. Merge two double linked list. What will be the difference if they are singly linked list
- Ans.
To merge two double linked lists, traverse to the end of the first list and connect it to the head of the second list.
Traverse to the end of the first list
Connect the last node of the first list to the head of the second list
If the lists are singly linked, we need to traverse to the end of the first list and connect it to the head of the second list. But we also need to keep track of the last node of the first list to ...
- Q10. Make a data structure such that it can store an image dynamically
- Ans.
A dynamic data structure for storing images as arrays of strings.
Use a 2D array of strings to represent the image pixels.
Implement resizing methods to adjust the size of the image.
Include methods for adding, removing, and modifying pixels.
Consider using compression techniques to reduce memory usage.
Support various image formats such as JPEG, PNG, and BMP.
- Q11. Copy fixed no of bytes from source to destination and its test cases( ex: copy(source, destination,bytes) so now command copy(a,a+3,8) will not give correct results in some cases and copy(a,a-4,8) will n...
- Ans.
Copying fixed number of bytes from source to destination and its test cases.
Ensure source and destination are not overlapping
Check if the number of bytes to be copied is greater than the available space in the destination
Handle cases where source or destination is NULL
Test cases should cover all possible scenarios including edge cases
- Q12. Some puzzles like weighing problem..N Balls given all of same weight except one..What is the max value of N so that u can figure out the ball with less weight in 2 rounds or 3 rounds
- Q13. Some HR questions about family and yourself
- Q14. Detail discussion on virtual functions
- Q15. Optimized fibonacci program
- Ans.
An optimized Fibonacci program computes Fibonacci numbers efficiently.
Use memoization to store previously computed values.
Use iterative approach instead of recursive approach.
Use bitwise operators to perform arithmetic operations faster.
Use matrix exponentiation to compute Fibonacci numbers in logarithmic time.
- Q16. Solution for solving problems generated by virtual functions
- Ans.
Virtual functions can cause problems due to their dynamic nature, but can be solved using various techniques.
Use pure virtual functions to ensure all derived classes implement the function
Use interface classes to define a common interface for all derived classes
Use smart pointers to manage memory and avoid memory leaks
Use virtual destructors to ensure proper destruction of objects
Avoid excessive use of virtual function...
- Q17. Some good questions on compile time error check, link time error check and run time error check
- Q18. One Image puzzle
Interview Preparation Tips
Skills evaluated in this interview
Online coding test with 2 coding questions
(1 Question)
- Q1. What is storage differnece for files in ram
- Ans.
Files in RAM are stored temporarily for quick access by the CPU.
RAM (Random Access Memory) is volatile memory used for temporary storage of data and instructions.
Files stored in RAM are accessed much faster than files stored on a hard drive.
RAM is cleared when the computer is turned off, so files stored in RAM are not persistent.
Examples of files stored in RAM include open applications, running processes, and cached da...
Skills evaluated in this interview
Selected
I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.
Aptitude and technical questions
2 coding questions with choice of language
(2 Questions)
- Q1. Technical questions
- Q2. Programming questions
I applied via Referral and was interviewed in Feb 2024. There were 2 interview rounds.
(2 Questions)
- Q1. Leetcode- Climb stairs (medium)
- Ans.
Climb stairs problem involves finding the number of ways to reach the top of a staircase with 1 or 2 steps at a time.
Dynamic Programming approach can be used to solve this problem efficiently.
Base cases: If there are 0 stairs, there's 1 way (do nothing). If 1 stair, there's also 1 way (1 step).
For n stairs, the number of ways to reach the top is the sum of ways to reach (n-1) and (n-2) stairs.
Example: For 3 stairs, way...
- Q2. Reverse linkedlist
- Ans.
Reversing a linked list involves changing the direction of the pointers between nodes.
Iterative approach: Use three pointers (prev, current, next) to reverse links.
Example: For list 1 -> 2 -> 3, after reversal it becomes 3 -> 2 -> 1.
Recursive approach: Reverse the rest of the list and adjust pointers.
Example: Base case is when the list is empty or has one node.
(1 Question)
- Q1. Leetcode- Rotten oranges matrix
- Ans.
Rotten oranges problem involves finding the time to rot all oranges in a grid.
Use BFS to spread the rot from initially rotten oranges.
Track the number of minutes taken to rot all oranges.
If any fresh oranges remain after BFS, return -1.
Example: In a 3x3 grid, rotten oranges at (0,0) can rot (0,1) in 1 minute.
kilari harshavardhan
Basic dp and graph questions
(2 Questions)
- Q1. Left leaf nodes sum in a binary tree
- Ans.
Calculate the sum of all left leaf nodes in a binary tree.
Traverse the binary tree using depth-first search (DFS)
Check if a node is a leaf node and if it is a left child
Add the value of the left leaf node to the sum
Recursively traverse the left and right subtrees
- Q2. About my past projects
(1 Question)
- Q1. Discussion about myself and my projects
Interview Preparation Tips
Skills evaluated in this interview
DSA,COMPUTER FUNDAMENTALS
(1 Question)
- Q1. TELL ABOUT TREE TRAVERSALS
- Ans.
Tree traversals are methods used to visit each node in a tree data structure in a specific order.
Inorder traversal: Visit left subtree, then root, then right subtree
Preorder traversal: Visit root, then left subtree, then right subtree
Postorder traversal: Visit left subtree, then right subtree, then root
Skills evaluated in this interview
Selected
I applied via LinkedIn and was interviewed in Nov 2022. There were 3 interview rounds.
General questions like reasoning and maths
General DSA questions were asked like Linked list etc
Interview Preparation Tips
Software Engineer Interview Questions & Answers
Oracle Financial Services Software
Anonymous
posted on 22 May 2022
I applied via LinkedIn and was interviewed before May 2021. There was 1 interview round.
(1 Question)
- Q1. Basics in Java, Microservices & Spring boot
Interview Preparation Tips
Interview Questionnaire
9 Questions
- Q1. System design of traffic signal
- Ans.
Design a traffic signal system
Identify the number of lanes and intersections
Determine the traffic flow and peak hours
Choose appropriate sensors and controllers
Implement a synchronization algorithm
Consider emergency vehicle prioritization
Include pedestrian crossing signals
Ensure compliance with local regulations
- Q2. Data structures
- Q3. Oops spring jdbc
- Q4. Hashmap implementation
- Ans.
Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.
Hashmap uses hashing function to map keys to indices in an array
Collisions can occur when multiple keys map to the same index, which can be resolved using separate chaining or open addressing
Java implementation: HashMap<String, Integer> map = new HashMap<>();
- Q5. Pattern printing code
- Ans.
Printing patterns using code
Identify the pattern to be printed
Use loops to print the pattern
Adjust the loop variables to control the pattern
Use conditional statements to modify the pattern
Examples: printing stars, triangles, squares, etc.
- Q6. Common point in linked list
- Ans.
Common point in linked list refers to the node where two or more linked lists intersect.
The common point can be found by traversing both linked lists and comparing the nodes.
The common point can also be found by using two pointers, one for each linked list, and moving them until they meet at the common point.
Examples include finding the intersection point of two linked lists or finding the loop in a linked list.
- Q7. Optimization
- Q8. Synchronisation
- Q9. Threads
Skills evaluated in this interview
GivingForce Technologies Interview FAQs
Tell us how to improve this page.
Overall Interview Experience Rating
based on 1 interview experience
Interview Questions from Similar Companies
|
Software Engineer
4
salaries
|  ₹4.2 L/yr - ₹6.6 L/yr |
|
Technical Product Analyst
4
salaries
| ₹12 L/yr - ₹19.5 L/yr |
|
QA Engineer
3
salaries
| ₹4.7 L/yr - ₹7 L/yr |
|
Senior Software Developer
3
salaries
| ₹9 L/yr - ₹10.2 L/yr |
|
Technical Manager
3
salaries
| ₹16.5 L/yr - ₹23 L/yr |
Oracle
KPIT Technologies
Intellect Design Arena
Oracle Cerner
- Home >
- Interviews >
- GivingForce Technologies Interview Questions
