i
Oracle
Filter interviews by
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
I applied via Company Website and was interviewed in Nov 2020. There was 1 interview round.
posted on 21 Mar 2021
I applied via Referral and was interviewed in Feb 2021. There was 1 interview round.
A unique not null column can be used as a primary key, but not vice versa.
Primary key must be unique and not null, but not all unique not null columns need to be primary keys.
Primary key is used to identify each row uniquely, while unique not null column is used to ensure data integrity.
A table can have multiple unique not null columns, but only one primary key.
Null cannot be equated as it represents absence of a value.
Null is not equal to any value, including itself.
Attempting to equate null can result in unexpected behavior.
Null is often used to represent the absence of a value or unknown value.
I applied via Naukri.com and was interviewed in Jul 2022. There was 1 interview round.
I applied via Approached by Company
Sort the arr, fetch element from array
Sorting in a linked list involves rearranging the elements in ascending or descending order based on a certain criteria.
Use a sorting algorithm like bubble sort, selection sort, or merge sort to rearrange the elements in the linked list.
Traverse the linked list and compare each element with the next one to determine the order in which they should be sorted.
Update the pointers of the nodes in the linked list to reflect ...
I appeared for an interview in Sep 2024.
C programming and java
Advanced coding on c
I chose this company because of its innovative projects, strong company culture, and opportunities for growth.
Innovative projects that challenge me and allow me to learn new skills
Strong company culture that values teamwork and collaboration
Opportunities for growth and advancement within the company
My aim is to continuously improve my technical skills, contribute to innovative projects, and eventually become a technical leader in the field.
Continuous learning and skill development
Contribution to innovative projects
Becoming a technical leader in the field
I applied via Approached by Company and was interviewed in Sep 2023. There were 2 interview rounds.
Traverse through a matrix of uppercase english alphabets to find a given word. you are allowed to make up to k jumps, and same position can be repeated too.
Compression of 0-1 matrix involves reducing the size of the matrix by storing only the necessary information.
Use run-length encoding to compress the matrix by storing consecutive repeated values as a single value and count.
Identify patterns in the matrix that can be represented more efficiently.
Consider using sparse matrix representation if the matrix has a lot of zeros.
Implement efficient algorithms to compress and de...
Insertion sort and quicksort are sorting algorithms used to sort arrays of data.
Insertion sort: iterates through the array and inserts each element into its proper position.
Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.
Insertion sort is best for small arrays, while quicksort is best for large arrays.
Bot...
Merge two sorted linked lists using recursion
Create a recursive function that compares the first nodes of both lists
Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list
Base case: if one list is empty, return the other list
Return the merged list
Given an integer, determine which byte is zero.
Convert the integer to a byte array using bitwise operations.
Iterate through the byte array and check for a zero value.
Return the index of the zero byte.
Consider endianness when converting to byte array.
To check endianness, create a 4-byte integer with a known value and check the byte order.
Create a 4-byte integer with a known value
Check the value of the first byte to determine endianness
If the first byte is the least significant, the machine is little endian
If the first byte is the most significant, the machine is big endian
Static objects can be used to print something before main() execution.
Static objects are initialized before main() execution
They can be used to print something before main()
Example: static int x = printf("Hello World!");
Output: Hello World! will be printed before main() execution
Static variables are allocated memory in the data segment of the program's memory space.
Static variables have a fixed memory location throughout the program's execution.
They are initialized to zero by default.
If initialized explicitly, they are stored in the data segment.
Static variables can be accessed by any function in the program.
Finding space and time complexity of a recursive function.
Space complexity is the amount of memory used by the function.
Time complexity is the amount of time taken by the function to execute.
Recursive functions have higher space complexity due to the call stack.
Time complexity can be calculated using Big O notation.
Examples of recursive functions include factorial and Fibonacci sequence.
Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.
Occurs when a class inherits from two classes that share a common base class
Can lead to ambiguity in method calls and data members
Solved using virtual inheritance or by using interfaces
based on 13 reviews
Rating in categories
Bangalore / Bengaluru
10-15 Yrs
Not Disclosed
Senior Software Engineer
2.4k
salaries
| ₹12 L/yr - ₹40 L/yr |
Principal Consultant
2.1k
salaries
| ₹14.5 L/yr - ₹36 L/yr |
Senior Consultant
2.1k
salaries
| ₹8.7 L/yr - ₹28 L/yr |
Senior Member of Technical Staff
1.8k
salaries
| ₹13.4 L/yr - ₹45 L/yr |
Senior Application Engineer
1.4k
salaries
| ₹9.6 L/yr - ₹30 L/yr |
SAP
MongoDB
Salesforce
IBM