Question
How many unique arrangements can be made using all the
letters of the word "DELUSION", ensuring that the vowels do not appear together?Solution
If we take all the vowels to be a single letter, then
Total number of letters = 5 [EUIO is taken as a single letter]
Number of ways of arranging with all the vowels together = 5! × 4! = 120 × 24 = 2880
Number of ways of arranging without any condition = 8! = 40320
So, number of ways the word can be arranged so that all the vowels never occur together = 40320 – 2880 = 37440
Output of below code
public class Prg {
public static void main(String args[]){
System.out.print("A" + "B" + 'A');
}
...The Master Theorem gives time complexity for recurrences of the form:
Which of the following is true for the time complexity of binary search?
Which is not true about minimum spanning tree?
Which sorting algorithm divides the array into halves recursively?
Which command is TCL command
Which of the following is substring of “IXAMBEE”?
Which data structure is used in BFS (Breadth-First Search)?
Which of the following is considered the strongest type of encryption method in modern cyber security practices?
In a binary search tree (BST), what is true about the left child of a node?
Relevant for Exams:
