Question
Which one of the following is the specialization of
Rahul? 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. 
Which algorithm is used for computing Max-Flow in a network?
Given the following code snippet, which operation is performed on the binary tree to produce the output: 4, 2, 5, 1, 3 ?
class Node {Â Â Â Â Â in...Which data structure is most suitable for implementing a priority queue with logarithmic time complexity for insertion and deletion?
Tarjan’s algorithm is used to find:
In C++, which access specifier makes members accessible only from within the class itself and from friend functions/classes?
What is the worst-case time complexity for inserting an element into a hash table that uses separate chaining for collision resolution?
In a graph, what is the maximum number of edges in a simple undirected graph with 'n' vertices?
Time complexity of heap sort is:
Which of the following is true about triggers in a relational database?
What is the primary purpose of an abstract class?
Relevant for Exams:
