Tip 1 : Practice good aptitude questions
Tip 2 : Read important core subjects thoroughly
Tip 3 : Also revise language basics
Tip 1 : Be honest with your resume
Tip 2 : Try to somehow highlight your strong points in resume
My slot was at 4.30 pm on 11 th oct 2020



Consider If N = 2 , M = 4, Time = [[0, 2], [3, 0]] and Toll = [[0, 10], [ 5, 0]]]
The optimal path to reach node 1 from node 0 is 0 -> 1. The time required in the path is 2, and the minimum toll needed within the given time constraints is 10. Hence the answer is 10.
It happened in the afternoon



What is process and explain threading
Explain binary semaphore?
Explain paging
What are overlays.
What are ACID properties
Write an essay on any topic and speak.
Tip 1 : Have good pronunciation practice
Tip 2 : Practice by reciting difficult words

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?