Question
Given below are four combinations [i], [ii], [iii] and
[iv] of five words. In each combination you have to arrange the letters in English alphabetical order from left to right. Then in each combination the first letter from the left end is numbered as I, the second letter from the left end is numbered as II and so on. Hence in each combination I, II, III, IV, and V will denote the position of the letters from the left end. [i] QPVYI [ii] GHEIL [iii] EOCAD [iv] ECKYW From each of the given words, the letters, which are at the same positions are clubbed together. The letters which are at position [I] will form a word if taken in order of combination [i], [ii], [iii], and [iv] respectively and similarly form [I II III IV and V]. Then, how many meaningful words will be formed? TYPE - 7Solution
Arranging the letter in English alphabetical order, we get: [i] QPVYI - IPQVY [ii] GHEIL β EGHIL [iii] EOCAD β ACDEO [iv] ECKYW β CEKWY On clubbing together in (I, II, III, IV, and V) from the left end, we get: Only IV will make a meaningful word i.e. βVIEWβ.
Which tree traversal gives nodes in non-decreasing order for a BST?
In a data warehousing environment, what is the primary purpose of an OLAP (Online Analytical Processing) cube?
In a binary tree, what is the maximum number of children a node can have?
Which sorting algorithm has O(n log n) average case?
Which of the following data structures is best suited for implementing a "undo" mechanism in a text editor?
Which of the following best describes Abstraction in Object-Oriented Programming (OOP)?
What does Big O notation primarily describe?
A stack follows which principle for data access?
Which data structure uses LIFO (Last In, First Out) principle?
What is the difference between 'BFS' (Breadth-First Search) and 'DFS' (Depth-First Search) in graph traversal?