Array
Container of objects of similar types
Which of these best describes an array?
a linkedlist that allows faster search within an ordered sequence
What is a skip list?
(rear+1) % CAPACITY
In a circular queue, how do you increment the rear end of the queue?
Stack
What data structure is used when converting an infix notation to prefix notation?
3
How many child nodes does each node of Ternary Tree contain?
int arr[] = new int[3];
How do you instantiate an array in Java?
balanced binary search trees
To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
First In First Out
The properties is associated with a queue?
infix notation for the given equation
+*AB*CD
What would be the Prefix notation for the given equation?
A+(B*C)
Parent
the name of the node having child nodes?
int[][]arr;
the correct way to declare a multidimensional array in Java?
probabilistically
The nodes in a skip list may have many forward references. their number is determined
O(n)
What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?
O(logn)
What is the time complexity for converting decimal to binary numbers?
0
What is the depth of the root node of the ternary tree?
Run-time
When does the ArrayIndexOutOfBoundsException occur?
Linked list
A linear collection of data elements where the linear node is given by means of pointer is called?
To avoid collision in hash tables
What are the applications of dequeue?
pop
Process of removing an element from stack is called __________
B – tree
2-3 tree is a specific form of _________
Spatial locality
The concepts make extensive use of arrays?
Pointer to node
In linked list each node contains a minimum of two fields. One field is data field to store the data second field is?
Empty the first jar by removing it one by one from the first jar and placing it into the second jar and empty the second jar by placing all the rings into the first jar one by one
You have two jars, one jar which has 10 rings and the other has none. They are placed one above the other. You want to remove the last ring in the jar. And the second jar is weak and cannot be used to store rings for a long time.
Underflow
In a stack, if a user tries to remove an element from an empty stack it is called _________
between log3(n + 1) and log2(n + 1)
The height of 2-3 tree with n elements is ______