The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged linkedlists
+10
votes
9
answers
1
GATE2020CS16
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 \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$
asked
Feb 12
in
DS
by
Arjun

4.8k
views
gate2020cs
linkedlists
0
votes
0
answers
2
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 interpreted as $k$bit integers, and define $x.np$ ... $INSERT$, and $DELETE$ operations on such a list. Also, show how to reverse such a list in $O(1)$ time.
asked
Jun 30, 2019
in
Algorithms
by
akash.dinkar12

159
views
cormen
datastructures
linkedlists
descriptive
difficult
0
votes
1
answer
3
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 needed for the list itself.
asked
Jun 30, 2019
in
Algorithms
by
akash.dinkar12

86
views
cormen
datastructures
linkedlists
descriptive
0
votes
1
answer
4
Cormen Edition 3 Exercise 10.2 Question 6 (Page No. 241)
The dynamicset 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$.The sets $S_1$ and $S_2$ are usually destroyed by the operation. Show how to support $UNION$ in $O(1)$ time using a suitable list data structure.
asked
Jun 30, 2019
in
Algorithms
by
akash.dinkar12

48
views
cormen
datastructures
linkedlists
descriptive
0
votes
0
answers
5
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?
asked
Jun 30, 2019
in
Algorithms
by
akash.dinkar12

65
views
cormen
datastructures
linkedlists
descriptive
0
votes
0
answers
6
Cormen Edition 3 Exercise 10.2 Question 4 (Page No. 240)
LISTSEARCH’(L, k) 1 x = L.nil.next 2 while x != L.nil and x.key != k 3 x = x.next 4 return x As written, each loop iteration in the LISTSEARCH’ procedure requires two tests: one for $x\neq L.nil$ and one for $x.key\neq k$. Show how to eliminate the test for $x\neq L.nil$ in each iteration.
asked
Jun 30, 2019
in
Algorithms
by
akash.dinkar12

37
views
cormen
datastructures
linkedlists
descriptive
0
votes
2
answers
7
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.
asked
Jun 30, 2019
in
Algorithms
by
akash.dinkar12

60
views
cormen
datastructures
linkedlists
descriptive
0
votes
1
answer
8
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.
asked
Jun 30, 2019
in
Algorithms
by
akash.dinkar12

41
views
cormen
datastructures
linkedlists
descriptive
0
votes
0
answers
9
Cormen Edition 3 Exercise 10.2 Question 1 (Page No. 240)
Can you implement the dynamicset operation $INSERT$ on a singly linked list in $O(1)$ time? How about $DELETE$?
asked
Jun 30, 2019
in
Algorithms
by
akash.dinkar12

29
views
cormen
datastructures
linkedlists
descriptive
0
votes
0
answers
10
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 node at the end */ void append(struct Node** head_ref, int new_data) { struct Node* ... } while (last>next != NULL) last = last>next; last>next = new_node; new_node>prev = last; return; }
asked
May 25, 2019
in
DS
by
Arun Rout

142
views
linkedlists
0
votes
2
answers
11
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
asked
Apr 30, 2019
in
DS
by
srestha

123
views
linkedlists
datastructures
0
votes
0
answers
12
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 search on linked list Binary search on array Linear search on array Binary search on linked list
asked
Mar 2, 2019
in
Programming
by
srestha

208
views
arrays
linkedlists
0
votes
1
answer
13
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) ; if (b = = NULL) return (a) ; If (a → data <= ... two linked lists by selecting the alternate nodes merges two sorted linked lists into final sorted linked list merges two linked lists by selecting the nodes in reverse.
asked
Dec 27, 2018
in
DS
by
sharadsingh

163
views
linkedlists
datastructures
programminginc
+1
vote
1
answer
14
NTA NET DEC18 Q6
asked
Dec 26, 2018
in
Algorithms
by
Sanjay Sharma

120
views
linkedlists
+1
vote
0
answers
15
Gateforum Test Series: Programming & DS  Linked Lists
asked
Dec 24, 2018
in
DS
by
Gupta731

168
views
gateforumtestseries
datastructures
linkedlists
0
votes
0
answers
16
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 the value of 'n' is 5, then the function return 1, but if the value of 'n' is 9, then what does it do ?
asked
Dec 5, 2018
in
DS
by
Mk Utkarsh

199
views
linkedlists
datastructures
0
votes
1
answer
17
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 position in the linked list. Consider the following ... pointer to the starling node of the linked list. Which of the following options is correct? How deletion possible with S2?
asked
Dec 3, 2018
in
DS
by
Ashish Roy 1

263
views
madeeasytestseries
datastructures
linkedlists
0
votes
0
answers
18
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)%n== FRONT (or) (FRONT+1)%n==REAR (or) FRONT==REAR Empty: ... So, in case of Full, Rear point array that must be array index more than Front Am I right? Then what equation will valid?
asked
Nov 21, 2018
in
Programming
by
srestha

242
views
linkedlists
datastructures
0
votes
0
answers
19
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 is... As there is no previous pointer so we traverse the list from the starting to just ... complexity as O(n) and space complexity O(1). but in the book the time complexity is mentioned O(1) where am I going wrong?
asked
Nov 21, 2018
in
DS
by
aditi19

169
views
timecomplexity
linkedlists
datastructures
0
votes
1
answer
20
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=start; while(ptr!=NULL) { next=ptr>link; ptr>link=prev; prev=ptr; ptr=next; } start=prev; return start; Plz tell me, is here all link updating correctly?
asked
Nov 19, 2018
in
Programming
by
srestha

213
views
linkedlists
datastructures
+1
vote
0
answers
21
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 the number of nodes and the number of elements in each node are equal? $A)O(n)$ $B)O(\sqrt n)$ $C)O(nlogn)$ $D)O(n^{2})$
asked
Nov 19, 2018
in
Programming
by
Lakshman Patel RJIT

265
views
datastructures
linkedlists
0
votes
0
answers
22
Intersection among elements of Linked List
Given two unsorted singlylinked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common elements between the input lists. How much time does the intersection algorithm requires in worst case, if it is allowed to use constant extra space only?
asked
Nov 5, 2018
in
DS
by
srestha

279
views
linkedlists
datastructures
0
votes
0
answers
23
Linked list implementation of Previous
Consider the following function: Find(Element Type X,List L) { Position Prev_Pos,XPos; Prev_Pos=Find Previous(X,L); if(Prev_Pos>Next!=NULL) /* found */ { XPos=Prev_Pos>Next; Prev_Pos>Next=XPos>Next; ... lists $B)$Linked list implementation of singly linked lists $C)$Linked list implementation of doubly linked lists $D)$None of these
asked
Oct 26, 2018
in
DS
by
Lakshman Patel RJIT

104
views
datastructures
linkedlists
0
votes
0
answers
24
Reverse Linked list
What is the time complexity of the bestknown algorithm to reverse a doubly linked list? $A) O(n)$ $B) O(logn)$ $C) O(1)$ $D) O(n^{2})$
asked
Oct 26, 2018
in
DS
by
Lakshman Patel RJIT

144
views
datastructures
linkedlists
0
votes
0
answers
25
IISCCDS Written Test Sample Question
asked
Oct 26, 2018
in
Programming
by
Sayan Bose

705
views
iisc
cds
linkedlists
0
votes
1
answer
26
test question
We wish to implement a double ended queue using link list. The double ended queue must support , the operations of (i) struct node *push_back(struct node*,struct node * ,int )  pushing at the end of the list (ii) struct node *pop_back(struct node* ) popping ... rear; S3:front==NULL S4:front=front>next S1:rear>next=temp; S2:rear=temp; S3:front==NULL S4:front=front>next
asked
Oct 18, 2018
in
Programming
by
Prince Sindhiya

73
views
linkedlists
datastructures
programming
0
votes
1
answer
27
Linked list insertion
In a linked list with $n$ nodes, the time taken to insert an element after an element pointed by some pointer is: $(A) O(1)$ $(B) O(logn)$ $(C) O(n)$ $(D) O(nlogn)$
asked
Oct 18, 2018
in
DS
by
Lakshman Patel RJIT

186
views
datastructures
linkedlists
+1
vote
0
answers
28
Linked list
If the head of a Linked List is pointing to $k$ th element, then how will you get the elements before $k$ th element?
asked
Oct 18, 2018
in
DS
by
Lakshman Patel RJIT

112
views
datastructures
linkedlists
0
votes
0
answers
29
Linked List Data Structures And Algorithms Made Easy By Narasimha Karumanchi
Suppose there are two singly linked lists both of which intersect at some point and become a single linked list. The head or start pointers of both the lists are known, but the intersecting node is not known. ... ; n. Give an algorithm for finding the merging point. And find the time complexity and space complexity also.
asked
Oct 18, 2018
in
DS
by
Lakshman Patel RJIT

271
views
datastructures
linkedlists
0
votes
1
answer
30
Doubt
can anyone explain in detail why and how is merge sort optimal for linked list?
asked
Sep 26, 2018
in
DS
by
aditi19

75
views
linkedlists
mergesort
Page:
1
2
3
4
5
6
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IISc CDS Interview Experience, 2020
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
PGEE 2020 (CSE) Experience
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged linkedlists
Recent Blog Comments
Q1. I don't know any trick or method, I usually...
Yeah, Now it's on.
Can you check now?
Even I filled NIELIT form which had similar...
Today's test will be late  either midnight or...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,375
questions
60,580
answers
201,986
comments
95,396
users