AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Oracle
Compare
Filter interviews by
Clear (1)
Oracle Ofss Interview Questions and Answers
Oracle Ofss Interview Experiences
1 interview found
Interview Preparation Tips
The job profile offered to me was mainly financial. Some of the questions one should make sure to ask the interviewers is a detailed interpretation of what your job may entail and the various intricacies like the city where you will probably be working, the training period etc are must asked question.
Skill Tips: Be confident in your answers. Your personality is the first thing they try to assess and if you can come across as someone who is confident in his abilities, you immediately gain a head-start.
Overall, after observing other interview processes, I would have to say that my placement experience was relatively tension free. The interviewers did a great job in helping me relax and I don't really remember ever being stressed out during any of the rounds.
Skills:
College Name: NIT Surathkal
HCL Healthcare
Rated 4.5 for Work-Life Balance by our employees on AmbitionBox
Success to our employee's well-being? A work-life balance that's simply unbeatable.
Interview questions from similar companies
Anonymous
I applied via Campus Placement and was interviewed before Jul 2021. There were 4 interview rounds.
Aptitude test on CS subjects like C programming, DBMS, CN, and OS.
There were 2 input-output based questions of easy to moderate level
Every candidate was given an individual topic and was asked to speak on it
(1 Question)
- Q1. Some typical HR questions
Interview Preparation Tips
I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. Questions on Java,SQL,some trending technologies(IOT,Big data),pattern questions, programming questions with different approaches.
Interview Preparation Tips
I applied via Company Website and was interviewed before Jul 2021. There were 3 interview rounds.
Aptitude, reasoning, English, cloud sections
2 questions in which , one has to complete within an 50 minutes
(2 Questions)
- Q1. Tell me about t Yourself
- Q2. What are the previous experiences
Interview Preparation Tips
- Java
- SQL
- Agile Methodology
- SDLC
Keep it just and short
Explain more about your experiences
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. DS Algo Questions on Trees. Leadership Principles
Interview Preparation Tips
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
- Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
- Ans.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Interview Preparation Tips
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedSkills evaluated in this interview
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
(1 Question)
- Q1. Basic questions of java.
(1 Question)
- Q1. Intro and other hr related questions.
Interview Preparation Tips
SAMKIT JAIN
I was interviewed in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
Interview Questionnaire
20 Questions
- Q1. He asked me my specialization?
- Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
- Q3. He asked me to tell him about my favorite project
- Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
- Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
- Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
- Ans.
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
- Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
- Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
- Q9. Which are the four storage classes in C
- Ans.
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
- Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
- Ans.
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
- Q11. Question on polymorphisms
- Q12. He again went back to the first question he had asked me. Once again
- Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
- Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
- Ans.
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
- Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
- Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
- Q17. Finally, he asked me whether I had any questions
- Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
- Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
- Q20. We also talked a bit about my phone browser project
Interview Preparation Tips
Duration: 15 minutes
Total Questions: 1
Round: Test
Duration: 30 minutes
Total Questions: 2
Round: Test
Duration: 30 minutes
Total Questions: 3
Round: Test
Total Questions: 4
Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.
Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)
1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.
Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2. I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.
General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra
Skills evaluated in this interview
I applied via Company Website and was interviewed before Feb 2021. There were 3 interview rounds.
TNQT: TCS National Qualifier Test
(1 Question)
- Q1. All technical questions related to your project and basic understanding of any programming language. Basically questions from your resume will be asked.
(2 Questions)
- Q1. Tell me about yourself.
- Q2. What is your family background?
Interview Preparation Tips
Oracle Interview FAQs
Recently Viewed
PHOTOS
Medanta the Medicity
4 office photos
Tell us how to improve this page.
Oracle Interviews By Designations
- Oracle Software Developer Interview Questions
- Oracle Application Developer Interview Questions
- Oracle Software Engineer Interview Questions
- Oracle Senior Software Engineer Interview Questions
- Oracle Member Technical Staff Interview Questions
- Oracle Applications Engineer Interview Questions
- Oracle Senior Consultant Interview Questions
- Oracle Associate Consultant Interview Questions
- Show more
Interview Questions for Popular Designations
Sun Pharmaceutical Industries
Join us and thrive in a company culture that inspires and empowers.
Interview Questions from Similar Companies
Fast track your campus placements
|
Senior Software Engineer
2.3k
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Consultant
2.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Principal Consultant
2k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Member of Technical Staff
1.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Application Engineer
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
SAP
MongoDB
Salesforce
IBM
- Home >
- Interviews >
- Oracle Interview Questions >
- Oracle Ofss Interview Questions
