Answer Posted / zakiya
d-queme means doubly ended queue.in which insertion and
deletion can be performed any end.
| Is This Answer Correct ? | 24 Yes | 2 No |
Post New Answer View All Answers
Is treeset thread safe?
Describe the complexity of Binary search
Can the double-checked locking fail on a single processor system?
What is difference between hashmap and hashtable?
Explain what is a spanning tree?
What is sorting in math?
List all data structures you would use for a memory management module.
What is an example of an array?
What is a Breadth First Search? Give a few of its applications.
Which collection allows null values?
What do you mean by sorting?
What is the difference between sorting and classifying?
What is meant by balanced binary tree?
Define indegree of a graph?
Does set allow null values?