Register

Recent questions tagged linked-list

6 6 votes
0 0 answers
2.5k
2.5k views
NIELIT 2017 July Scientist B (CS) - Section B: 1
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",h...
User Avatar
6 6 votes
0 0 answers
2.0k
2.0k views
NIELIT 2017 July Scientist B (CS) - Section B: 3
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that a node of doubly linked list has previous pointer as $\text...
User Avatar
2 2 votes
2 2 answers
1.6k
1.6k views
UGC NET CSE | December 2007 | Part 2 | Question: 12
Consider the following linked list :Which of the following piece of code will insert the node pointed to by $q$ at the end of the list ?$\text{for (p=list; p !=NULL; p=p ...
User Avatar
0 0 votes
1 1 answer
1.4k
1.4k views
UGC NET CSE | December 2006 | Part 2 | Question: 25
Which one of the following is a physical data structure ?ArrayLinked listsStacksTables
User Avatar
1 1 vote
1 1 answer
677
677 views
UGC NET CSE | June 2005 | Part 2 | Question: 21
What is the time required to insert an element in a stack with linked implementation?$O \left(\log_{2}n \right)$$O \left(n \right)$$O \left(n \log_{2}n \right)$$O \left(1...
User Avatar
2 2 votes
1 1 answer
1.8k
1.8k views
UGC NET CSE | December 2004 | Part 2 | Question: 24
What operation is supported in constant time by the doubly linked list, but not by the singly linked list ?AdvanceBackupFirstRetrieve
User Avatar
62 62 votes
13 answers 13 answers
47.6k
47.6k views
GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...
User Avatar
0 0 votes
0 0 answers
904
904 views
Cormen Edition 3 Exercise 10.2 Question 8 (Page No. 241)
Explain how to implement doubly linked lists using only one pointer value $x.np$ per item instead of the usual two (next and prev). Assume that all pointer values can be ...
User Avatar
0 0 votes
1 1 answer
1.7k
1.7k views
Cormen Edition 3 Exercise 10.2 Question 7 (Page No. 241)
Give a $\Theta(n)$ time nonrecursive procedure that reverses a singly linked list of $n$ elements. The procedure should use no more than constant storage beyond that need...
User Avatar
1 1 vote
1 1 answer
920
920 views
Cormen Edition 3 Exercise 10.2 Question 6 (Page No. 241)
The dynamic-set operation $UNION$ takes two disjoint sets $S_1$ and $S_2$ as input, and it returns a set $S=S_1 \cup S_2$ consisting of all the elements of $S_1$ and $S_2...
User Avatar
1 1 vote
1 1 answer
861
861 views
Cormen Edition 3 Exercise 10.2 Question 5 (Page No. 240)
Implement the dictionary operations $INSERT$, $DELETE$, and $SEARCH$ using singly linked, circular lists. What are the running times of your procedures?
User Avatar
0 0 votes
0 0 answers
561
561 views
Cormen Edition 3 Exercise 10.2 Question 4 (Page No. 240)
LIST-SEARCH’(L, k) 1 x = L.nil.next 2 while x != L.nil and x.key != k 3 x = x.next 4 return xAs written, each loop iteration in the LIST-SEARCH’ procedure requires two te...
User Avatar
2 2 votes
2 2 answers
668
668 views
Cormen Edition 3 Exercise 10.2 Question 3 (Page No. 240)
Implement a queue by a singly linked list $L$. The operations of $ENQUEUE$ and $DEQUEUE$ should still take $O(1)$ time.
User Avatar
1 1 vote
1 1 answer
674
674 views
Cormen Edition 3 Exercise 10.2 Question 2 (Page No. 240)
Implement a stack using a singly linked list $L$. The operations $PUSH$ and $POP$ should still take $O(1)$ time.
User Avatar
0 0 votes
1 1 answer
830
830 views
Cormen Edition 3 Exercise 10.2 Question 1 (Page No. 240)
Can you implement the dynamic-set operation $INSERT$ on a singly linked list in $O(1)$ time? How about $DELETE$?
User Avatar
0 0 votes
0 0 answers
801
801 views
doubly linked linked list
why we use double pointer struct Node head here? can anyone explain with details /* Given a reference (pointer to pointer) to the head of a DLL and an int, appends a new...
User Avatar
0 0 votes
2 2 answers
1.2k
1.2k views
Self Doubt on Linked List
Can somebody write the code or algorithm, how merge sort works efficiently in linked list? Is Heap sort most inefficient in Linked List Sorting? Elaborate plz
User Avatar
1 1 vote
0 0 answers
1.8k
1.8k views
Locality of Rference(OS+DS) (ACE)
An OS uses virtual memory with paging technique for memory allocation. Which of the following searching technique on given data structure use locality of reference?Linear...
User Avatar
0 0 votes
3 3 answers
885
885 views
UPPCL AE 2018:60
The following function attempts to merge two sorted linked lists. ListNode is the custom structure representing a node in the linked list.ListNode* Merge(ListNode* pHead1...
User Avatar
1 1 vote
2 2 answers
4.3k
4.3k views
UGC NET CSE | December 2018 | Part 2 | Question: 29
Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node $a$, pointer to this node is $q$, from the list?$O(n ...
User Avatar
7 7 votes
1 answers 1 answer
2.9k
2.9k views
GATE Overflow | Mock GATE | Test 1 | Question: 62
Which of the following sorting algorithms performs efficiently to sort a singly linked list containing $\log n$ nodes and the corresponding time complexity is?$\text{Inse...
User Avatar
1 1 vote
3 3 answers
1.7k
1.7k views
Linked list
What does the following program do on two linked lists? Struct node *myFun (struct node * a, struct node * b) { Struct node *new = NULL ; If (a = = NULL) return (b) ;...
User Avatar
1 1 vote
1 1 answer
735
735 views
selfdoub
User Avatar
2 2 votes
1 1 answer
2.0k
2.0k views
Testbook - Linked List
int find (struct node * first, int n) { while (first data ! = n) first = first — next; if (first data = = n) return(1); else return (-1); in the above code segment if th...
User Avatar
2 2 votes
1 1 answer
4.6k
4.6k views
MadeEasy Test Series: Programming & DS - Linked Lists
You're entrusted with the task of deleting a node in a singly linkedlist, whose data field is 'x'. Note that, the node which is to be deleted can be at any arbitrary posi...
User Avatar
1 1 vote
0 0 answers
2.2k
2.2k views
Circular Link List Insertion and Deletion
Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements.Now, in this queue what will be condition for FULL and EMPTY?Full:(REAR+1...
User Avatar
1 1 vote
2 2 answers
2.0k
2.0k views
Karumanchi
There is a singly linked list. We have a pointer to a particular node(it is not tail node). what is the time and space complexity required to delete this node?my approach...
User Avatar
0 0 votes
1 1 answer
2.3k
2.3k views
Reversing Singly Linked List
To reverse a Singly Linked List is the below is correct code? (or) need to change Struct node *reverse(struct node *start) { Struct node *prev,*ptr,*next; prev=NULL; ptr=...
User Avatar
1 1 vote
0 0 answers
1.7k
1.7k views
Linked list Quiz
Consider an unrolled linked list with $n$ elements.This list stores multiple elements in each node.What is the worst case time complexity to find the $k^{th}$ element if ...
User Avatar
Page: