Hey..!!

- Level 3
- 50 %

Accuracy -

share

What will be the output of the program class BoolArray { boolean [] b = new boolean[3]; int count = 0; void set(boolean [] x, int i) { x[i] = true; ++count; } public static void main(Strin

What is the time complexity to count the number of element in linked list

Which of the following assertions are CORRECT? P: Adding 7 to each entry in a list adds 7 to the mean of the list Q: Adding 7 to each entry in a list adds 7 to the standard deviation of the list R:

If the DTD is included in your XML source file, it should be wrapped in a DOCTYPE definition with the following syntax:

Which of the following assertions are CORRECT? P: Adding 7 to each entry in a list adds 7 to the mean of the listQ: Adding 7 to each entry in a list adds 7 to the standard deviation of the list R: D

What is time complexity of searching for an element in a circular linked list

What would be the asymptotic time complexity to find an element in the linked list

What is the time complexity of the above iterative code used to find the smallest and largest element in a linked list

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list

In a cross linked polymer, the monomeric units are linked together to constitute a three dimensional network. Which of the following is a cross-linked polymer