Round 1: Online test: MCQ on Aptitude, OS, OOPS, Networking and pseudocode, C++ (output-based), and coding questions. One of them was…
- Add two numbers represented by a linked list.
https://www.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1
Round 2: Online test: I didn’t remember the question properly but the question was related to the k-left rotation operation in an array.
https://www.geeksforgeeks.org/problems/rotate-array-by-n-elements-1587115621/1
- A range of numbers was given and you have to find out how many numbers in the range are the power of 2.
https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/amp/
Round 3: Interview
- Why Tejas networks?
- What is abstraction write down an example of an abstract queue?
- Random numbers are given and you have to output the array such that all the zeroes are at the front of array and all the ones are at the end of array and relative order of elements should me maintained. Time complexity should be O(n) and space complexity should be O(1).
- Do you know bucket sort or count sort ?
- What is the time complexity of quick sort in best , average and worst case ?
- What is MAC protocol ?
- Where in the laptop transport layer is working ?
- Name some application layer protocols.
- Do threads share memory? If yes how do they do it ?
Round 4: HR round
I was not selected for this round.
Article Tags :
Recommended Articles