Round 1:
The first round consists 20 mcqs and 2 coding questions. The MCQ’s are focused mainly on Operating systems, data structures and algorithm analysis and DBMS.
each question consists +1 and -0.25 for the wrong answer
Round 2:(TECHNICAL ROUND 1)
It started with the self introduction and brief chat about Vizag(interview held in Vizag). He is so friendly and encouraging
- Rearrange nodes in the given linked list as follows
input : a -> b -> c -> d -> e output: a -> e -> b -> d -> c
Solution: Rearrange a given linked list in-place.
- Given an array of integers, print pairs(positive value and negative value of the number) that exists in the array.
Input : [1, -3, 2, 3, 6, -1] Output : [-1,1] [-3,3]
Solution: neveropen Link
this round happened for one hour
Round 3 (TECHNICAL ROUND 2):
This round started with discussion on projects and then questions on technical concepts like
- deadlocks
- mutex vs semaphores
- ultithreading vs multiprocessing
- TCP protocol
- DNS
- 3-way handshake in TCP
- discussion on OSI layer
- ACID properties
- models in DBMS(ER, network….)
- discussion on ER model
Then he started coding part :
- Given row wise and column wise 2d matrix, find k minimum element.
- Given an array and a window size and window moves from left to right till the rightmost side of window hits the other side of array, print max element in the window for each step in the process.
Solution: neveropen Link
If you like neveropen and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the neveropen main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!