Oracle Member Technical Staff Interview Questions, Process, and Tips

Round duration - 30 minutes
Round difficulty - Easy

It was an easy round. They expect you to write a code and compile it successfully. Any online compiler was fine to them. Code merge sort, Few questions on STL/containers, collection, OOPS concept.

Q1. How does C++ support polymorphism?
Ans. 
C++ supports polymorphism through virtual functions and inheritance.
• C++ supports polymorphism through virtual functions and inheritance

• Virtual functions allow a function to be overridden in a derived class

• Base class pointers can point to derived class objects and call overridden functions

• Example: class Animal { virtual void speak() { cout << 'Animal speaks'; } }; class Dog : public Animal { void speak() { cout &l...read more
Answered by AI
Add your answer
Q2. What data structure is used by a Map?
Ans. 
Map uses a data structure called Hash Table for storing key-value pairs.
• Hash Table is a data structure that allows for fast retrieval of values based on keys.

• It uses a hash function to map keys to their corresponding values in an array.

• Common implementations include HashMap in Java and dict in Python.
Answered by AI
Add your answer
Q3. From which Standard Template Library (STL) can we insert or remove data from anywhere?
Ans. 
std::list from the C++ Standard Template Library (STL) allows insertion and removal of data from anywhere.
• std::list is a doubly linked list implementation in STL

• Elements can be inserted or removed from anywhere in the list efficiently

• Example: std::list<int> myList; myList.insert(myList.begin(), 5); myList.erase(myList.begin());
Answered by AI
Add your answer
Q4. 
Merge Sort Problem Statement
Given a sequence of numbers ARR, your task is to return a sorted sequence of ARR in non-descending order using the merge sort algorithm.
Explanation:
The Merge Sort Algorithm...read more
Ans. 
Implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.
• Divide the input array into two halves recursively until each subarray has only one element.

• Merge the sorted subarrays back together in non-descending order.

• Time complexity of merge sort is O(n log n) and space complexity is O(n).
Answered by AI
Add your answer
Q5. What are the various types of inheritance in Object-Oriented Programming?
Ans. 
The various types of inheritance in Object-Oriented Programming include single, multiple, multilevel, hierarchical, and hybrid inheritance.
• Single inheritance: a class can inherit from only one base class.

• Multiple inheritance: a class can inherit from multiple base classes.

• Multilevel inheritance: a class can inherit from a class which is also derived from another class.

• Hierarchical inheritance: multiple classes can inhe...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The interviewer asked me a few questions on my project. Few questions on OS and then one medium level coding question on dynamic programming.

Q1. 
Regular Expression Match Problem Statement
Given a string str and a string pat, where str may contain wildcard characters '?' and '*'.
If a character is '?', it can be replaced with any single character....read more
Ans. 
The task is to determine if it is possible to transform a string to match another string using wildcard characters '?' and '*'.
• Iterate through both strings simultaneously, handling wildcard characters '?' and '*' accordingly.

• Use dynamic programming to keep track of matching subproblems.

• Return true if at the end both strings match, false otherwise.
Answered by AI
Add your answer
Q2. Can you explain what a zombie process is?
Ans. 
A zombie process is a process that has completed execution but still has an entry in the process table.
• Zombie processes occur when a child process finishes execution before the parent process can collect its exit status.

• The zombie process remains in the process table until the parent process calls wait() system call to read its exit status.

• Zombie processes do not consume any system resources but can clutter the process
Answered by AI
Add your answer
Q3. What is thrashing in an operating system?
Ans. 
Thrashing in an operating system occurs when the system is spending more time swapping data between memory and disk than actually executing tasks.
• Occurs when the system is overwhelmed with too many processes demanding memory

• Results in excessive swapping of data between RAM and disk

• Leads to a decrease in system performance as CPU spends more time on swapping than executing tasks

• Can be alleviated by optimizing memory usa...read more
Answered by AI
Add your answer
Q4. What is a thread in an operating system?
Ans. 
A thread in an operating system is a basic unit of CPU utilization, representing a single sequence of execution within a process.
• Threads share the same memory space within a process.

• Threads can communicate with each other more easily than processes.

• Examples of operating systems that support threads include Windows, Linux, and macOS.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Discussion on my projects followed by a real-life problem on which I have to code the solution. A system design question on design what's app chat system. Code priority queue from scratch. Few questions on subjects like OS, CN were also asked. 

Q1. Design a WhatsApp chat system.
Ans. 
Design a WhatsApp chat system for real-time messaging.
• Use WebSocket for real-time communication

• Implement end-to-end encryption for security

• Allow users to send text, images, videos, and documents

• Include features like group chats, read receipts, and message forwarding
Answered by AI
Add your answer
Q2. 
Implementing a Priority Queue Using Heap
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...read more
Ans. 
Implement a priority queue using a heap data structure by completing the provided functions.
• Implement push() function to insert elements into the queue.

• Implement pop() function to remove the largest element from the queue.

• Implement getMaxElement() function to return the largest element.

• Implement isEmpty() function to check if the queue is empty.
Answered by AI
Add your answer
Q3. What are the differences between classful and classless addressing in computer networks?
Ans. 
Classful addressing uses fixed length subnet masks, while classless addressing allows for variable length subnet masks.
• Classful addressing divides IP addresses into classes (A, B, C, D, E) with fixed subnet masks.

• Classless addressing allows for more efficient use of IP addresses by using variable length subnet masks.

• Classful addressing can lead to wastage of IP addresses, while classless addressing is more flexible and...read more
Answered by AI
Add your answer
Q4. What is the difference between TCP and UDP?
Ans. 
TCP is a connection-oriented protocol that provides reliable data delivery, while UDP is a connectionless protocol that offers faster but less reliable data transmission.
• TCP is reliable as it ensures all data packets are received in order and retransmits any lost packets.

• UDP is faster as it does not establish a connection before sending data and does not guarantee delivery of packets.

• TCP is used for applications that r...read more
Answered by AI
Add your answer

Maths,reasoning and Java questions

1. Program on lift technology

Q1. C program on pallindrome. A riddle. There is 8 matchbox and 7 matchbox are of equal weight and one is having less weight. Find the matchbox with less weight.
Add your answer

Q1. Give your introduction.
Add your answer
Q2. What is your hobby? Any question you would like to ask?
Ans. Always ask about the type of projects company deals with. Or about the work culture.
Answered by Monideepa Das
Add your answer