i
Oracle
Filter interviews by
Clear (1)
To solve question 1 with O(n) time complexity, iterate through the array once. To solve with O(logn) time complexity, use binary search.
For O(n) time complexity, iterate through the array once and perform the required operations.
For O(logn) time complexity, use binary search to find the desired element or perform the required operations.
O(n) time complexity is generally faster than O(logn) time complexity for smaller i...
UNIX OS uses a dynamic memory management scheme to allocate and deallocate memory efficiently.
UNIX OS uses virtual memory to provide each process with its own address space.
The memory management scheme includes techniques like paging and segmentation.
Paging divides memory into fixed-size pages and maps them to physical memory.
Segmentation divides memory into logical segments of varying sizes.
UNIX OS uses demand paging ...
The data structure for efficient implementation of cache level memory is a multi-level cache hierarchy.
Use a multi-level cache hierarchy with different levels of cache (L1, L2, L3, etc.)
Each cache level should have a smaller size and faster access time compared to the previous level
Implement a cache coherence protocol to ensure consistency between different cache levels
Use a replacement policy (e.g., LRU - Least Recent...
Pre-order traversal of a BST iteratively
Create an empty stack and push the root node onto it
While the stack is not empty, pop the top node and print its value
Push the right child onto the stack if it exists
Push the left child onto the stack if it exists
ACID properties are a set of characteristics that ensure reliability and consistency in database transactions.
ACID stands for Atomicity, Consistency, Isolation, and Durability.
Atomicity ensures that a transaction is treated as a single, indivisible unit of work.
Consistency ensures that a transaction brings the database from one valid state to another.
Isolation ensures that concurrent transactions do not interfere with ...
Mutex and semaphores are synchronization mechanisms used in multi-threaded environments.
Mutex is used to provide mutual exclusion, allowing only one thread to access a shared resource at a time.
Semaphore is used to control access to a shared resource by multiple threads, allowing a specified number of threads to access it simultaneously.
Mutex is binary, meaning it has only two states: locked or unlocked.
Semaphore can h...
To find the nth node in a linked list, iterate through the list until reaching the nth node.
Start at the head of the linked list
Iterate through the list, moving to the next node each time
Stop when reaching the nth node
I am a dedicated and experienced server technician with a passion for technology and problem-solving.
I have been working in the server technology field for over 5 years.
I have extensive knowledge of server hardware and software.
I am skilled in troubleshooting and resolving server-related issues.
I have experience in managing server infrastructure and ensuring optimal performance.
I am constantly staying updated with the ...
I applied via Recruitment Consultant and was interviewed in Apr 2021. There were 9 interview rounds.
I applied via Campus Placement and was interviewed before Jul 2021. There were 4 interview rounds.
Aptitude test on CS subjects like C programming, DBMS, CN, and OS.
There were 2 input-output based questions of easy to moderate level
Every candidate was given an individual topic and was asked to speak on it
I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Company Website and was interviewed before Jul 2021. There were 3 interview rounds.
Aptitude, reasoning, English, cloud sections
2 questions in which , one has to complete within an 50 minutes
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedI applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I was interviewed in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Senior Software Engineer
2.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Consultant
2.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Consultant
2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Member of Technical Staff
1.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Application Engineer
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
SAP
MongoDB
Salesforce
IBM