S = 7!/2! = (7 × 6 × 5 × 4 × 3 × 2 × 1 )/(2 × 1)= 2520 Let E= event of getting all vowels are together n(E) = (5!x3! )/2! = 360 ∴ P (E) = (n(E))/(n(S)) = 360/2520 = 1/7
Which data structure is most suitable for implementing recursion?
Which of the following protocols is most commonly used in IoT devices to enable communication between smart devices?
Which of the following is a primary challenge associated with Cloud Security?
Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?
Which is not true about minimum spanning tree?
Which protocol is most commonly used for secure communication between IoT devices over the internet?
In Data Structures, which of the following algorithms uses the Divide and Conquer strategy?
In Database Management Systems, what is the primary purpose of normalization?
Which of the following is a fundamental challenge in Natural Language Processing (NLP)?
Which of the following SQL queries is used to remove a table from a database?
