×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
In a circular queue the value of r will be ..
2.
Which of the following statement is true?
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
3.
The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
4.
What will be the value of top, if there is a size of stack STACK_SIZE is 5
5.
………… is not the operation that can be performed on queue.
6.
There is an extra element at the head of the list called a
7.
A graph is a collection of nodes, called
8.
A ……….. is a graph that has weights of costs associated with its edges.
9.
In general, the binary search method needs no more than ……………. comparisons.
10.
Which of the following is not the type of queue?