Question
Select the correct option that indicates which word
cannot be formed using the letters of the given word only once. COMMUNICATIONSolution
Given word: COMMUNICATION ACTION can be formed using the letters of the word COMMUNICATION. UNION can be formed using the letters of the word COMMUNICATION. COMMON can be formed using the letters of the word COMMUNICATION. MUSICIAN cannot be formed as there is no letter ‘S’ in the word COMMUNICATION.
The amortized cost of appending an element at the end of a dynamic array is:
If an algorithm takes $5n²  + 3n + 10$ steps for an input of size n, its Big O notation would be:
Which search algorithm is complete but not always optimal?
In the context of asymmetric encryption, which of the following is a key feature of public-private key pairs?
Which algorithm constructs a suffix tree in linear time?
Which OOP principle allows for restricting access to certain parts of an object while exposing only necessary parts for interaction?
What is the best-case time complexity of the binary search algorithm ?
A graph where edges have a direction (e.g., from A to B, but not necessarily B to A) is called a:
In a multi-dimensional array representing image pixel data, how is a specific pixel (e.g., at `[row][col]`) typically accessed in terms of memory addres...
Which of the following traversal methods is used to visit nodes in the order "left child, root, right child" in a binary tree?
Relevant for Exams:
