i
Lookout
Filter interviews by
posted on 10 Jun 2024
Problem on reverse a word
Problem on merge sort
posted on 18 Jul 2024
I applied via Naukri.com and was interviewed before Jul 2023. There were 2 interview rounds.
IPC mechanism in Windows allows communication between processes through shared memory, message passing, and synchronization.
IPC mechanisms in Windows include named pipes, mailslots, shared memory, and sockets.
Named pipes allow communication between processes on the same machine or over a network.
Mailslots are used for one-way interprocess communication.
Shared memory allows processes to share data by mapping a region of...
Multi-threading in Windows allows multiple threads to run concurrently within a single process.
Windows provides APIs like CreateThread and CreateProcess to create and manage threads.
Threads share the same memory space within a process, allowing for efficient communication and resource sharing.
Windows supports both user-mode and kernel-mode threads, with user-mode threads being more lightweight.
Synchronization mechanism...
Memory mapping in Windows allows files to be mapped directly into memory for faster access and manipulation.
Memory mapping allows files to be accessed as if they were in memory
File mapping can be used for sharing data between processes
Improves performance by reducing disk I/O operations
Examples: CreateFileMapping, MapViewOfFile, UnmapViewOfFile
Critical section in Windows is a synchronization mechanism used to protect shared resources from concurrent access.
Critical sections are used to ensure mutual exclusion between threads accessing shared resources.
They are implemented using the Windows API functions InitializeCriticalSection, EnterCriticalSection, and LeaveCriticalSection.
Critical sections are more efficient than mutexes for synchronization within a sing...
I was interviewed before Mar 2021.
To check if a number is a power of 2, we can use bitwise operations.
A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.
Sort a stack without using another data structure
Use recursion to pop the top element and insert it at the bottom of the remaining stack
Repeat until the stack is sorted in ascending order
Time complexity: O(n^2), space complexity: O(n) due to recursion
Check if array has continuous increasing and decreasing values
Loop through the array and check if each element is greater than the previous one
Once you find the maximum element, check if the remaining elements are in decreasing order
If yes, return true else false
Design a cricinfo (LLD)
Identify the entities: players, teams, matches, scorecards, tournaments, etc.
Define the relationships between entities
Create a database schema to store the data
Implement APIs to fetch and update data
Design a UI to display the information
Consider scalability and performance
Ensure data security and privacy
I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop in the linked list, the two pointers will eventually meet.
To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.
The meeting point is the start of the loop.
LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.
LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.
MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.
LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...
posted on 7 May 2017
I was interviewed in Feb 2017.
posted on 27 Jan 2017
I was interviewed in Dec 2016.
I applied via Referral and was interviewed before Apr 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed before Aug 2021. There were 2 interview rounds.
I was attended for technical f2f round for Android app developer, they asked to develop sample app with large json parsing in grid view. It's good and nice.
I applied via Campus Placement and was interviewed before Sep 2020. There was 1 interview round.
based on 1 interview
Interview experience
Senior Software Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Software Engineer
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
McAfee
Gen
Trend Micro
Kaspersky Lab