Question
Four of the following five are alike in a certain way
based on their seating positions in the given seating arrangement and so form a group. Which one does not belong to the group? Study the following information carefully to answer the given question. Eight people R, S, T, U, V, W, X and Y are sitting in a straight line facing north but not necessarily in the same order. Each of them teaches different subjects, namely Maths, Sanskrit, History, Banking, Physics, Geography, English and Drawing but not necessarily in the same order. S sits fourth to the right of W. The one who teaches History sits on the immediate right of S. Only two people sit between the one who teaches History and the one who teaches English. The one who teaches Drawing sits second to the left of the one who teaches English. Only two people sit between T and the one who teaches Drawing. X sits on the immediate left of R. X does not sit at any of the extreme ends of the line. X sits at one of the positions to the left of S. Only three people sit between the one who teaches History and the one who teaches Maths. As many people sit between S and the one who teaches Physics as between S and the one who teaches Maths. Y sits second to the left of the one who teaches Physics. The one who teaches Geography sits third to the right of the one who teaches Sanskrit. U does not teaches Geography.Solution
What will be the output of the following queue implementation using two stacks?
class QueueUsingStacks {Â Â Â Â Â Stacks1 = new Stack <>... Which protocol provides secure authentication by encrypting credentials before transmission and uses a challenge-response mechanism?
What is the time complexity of searching for an element in a sorted array using binary search?
Which traversal method visits the root node first in trees?
Which of the following techniques is most efficient for finding the kth smallest element in a Binary Search Tree (BST)?
In the context of Management Information Systems (MIS), which of the following best describes the role of a decision support system (DSS)?
Which of the following integrity constraints ensures that every non-null foreign key value must reference an existing primary key value in another tabl...
If an algorithm takes $5n²  + 3n + 10$ steps for an input of size n, its Big O notation would be:
Which OOP principle allows for restricting access to certain parts of an object while exposing only necessary parts for interaction?
Which algorithm is used for computing Max-Flow in a network?