Question
Find the one who visits on
Saturday? Study the following information carefully and answer the questions given beside. For submitting the progress report after supervision of the project, seven senior engineers namely - Rahul, Rohit, Kanika, Pramesh, Deeksha, Zishan and Himanshu visit ISRO on four days –Tuesday, Friday, Saturday and Sunday – in a week. At least one engineer but not more than two Engineers visit ISRO on each of these days. Each of them is a specialist in different fields – Electronics, Mechanical, Mechatronics, Programmer, Electrical, Civil and Instrumentation. Pramesh visits on Saturday with civil engineer. Electrical engineer does not visit on Sunday neither with Deeksha nor with Himanshu. Instrumentation engineer Zishan visits alone on Tuesday. Rohit visits on Friday and he is not electrical engineer. Kanika visits on Friday. Himanshu is not civil engineer. Electrical engineer visits with the Electronics engineer. The mechatronics engineer visits on Saturday. Rahul is neither Mechanical nor Civil engineer.Solution
Instrumentation engineer Zishan visits alone on Tuesday. Rohit visits on Friday and he is not electrical engineer. Pramesh visits on Saturday with civil engineer. Kanika visits on Friday. The mechatronics engineer visits on Saturday. Therefore, Pramesh is mechatronics engineer. Electrical engineer does not visit on Sunday neither with Deeksha nor with Himanshu. Electrical engineer visits with the Electronics engineer. 
Himanshu is not civil engineer. Rahul is neither Mechanical nor Civil engineer. So, the only left Deeksha is civil engineer. Rahul is neither mechanical nor civil engineer; hence, he should be the programmer. 
What does Section 66A of IT Act define?
A data analysis task requires repeatedly extracting the element with the highest priority from a collection. Which heap operation is used for this, and ...
Consider the following Java code snippet:
  import java.util.PriorityQueue;
  public class HeapQuestion9 {
    publ...
The latency of a network isÂ
The Knuth-Morris-Pratt (KMP) algorithm improves upon the Naive approach by avoiding unnecessary re-comparisons. It achieves this by:
Round robin scheduling is essentially the preemptive version of
Which of the following programming language most of “Wireshark” is implemented in?
Which is not an IoT OS?
What are the 3v’s of Big Data?
Consider the in-order traversal of a Binary Search Tree. What characteristic does the sequence of visited nodes possess?
Relevant for Exams:
