Question
Who among the following person stands second to the
left of S? Study the following information carefully and answer the questions given below. Nine persons P, Q, R, S, T, U, V, W and X are standing in a straight line such that all of them are facing towards north, but not necessarily in the same order. The consecutive alphabetically named person doesn’t stand adjacent to each other. Not more than two persons stand to the left of U. The number of persons to the right of U is the same as to the left of W, who stands third to the right of X. V stands fourth from one of the ends and is to the immediate right of P. The number of persons between U and P is the same as the number of persons between X and T. Only one person stands between R and S.Solution
1) Not more than two persons stand to the left of U. The number of persons to the right of U is the same as to the left of W, who stands third to the right of X. Case-1 2) V stands fourth from one of the ends and is to the immediate right of P. The number of persons between U and P is the same as the number of persons between X and T. The consecutive alphabetically named person doesn’t stand adjacent to each other. Hence, case 3 gets eliminated.
Which of the following correctly describes the primary difference between Cross-Site Request Forgery (CSRF) and Cross-Site Scripting (XSS)?
...What is the time complexity for inserting a node at the end of a singly linked list if you only have a pointer to the head?
Given a singly linked list with 'n' nodes, what is the time complexity to delete the last node?
Which of the following best describes the mechanism of a Cross-Site Scripting (XSS) attack?
What is "rubber duck debugging"?
What is the best-case time complexity of the binary search algorithm ?
If a stack is implemented using a fixed-size array, what is a significant disadvantage when the stack grows beyond its initial capacity?
KMP pattern matching avoids:
Which tree traversal gives nodes in non-decreasing order for a BST?
Suffix Trees are useful for: