For the following questions answer them individually
.The time required to search an elementin a linked list of length n is
Whichof the following operations is performed moreefficiently by doubly linkedlist than by linear linked list?
We can make a class abstract by
A complete binary tree with the property that the value at each — nodeis at least as large as the valuesat its children is known as
.The minimum numberoffields with each node of doubly linked list is
How many comparisonsare neededto sort an array of length 5 if a straight selection sort is used andarray is already in the opposite order ?
Consider the graph shown in the figure below.
Which of the following is a valid strong component ?
Repeated execution of simple computation may cause compounding of
in C, what is the effect of a negative numberin a field width specifier ?