Question
The student who belongs to Meghalaya appeared for which
exam? Study the following information carefully and answer the given questions: 7 students P, Q, R, S, T, U and V belong to 7 different states namely Assam, Bihar, Haryana, Himachal Pradesh, Madhya Pradesh, Meghalaya and Punjab. They are appearing for different exams- RRB PO, IBPS Clerk and SBI SO. At-least 2 students appear for a single exam. U and the person belongs to Himachal Pradesh appeared for the same exam. The person who belongs to Bihar, V and Q appeared for same exam. S belongs to neither Haryana nor Madhya Pradesh. T appeared for SBI SO but does not belong to Bihar. The person who belongs to Haryana and Bihar appeared for RRB PO. U appeared for neither IBPS Clerk nor belongs to Madhya Pradesh. V belongs to Himachal Pradesh. S did not appear for IBPS Clerk. R belongs to Meghalaya and appeared for IBPS Clerk. The person who belongs to Punjab appeared for IBPS Clerk.Solution
The person who belongs to Bihar appeared for RRB PO. And V, Q and the person who belongs to Bihar appeared for same exam. So, V and Q also appeared for RRB PO. R belongs to Meghalaya and appeared for IBPS Clerk. V belongs to Himachal Pradesh. T appeared for SBI SO. 
U and the person who belongs to Himachal Pradesh appeared for same exam. Therefore, U appeared for RRB PO. The person who belongs to Haryana appeared for RRB PO. The person who belongs to Punjab appeared for IBPS Clerk. S neither belongs to Haryana nor Madhya Pradesh. So, S belongs to Assam. T does not belong to Bihar. Therefore U belongs to Bihar. Final table 
In the context of searching, what is the primary advantage of using hashing?
Which command is used to undo the changes
Which of the following Big Data processing models is based on the concept of continuous data flow processing?       Â
...Which data structure is typically used to implement Breadth-First Search (BFS)?
Which of the following is NOT a characteristic of the Internet of Things (IoT)?
What is the time complexity of inserting an element in a heap?
Which of the following is true about the Round Robin (RR) CPU scheduling algorithm?
In dynamic programming, overlapping subproblems and _________ are key properties.
The Activity Selection Problem can be optimally solved using a greedy approach. What is the greedy choice typically made at each step?
A sorting algorithm is considered "stable" if it maintains the relative order of records with equal keys. Which of the following algorithms is generally...
Relevant for Exams:
