🥳 CAT 2024 Nine Months Mega Sale 👉 Upto 60% Off Today
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?
Deleting a node whoselocation is given
Searching an unsortedlist for a given item
Inserting a node after the node with a given location
Traversing the list to process each node
We can make a class abstract by
Declaring it abstract using the virtual keyword
Making at least one memberfunction as virtual function
Making at least one memberfunction as pure virtual function
Making all memberfunction const.
A Steiner patch is
Biquadratic Bezier patch
Circular patch only
Bilinear Bezier patch
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
Completely balanced tree
.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 ?
a, c, d
a, b, d
b, c, d
a, b, c
Repeated execution of simple computation may cause compounding of
logic errors .
in C, what is the effect of a negative numberin a field width specifier ?
the values arc displayed right justified
the values are displayed centered
the values are displayedleft justified
the values are displayed as negative numbers
Follow us on
Incase of any issue contact email@example.com
Boost your Prep!