Register

Recent questions tagged linked-list

3 3 votes
1 1 answer
1.9k
1.9k views
Semaphores:
Assume that you have a semaphore associated with each item on a doubly linked list. Using No other synchronization primitive, What is the fewest number of semaphore that ...
User Avatar
5 5 votes
3 answers 3 answers
2.6k
2.6k views
GATE Overflow | Data Structures | Test 1 | Question: 24
You are given a linked list, $L$ of $n$ integers, and another linked list, $P$, of $k$ integers where $k <<< n$. $L$ is sorted in ascending order but $P$ is not necessari...
User Avatar
5 5 votes
2 answers 2 answers
3.6k
3.6k views
GATE Overflow | Data Structures | Test 1 | Question: 2
For a singly linked list where each node has a pointer to a data array as well as a next pointer, what would be the worst case time complexity to delete an intermediate n...
User Avatar
2 2 votes
1 answers 1 answer
1.0k
1.0k views
GATE Overflow | Data Structures | Test 1 | Question: 1
The following C function takes a singly-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing th...
User Avatar
4 4 votes
2 answers 2 answers
1.3k
1.3k views
GATE Overflow | Algorithms | Test 1 | Question: 18
Time complexity of the optimal algorithm to interchange the $m^{th}$ and $n^{th}$ elements of a singly Linked List is $\Theta(m+n)$$\Theta(m)$ when $m\geq n$ otherwise $...
User Avatar
4 4 votes
2 answers 2 answers
1.2k
1.2k views
linked list
Two linked lists having n and m elements are stored in sorted order. What is the worst case complexity of program to print common elements of two lists ?$\begin{align*} &...
User Avatar
0 0 votes
1 answers 1 answer
2.5k
2.5k views
UGC NET CSE | August 2016 | Part 2 | Question: 21
Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of ...
User Avatar
0 0 votes
1 answers 1 answer
1.0k
1.0k views
Linked Lists
Q)The below code returns decimal value of binary linked list int val(struct Node *head) { struct Node *p = head; int val2= 0; while (p!= NULL) { XYZ;//fill the contents o...
User Avatar
0 0 votes
1 1 answer
1.1k
1.1k views
Linked_List
To insert a node at the end of double linked list we need to modify two pointers right??But answer given is one pointer.can someone clarify?
User Avatar
5 5 votes
1 answers 1 answer
4.6k
4.6k views
Recurrence relation in constructing balanced tree from linked list and array
Consider the following algorithm to build a balanced search tree from a sorted sequence.* Make the mid-point of the sequence the root of the tree* Recursively construct b...
User Avatar
2 2 votes
1 1 answer
743
743 views
Linked list
How does this code return Nth the node from the end of the linked list in one pass?Node * GetNthNode ( Node* Head , int NthNode ){ Node * pNthNode = NULL; Node ...
User Avatar
2 2 votes
1 1 answer
7.8k
7.8k views
UGC NET CSE | December 2013 | Part 2 | Question: 22
If the queue is implemented with a linked list, keeping track of a front pointer, which of these pointers will change during an insertion into an non-empty queue?Neither ...
User Avatar
3 3 votes
2 answers 2 answers
3.7k
3.7k views
Amazon Interview question on Linked list
Given a linked list :1->2->3->4->5->6,make the following changes1->6->2->5->3->4What would be the most effiicient way to make this change?
User Avatar
2 2 votes
2 2 answers
5.3k
5.3k views
UGC NET CSE | September 2013 | Part 2 | Question: 12
The efficient data structure to insert/delete a number in a stored set of number isQueueLinked listDoubly linked listBinary tree
User Avatar
7 7 votes
7 answers 7 answers
20.1k
20.1k views
ISRO CSE 2014 | Question: 49
Consider a single linked list where $F$ and $L$ are pointers to the first and last elements respectively of the linked list. The time for performing which of the given op...
User Avatar
5 5 votes
2 answers 2 answers
3.3k
3.3k views
How to Trace the recursion ?
Can Someone explain either Tree or Stack method to trace out this recursion ?What is the output of this Program ?
User Avatar
5 5 votes
3 answers 3 answers
18.4k
18.4k views
ISRO CSE 2008 | Question: 72
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?Deleting a node whose location is givenSearching an unsor...
User Avatar
2 2 votes
1 answers 1 answer
19.4k
19.4k views
ISRO CSE 2008 | Question: 71
The time required to search an element in a linked list of length n is$O(\log_2 n)$$O(n)$$O(1)$$O(n^2)$
User Avatar
14 14 votes
2 answers 2 answers
3.5k
3.5k views
ISI2015-PCB-CS-3a
Consider a linked list containing $n$ nodes, where each node contains two pointers $ptr1$ and $ptr2$. For each node, $ptr1$ points to the next node of the list. Describe ...
User Avatar
9 9 votes
1 answers 1 answer
1.8k
1.8k views
CMI2012-B-07
We use the notation $[x1,x2,...,xn]$ to denote a list of integers. $[]$ denotes the empty list, and $[n]$ is the list consisting of one integer $n$. For a nonempty list l...
User Avatar
2 2 votes
0 0 answers
619
619 views
CMI2011-B-07a
A finite sequence of bits is represented as a list with values from the set $\{0,1\}$—for example, $[0,1,0], [1,0,1,1], \dots [ \: ]$ denotes the empty list, and $[b]$ is...
User Avatar
1 1 vote
0 0 answers
744
744 views
CMI2010-B-07a
A finite sequence of bits is represented as a list with values from the set {0,1}&mdash;for example, [0,1,0], [1,0,1,1], . . . .[ ] denotes the empty list, and [b] is the...
User Avatar
8 8 votes
4 answers 4 answers
8.9k
8.9k views
ISRO-2013-4
The following steps in a linked listp = getnode() info(p) = 10 next (p) = list list = presult in which type of operation?Pop operation in stackRemoval of a nodeInserting ...
User Avatar
0 0 votes
4 4 answers
1.9k
1.9k views
How to manipulate the given linked list in the following manner in O(n) time ?
If we are given a linked list then we have to manipulate such that even indexed node are arranged together and oddindexed nodes are arranged together after even indexed n...
User Avatar
162 162 votes
15 answers 15 answers
57.9k
57.9k views
GATE CSE 2016 | Set 2 | Question: 15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is...
User Avatar
3 3 votes
2 2 answers
3.8k
3.8k views
Linked list
User Avatar
1 1 vote
1 1 answer
1.2k
1.2k views
MadeEasy Test Series: Programming & DS - Linked Lists
Here, what will be the Head->Next , I am confused is it first element 50 or second element 29.
User Avatar
2 2 votes
0 0 answers
694
694 views
Linked allocation
A program has just read the $12^{th}$ disk block using linked allocation. If it next want to read the $5^{th}$ disk block, then the number of disk blocks must the program...
User Avatar
0 0 votes
1 1 answer
5.8k
5.8k views
linked list
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); prin...
User Avatar
1 1 vote
1 1 answer
1.1k
1.1k views
Given the unordered linked list as a queue, what operations would take O(1) time?
My doubt is that the single list queue is the form : 1->2->3->4->5->6->7->8->9->NULL with 1 as the rear node and 9 as the front node. Also, in a queue, addition takes fro...
User Avatar
Page: