Register
Verification: Verified Account
Member for: 10 years (since Jul 24, 2016)
Type: Registered user
Extra privileges: Asking questions
Flagging posts
Full name: Manikant Sharma
GATE Year: 2022
GATE Rank: 974
About: I am Manikant Sharma, a passionate Computer Science M.Tech student at IIT Bhubaneswar with experience in web development, hybrid machine learning, and federated learning. I have developed projects ranging from React-based applications to Go web servers and am currently working on my thesis in Hybrid Federated Learning. With a strong background in problem-solving and a knack for full-stack development, I’m eager to contribute to innovative tech solutions.
Resume:
GitHub Profile Link: https://github.com/manikant8
DBLP Link:
Following standard books?: Yes.
Home State: Uttar Pradesh
Donate Me Link:
Messages from only those in my circle:
Test Series Access Lists

Activity by manikantsharma

Score: 100 points (ranked #212)
Title: Active
Exams Created: 0
Exams Taken: 0
No. of Edits: 0
Posts: 0
Questions: 0
Answers: 0
Comments: 0
Voted on: 0 questions, 0 answers
Gave out: 0 up votes, 0 down votes
Received: 0 up votes, 0 down votes
Reactions received: 0
Network Sites:

Wall for manikantsharma

Please log in or register to post on this wall.
User Avatar
manikantsharma Jun 14, 2023
IIT Bhubaneshwar MTech(CSE) Written test and Interview experience.

It was physical reporting at IIT BBS. The written test is OMR based test consist of 30 questions touching each GATE subject. It was easy for anyone who preprired for GATE. Then they selected 170(approx) students for interview.
In interview, it was a panel of 2 profecessors. Both are very chill & corporative.
Q1: Breaf intro about yourself (though they had my application)
Answered in breaf only about my education and GATE prepartion.

Q2: Your fav subject
I said OS (I was confident in OS)
Q: What are deadlock prevention conditions?
Answered in detail.
Q: time complexity of deadlock avoidance algo.
Answered.
Handed over to professor 2
Q: fav subject?
Answer : DSA
Q: fav DS?
Answer: Array
Q: how to perform linear search to find min and max in given unsorted array?
Answer: i started with naive solution.
Q: is any optimisation possible on number of comparision?
 Answer: I  explained the optimal solution with example and numerically showing how much comparision we can save with this solution.(he was impressed & satisfied with the answer).

Interviwew over.
PS : They will definitely ask DSA whether you tell dsa as your fav subject or not. So, better revice it once.
Any suggestion & query are welcome.