Oracle Interview Experience (On-Campus)
Last Updated :
11 Oct, 2024
OMCS: Oracle had come to my college for recruiting and the process took around 10 to 12 days. The unit which had come to our college was OMCS( Oracle managed cloud services). Initially, we had to fill a Google form that was sent by our placement department. I got a mail regarding the online assessment on the 17th of September and the test was on the 18th of the same month. The mail consisted of details such as invite code and instructions as the process was online.
Online assessment: The duration of the test was 107mins. There were sections and each section had a fixed time. There were questions based on time and work, age, probability, combinations, pattern recognition, logical reasoning, comprehension, data structures, predict the output kind of questions.
Tip: revise avl trees.
26 students from my college were selected for the interview, and I was one among them. There was a pre-placement talk on the day of the interview where they told us about the company, the role which they had offered, and they shared their experiences.
1st round: This was a technical round there were two panelists. They asked me to brief about my projects, since most of my projects were on CPP they asked few questions on object-oriented programming concepts like polymorphism, data abstraction, inheritance. Few questions on data structures which were on stacks and queues. I was asked to explain the bubble sort, and they asked about the time complexities. An editor was shared, and I was given two questions to solve.
- I was given 2 numbers and they asked me to write a code that prints the prime numbers between that range.
- I was given a string and asked to replace the dot with comma and comma with a dot.
2nd round: In this round, they asked a few questions on cloud and database.Few questions on programming languages, the difference between CPP and python. At which age did you decide that you want to become a programmer. He asked me to explain 2 of my projects in detail. He told more about the company their cloud solutions, how they work, what they do. The problems which I had faced in the completion of the project and how did I overcome those.
3rd round: This round began with the introduction and the typical question tell me about yourself. Later he asked my experience of previous rounds and the names of the panel members. I was asked a real-time application of the project and how I could improve the performance of one of my programs. I was asked what inspired me to do these projects as most of them were done on holidays but not in teams. I was asked about the objective(goal) of my life which was followed by the question of where do you see yourself in 5 years coming down the lane. I was asked about my interests and hobbies and later he briefed about the work culture of the company and the products upon which they were working.
Result: I was selected.
Advice: If you are selected for the interview drink a lot of water or keep a bottle beside you because you have to speak a lot!
Similar Reads
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Heap Sort - Data Structures and Algorithms Tutorials Heap sort is a comparison-based sorting technique based on Binary Heap Data Structure. It can be seen as an optimization over selection sort where we first find the max (or min) element and swap it with the last (or first). We repeat the same process for the remaining elements. In Heap Sort, we use
14 min read
Maximum Subarray Sum - Kadane's Algorithm Given an array arr[], the task is to find the subarray that has the maximum sum and return its sum.Examples:Input: arr[] = {2, 3, -8, 7, -1, 2, 3}Output: 11Explanation: The subarray {7, -1, 2, 3} has the largest sum 11.Input: arr[] = {-2, -4}Output: -2Explanation: The subarray {-2} has the largest s
9 min read
Window Functions in SQL SQL window functions are essential for advanced data analysis and database management. They enable calculations across a specific set of rows, known as a "window," while retaining the individual rows in the dataset. Unlike traditional aggregate functions that summarize data for the entire group, win
7 min read
KMP Algorithm for Pattern Searching Given two strings txt and pat, the task is to return all indices of occurrences of pat within txt. Examples:Input: txt = "abcab", pat = "ab"Output: [0, 3]Explanation: The string "ab" occurs twice in txt, first occurrence starts from index 0 and second from index 3.Input: txt= "aabaacaadaabaaba", pat
14 min read
Detect Cycle in a Directed Graph Given the number of vertices V and a list of directed edges, determine whether the graph contains a cycle or not.Examples: Input: V = 4, edges[][] = [[0, 1], [0, 2], [1, 2], [2, 0], [2, 3]]Cycle: 0 → 2 → 0 Output: trueExplanation: The diagram clearly shows a cycle 0 → 2 → 0 Input: V = 4, edges[][] =
15+ min read
Top HR Interview Questions and Answers (2025) HR interviews can be daunting but they don’t have to be. The bottom line in most hiring processes entails testing the personality of a candidate for their communication traits and company culture fit. Being at the initial or experienced levels of your career being prepared for commonly asked fresher
15+ min read
Insertion in an AVL Tree AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. Example of AVL Tree: The above tree is AVL because the differences between the heights of left and right subtrees for every node are less than
15+ min read
Check if a number is Palindrome Given an integer n, find whether the number is Palindrome or not. A number is a Palindrome if it remains the same when its digits are reversed.Examples:Input: n = 12321Output: YesExplanation: 12321 is a Palindrome number because after reversing its digits, the number becomes 12321 which is the same
7 min read