Question
In the word ‘TOWARDS’ all consonants are written as
their preceding letter and all vowels are written as their following letters. Now all letters are arranged in alphabetical order from left to right and all the repeated letters are eliminated. Then, how many such pairs of letters are there, each of which have as many letters between them in the word (forward direction) as they have between them in the English alphabetical series?Solution
There are a total of 7 pairs of letters.Â
The word - T O W A R D S
   S P V B Q C R
   B C P Q R S V
Only BC, PQ, QR, RS, PR,PS and QS are there for the forward arrangement.Â
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?