Oracle Interview Questions, Process, and Tips

First round was online assessment consisting of aptitude and coding questions.

Q1. First round consisted of coding 3 questions. String reversal , binary to decimal, finding index of word "golden" in given sentence.
Add your answer

Q1. It involved questions related to my resume and computer networks and basics of c++.
Add your answer

Q1. Reverse a linked list
Ans. 
Reverse a linked list by changing the next pointers of each node to point to the previous node.
• Start with three pointers: current, previous, and next.

• Iterate through the linked list, updating the next pointer of each node to point to the previous node.

• Update the previous, current, and next pointers for each iteration.
Answered by AI
Add your answer
Q2. Distribute candies among students with ratings
Ans. 
Distribute candies among students based on their ratings, ensuring higher rated students get more candies.
• Create an array to store the ratings of each student

• Initialize another array to store the number of candies each student will receive

• Start by giving each student 1 candy

• Iterate over the ratings array from left to right, comparing each student's rating with the previous one and adjusting the candies accordingly
Answered by AI
Add your answer
Q3. How do we serialize data
Ans. 
Data serialization is the process of converting data structures or objects into a format that can be stored or transmitted.
• Serialization involves converting data into a byte stream for storage or transmission.

• Common serialization formats include JSON, XML, and Protocol Buffers.

• Serialization allows data to be easily saved to a file or sent over a network.

• Deserialization is the reverse process of converting serialized da
Answered by AI
Add your answer
Q4. What is data shuffling in spark
Ans. 
Data shuffling in Spark is the process of redistributing data across partitions to optimize parallel processing.
• Data shuffling occurs when data needs to be moved across partitions, typically during operations like groupBy, join, or sortBy.

• It involves transferring data between executors, which can be a costly operation in terms of performance.

• Data shuffling can impact the performance of a Spark job, so it's important to...read more
Answered by AI
Add your answer
Q5. Explain the functioning of map-reduce
Ans. 
Map-reduce is a programming model used for processing and generating large data sets in parallel.
• Map function processes input data and generates key-value pairs

• Reduce function takes the output of the map function and combines the values with the same key

• Example: Word count in a document - map function counts occurrences of each word, reduce function sums up the counts
Answered by AI
Add your answer
Q6. Micro service architecture: Handling service down-time
Ans. 
Handling service downtime in microservice architecture is crucial for maintaining system reliability.
• Implement circuit breakers to prevent cascading failures

• Use service discovery to automatically route traffic to healthy instances

• Implement retry mechanisms with exponential backoff to handle transient failures

• Monitor service health and performance metrics to proactively detect issues

• Implement graceful degradation to pro
Answered by AI
Add your answer
Q7. Micro service architecture: Handling too many requests
Ans. 
Implement rate limiting, load balancing, and circuit breaking to handle too many requests in micro service architecture.
• Implement rate limiting to control the number of requests a service can handle within a specific time frame.

• Use load balancing to distribute incoming requests evenly across multiple instances of a service.

• Implement circuit breaking to prevent cascading failures and overload in case of high traffic.

• Con...read more
Answered by AI
Add your answer

Topics-Arrays,Sliding Window

Missing numbers,C,C++,OS,OOPS etc

Q1. Merge Intervals
Add your answer
Q2. Combinations of elements in array
Ans. 
Find all possible combinations of elements in an array of strings
• Use recursion to generate all possible combinations

• Keep track of visited elements to avoid duplicates

• Consider the order of elements in the combinations

• Example: Given array ['A', 'B', 'C'], possible combinations are ['A', 'B', 'C', 'AB', 'AC', 'BC', 'ABC']
Answered by AI
Add your answer

Q1. Update about profile and Projects
Ans. 
I have a diverse background in product management with experience in launching successful projects.
• Managed cross-functional teams to launch new products

• Implemented agile methodologies to improve project efficiency

• Led market research to identify customer needs and preferences
Answered by AI
Add your answer
Q2. How BRM works in Telco, and how we can launch in market
Ans. 
BRM in Telco involves managing relationships with business partners to launch new products in the market.
• BRM in Telco focuses on building and maintaining relationships with business partners such as vendors, suppliers, and distributors.

• It involves negotiating contracts, setting up agreements, and ensuring smooth collaboration between all parties involved.

• To launch a new product in the market, BRM plays a crucial role i...read more
Answered by AI
Add your answer

Mcqs+ 1 coding test. Solved all

Q1. Longest string with no repeating character
Ans. 
Find the longest string in an array with no repeating characters.
• Iterate through each string in the array

• Use a set to keep track of characters seen so far

• Update the longest string found without repeating characters
Answered by AI
Add your answer
Q2. Generate paranthesis
Ans. 
Generate all valid combinations of parentheses for a given number n
• Use backtracking to generate all possible combinations of opening and closing parentheses

• Keep track of the number of opening and closing parentheses used

• Add opening parentheses if there are remaining to be used, and add closing parentheses if it won't create an invalid combination
Answered by AI
Add your answer

Dsa aptitude array programming

Q1. Sql queries , graphs algorithms
Add your answer
Q2. Dijkstras algorithm
Ans. 
Dijkstra's algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
• Dijkstra's algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.

• It works by maintaining a priority queue of nodes based on their distance from the starting node.

• The algorithm iteratively selects the node with the smallest distance, updates the distances of its neighbo...read more
Answered by AI
Add your answer