10+ Oracle Application Developer Interview Questions and Answers for Freshers

The game is not fair.

• Player X has a higher chance of winning as they only need to get a consecutive HEAD, TAIL.

• Player Y needs to get a consecutive HEAD, HEAD which is less likely to occur.

• The probability of Player X winning is higher than Player Y winning.

The last ball that will be left is black.

• When you take out 2 black balls, you take another white ball.

• If you take 2 white balls, you take out 1 black ball.

• If balls are of different color, you take out another black ball.

• Since there are more black balls initially, the last ball will be black.

Design a website similar to bookmyshow.com for booking cinema tickets for a single location with multiple theatres.

• Design a user-friendly GUI with options for advance booking, user login, user registration, movie rating, and saving card details.

• Create relevant database tables to store information about movies, theatres, bookings, user details, and card details.

• Link the GUI to the database to enable data flow and retrieval.

• Implement features like advance booking, where users c...read more

The program prints the substring after a specified character has occurred a certain number of times in a given string.

• Iterate through the string to find the specified character.

• Keep track of the count of occurrences of the character.

• Once the count reaches the specified count, extract the substring after that position.

• Handle corner cases such as when the character is not in the string or when it doesn't occur the specified number of times.

Minimum number of times to turn all glasses upside down when 4 can be turned at a time.

• Turn over any four glasses, leaving one untouched.

• Repeat the above step until only one glass is left upside down.

• Finally, turn over the last glass to complete the task.

• Minimum number of turns required is 3.

Print all possible paths from start to end in a linear way, moving either one or two steps right.

• Use dynamic programming to solve the problem

• Create a 2D array to store the number of paths to each position

• Start from the end position and work backwards

• At each position, calculate the number of paths by summing the number of paths from the next two positions

• Print all the paths by backtracking from the start position

The code inserts two numbers in a text file, ensuring that the second number is greater than the first and there is no overlap between entries.

• Read the existing entries from the text file

• Check if the new numbers satisfy the conditions

• If conditions are met, insert the new numbers into the file

• Otherwise, display an error message

Code to find the middle element of a linked list

• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle element

• If the linked list has even number of elements, return the second middle element

Code to count the number of times '1' occurs from 1 to 999999

• Loop through all numbers from 1 to 999999

• Convert each number to a string and count the number of '1's in it

• Add the count to a running total

• Return the total count

The code prints the transpose of a given matrix.

• Iterate through each row and column of the matrix.

• Swap the elements at the current row and column with the elements at the current column and row.

• Print the transposed matrix.

Arrange 4 coins to make maximum number of triangles

• Place 3 coins in a triangle formation and the fourth coin in the center to form 4 triangles

• Place 2 coins on top of each other and the other 2 coins on either side to form 2 triangles

• Place 2 coins in a line and the other 2 coins on either side to form 2 triangles

Arrange 10 coins in 4 rows of 4 coins each.

• Place 4 coins in a row and keep the remaining 6 aside.

• Place 3 coins from the remaining 6 in the next row and keep the remaining 3 aside.

• Place 2 coins from the remaining 3 in the third row and keep the remaining 1 aside.

• Place the last coin in the fourth row along with the remaining 1 coin from step 3.

• The final arrangement will have 4 rows with 4 coins each.

Multitasking is the ability of an operating system to run multiple tasks concurrently while multiprogramming is the ability to run multiple programs concurrently.

• Multitasking allows multiple tasks to run concurrently on a single processor system.

• Multiprogramming allows multiple programs to run concurrently on a single processor system.

• Multitasking is achieved through time-sharing, where the processor switches between tasks at a very high speed.

• Multiprogramming is achieved thr...read more

Circular doubly linked list is a data structure where each node has a reference to both the next and previous nodes, forming a circular loop.

• Create a Node class with data, next, and prev pointers

• Implement operations like insert, delete, search, and display

• Ensure the last node's next pointer points to the first node and the first node's prev pointer points to the last node

Searching and sorting algorithms are essential in programming for efficiently organizing and retrieving data.

• Searching algorithms: linear search, binary search, depth-first search, breadth-first search

• Sorting algorithms: bubble sort, selection sort, insertion sort, merge sort, quick sort

• Examples: Searching for a specific item in a list, sorting a list of numbers in ascending order

Find the largest element in a window of size K in an array.

• Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

• Remove indices from the front of the deque that are outside the current window.

• The front of the deque will always have the index of the largest element in the current window.

SQL query using joins

• Use JOIN keyword to combine rows from two or more tables based on a related column between them

• Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN

• Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column