a) Once b) Twice c) Thrice d) Four times Answer: d Explanation: First each element from the first stack is ...
View QuestionWhich of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
a) Insertion Sort b) Quick Sort c) Heap Sort d) ...
View Question
What does the following function do for a given Linked List with first node as head?
void fun1(struct node* head)
{
if(head == NULL)
return;
fun1(head->next);
printf(“%d “, head->data);
}
What does the following function do for a given Linked List with first node as head? void fun1(struct node* ...
View QuestionWhich of the following points is/are not true about Linked List data structure when it is compared with an array?
a) Arrays have better cache locality that can make them better in terms of ...
View QuestionLinked list data structure offers considerable saving in _____________
a) Computational Time b) Space Utilization c) Space Utilization and Computational Time d) Speed Utilization Answer: ...
View QuestionIn Linked List implementation, a node carries information regarding ___________
a) Data b) Link c) Data and Link d) Node Answer: c Explanation: A linked list is ...
View QuestionLinked list is considered as an example of ___________ type of memory allocation.
a) Dynamic b) Static c) Compile time d) Heap Answer: a
View QuestionLinked lists are not suitable for the implementation of ___________
a) Insertion sort b) Radix sort c) Polynomial manipulation d) Binary search Answer: d ...
View QuestionWhat kind of linked list is best to answer questions like “What is the item at position n?”
a) Singly linked list b) Doubly linked list c) Circular linked list d) Array ...
View Question
Consider the following definition in c programming language.
struct node
{
int data;
struct node * next;
}
typedef struct node NODE;
NODE *ptr;
Which of the following c code is used to create new node?
Consider the following definition in c programming language. struct node { int data; struct ...
View Question