Oracle Interview Experience | Campus Placements 2020

Online Test (150 mins): This round had certain sections. There was an additional constraint that in each section, one had to answer the questions in order. A candidate could not skip questions and re-attempt them later. The sections were based on the following:

  1. Aptitude
  2. DSA concepts
  3. CS courses concepts such as OS, DBMS, OOP
  4. English

Around 200 students appeared for the online test from which approximately 65 were selected for the technical interviews. 

Technical Interview 1: Due to coronavirus lockdown, the interviews were held on Zoom. 

  1. Explain Multithreading 
  2. Advantages/Disadvantages of Multithreaded vs. Single Process programs.

    Answer: Multithreaded – Can exploit the parallelism of a task and achieve a speedup. Also, the program can be logically divided into many threads which can then be developed individually. It will also make efficient use of memory and CPU time. However, multithreaded programs are harder to debug, and harder to write. 

    Single Process programs – Entire program has to be loaded at once, even though it has multiple components some of which will be used seldom. Thus, it leads to a waste of RAM. However, they are much easier to debug.



  3. What will happen if a thread dies?

    Answer: The master process must monitor the status of each thread and take appropriate action – abort the program, restart a thread.

  4. Given an array, for every index, compute the product of all elements of the array except the element at that index. Using the division operator is NOT ALLOWED.

    Answer: Maintain a prefix and suffix product array and calculate accordingly

  5. Puzzle question: When a man goes to a temple, he gives half of the flowers he has to the gatekeeper and 100 flowers to the gods. In this manner, after visiting 3 temples, he’s left with 0 flowers. How many flowers did he have to begin with?&

    Answer:

    f(f(f(N))) = 0, find N where f(N) = N/2 - 100 

Technical Interview 2:

  1. Explain heap and the various types of heaps
  2. Which data structure is convenient for performing BFS

    Answer: Queue.

  3. What are the possible implementations of a queue and which one would you prefer?

    Answer: Linked List and Array. I would prefer Linked List as array offers constant time random access which is not required. Array resizing would create overheads on insertions

  4. I was given an SQL query involving two tables which had to solved using LEFT JOIN
  5. Given an array of unique elements, design a function that will return a unique sequence of all its elements every time it is called&.

    Answer: Start with sorted order. The desired function would be the nextPermutation() function.

  6. Puzzle question: There is a book whose pages are numbered from 1-150. How many digits are used in enumerating all the pages?

Technical Interview 3:

  1. What is the best and worst-case time complexity of quicksort?
  2. For what type of input does the worst-case time complexity of quicksort occur?

    Answer: For input array in ascending or descending order

  3. Describe the phases of a compiler.
  4. Generate all Parenthesis – II from. The problem is Print all combinations of balanced parentheses

  5. Find the maximum subarray sum and also report the indices of the subarray

HR Round: This round was fairly straightforward. I was asked to talk about my technical interests, hobbies, and whether I was willing to relocate 

Verdict: Selected for the role of Server Technology Engineer.

Tips:

  1. Be calm and composed
  2. Be thorough with your CS subjects
  3. For puzzle questions, write down precise mathematical steps to make solving them easier
  4. Speak eloquently in the HR round


Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.


Article Tags :
Practice Tags :


1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.