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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged linkedlists
0
votes
0
answers
1
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 24
in
DS
by
Arun Rout
(
107
points)

38
views
linkedlists
0
votes
1
answer
2
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 29
in
DS
by
srestha
Veteran
(
111k
points)

31
views
linkedlists
datastructure
0
votes
0
answers
3
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
in
Programming
by
srestha
Veteran
(
111k
points)

66
views
arrays
linkedlists
0
votes
1
answer
4
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
(
29
points)

84
views
linkedlists
datastructure
programminginc
0
votes
1
answer
5
NTA NET DEC18 Q6
asked
Dec 25, 2018
in
Algorithms
by
Sanjay Sharma
Boss
(
47.1k
points)

84
views
linkedlists
0
votes
0
answers
6
Gateforum Test Series: Programming & DS  Linked Lists
asked
Dec 24, 2018
in
DS
by
Gupta731
Active
(
4.5k
points)

96
views
gateforumtestseries
datastructure
linkedlists
0
votes
0
answers
7
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
Boss
(
34.5k
points)

113
views
linkedlists
datastructure
0
votes
0
answers
8
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
(
167
points)

139
views
madeeasytestseries
datastructure
linkedlists
0
votes
0
answers
9
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 20, 2018
in
Programming
by
srestha
Veteran
(
111k
points)

124
views
linkedlists
datastructure
0
votes
0
answers
10
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 20, 2018
in
DS
by
aditi19
Active
(
3.7k
points)

107
views
timecomplexity
linkedlists
datastructure
0
votes
1
answer
11
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
Veteran
(
111k
points)

109
views
linkedlists
datastructure
0
votes
0
answers
12
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 18, 2018
in
Programming
by
Lakshman Patel RJIT
Boss
(
39.5k
points)

170
views
datastructure
linkedlists
0
votes
0
answers
13
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 4, 2018
in
DS
by
srestha
Veteran
(
111k
points)

190
views
linkedlists
datastructure
0
votes
0
answers
14
GATEBOOK2019DS117
Consider following function for a given Linked List $L$ as: $head\rightarrow[1]\rightarrow[2]\rightarrow[3]\rightarrow[4]\rightarrow[6]\rightarrow[5]\rightarrow[7]$, which is pointed to by a $\text{head}$ pointer. (Assume the type of $\text{head}$ as $\text{struct node *}$ which is already defined.) void foo( ... $7 \: 5 \: 3 \: 1$ $7 \: 6 \: 5 \: 4 \: 3 \: 2 \: 1$
asked
Oct 27, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

123
views
gb2019ds1
linkedlists
+1
vote
0
answers
15
GATEBOOK2019DS118
Consider the following function processing a doubly linked list. void magic(struct node **headptr) { struct node *temp = NULL; struct node *curr = *headptr; while (curr != NULL) { temp = curr > prev; curr > prev = curr > next; curr ... $\text{None of the above}$
asked
Oct 27, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

141
views
gb2019ds1
linkedlists
0
votes
0
answers
16
GATEBOOK2019DS119
Which of the following sorting algorithms best suits to sort a set of integer data items stored in nodes of a doubly linked list, with minimum worst case time complexity? Merge Sort Heap Sort Quick Sort Insertion Sort
asked
Oct 27, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

149
views
gb2019ds1
linkedlists
0
votes
1
answer
17
GATEBOOK2019DS121
Consider a singly circular linked list with a pointer $ \text{head} $ pointing to the first node of the linked list. What are the time complexities of finding $k^{th}$ element from beginning and $k^{th}$ element from end in a singly linked list (where $k$ is some number less than the size of ... $O(1) \text{and }O(1)$ $O(n) \text{and } O(1)$ $O(1) \text{and } O(n)$
asked
Oct 27, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

84
views
gb2019ds1
linkedlists
0
votes
0
answers
18
GATEBOOK2019DS123
Consider a doubly linked list shown below: $\text{head} \rightarrow [1] \leftrightarrow [2] \leftrightarrow [3] \leftrightarrow [4] \leftrightarrow [5] \leftrightarrow [6] \leftrightarrow [7] $. Consider the function $change()$ defined below, where $ \text{head}$ points to the first node in the linked list: void ... $7 \: 6 \: 5 \: 3 \:1$ $6\: 7 \: 5 \: 3 \: 1$
asked
Oct 27, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

84
views
gb2019ds1
linkedlists
+1
vote
0
answers
19
GATEBOOK2019DS124
Consider the function foo defined below. bool foo(struct node *p) { if (p == NULL)  (p → next == NULL)  (( P→ data < p → next→ data) && foo(p → next)) return true; else return false; } For a given linked ... the elements in the list are sorted in nonincreasing order of data value the elements in the list are sorted in strictly increasing order of data value
asked
Oct 27, 2018
in
Programming
by
GATEBOOK
Boss
(
11.4k
points)

60
views
gb2019ds1
linkedlists
0
votes
0
answers
20
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
Boss
(
39.5k
points)

48
views
datastructure
linkedlists
0
votes
0
answers
21
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
Boss
(
39.5k
points)

64
views
datastructure
linkedlists
0
votes
0
answers
22
IISCCDS Written Test Sample Question
asked
Oct 25, 2018
in
Programming
by
Sayan Bose
Loyal
(
6.9k
points)

408
views
iisc
cds
linkedlists
0
votes
1
answer
23
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 17, 2018
in
DS
by
Lakshman Patel RJIT
Boss
(
39.5k
points)

99
views
datastructure
linkedlists
+1
vote
0
answers
24
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 17, 2018
in
DS
by
Lakshman Patel RJIT
Boss
(
39.5k
points)

65
views
datastructure
linkedlists
0
votes
0
answers
25
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 17, 2018
in
DS
by
Lakshman Patel RJIT
Boss
(
39.5k
points)

126
views
datastructure
linkedlists
0
votes
1
answer
26
Doubt
can anyone explain in detail why and how is merge sort optimal for linked list?
asked
Sep 26, 2018
in
DS
by
aditi19
Active
(
3.7k
points)

44
views
linked
linkedlists
merge
mergesort
0
votes
1
answer
27
conceptual doubt
WHAT IS THE TIME COMPLEXITY TO ENQUEUE AN ELEMENT IF THE QUEUE IS IMPLEMENTED AS A CIRCULAR QUEUE AND WE HAVE GOT ONLY ONE POINTER TO FRONT ELEMENT??
asked
Sep 20, 2018
in
DS
by
sushmita
Boss
(
16.3k
points)

158
views
datastructure
linkedlists
timecomplexity
queues
0
votes
0
answers
28
Linked List Problem
struct node* foo(struct node* a, struct node* b) { struct node* result, *rec; if(a==null) return b; else if(b==null) return a; else { rec=foo(a>next,b>next); result=a; a>next=b; b>next=rec; return result; } }
asked
Sep 17, 2018
in
Programming
by
Vaishnavi01
(
143
points)

96
views
datastructure
linkedlists
algorithms
0
votes
1
answer
29
Testbook Test Series: Programming & DS  Linked Lists
The answer is 'd' will be printed. Can someone draw the linked list after the operations are performed. I think the second operation of the code doesn't bring in any change to the list. thanks in advance
asked
Aug 23, 2018
in
Programming
by
Kalpataru Bose
(
349
points)

75
views
testbooktestseries
linkedlists
datastructure
programminginc
0
votes
1
answer
30
Link list
Suppose we are deleting a node with data field as x. Which can be present anywhere in the list. Consider following Scenarios : S1 : You're only provided with pointer to the node which needs to be deleted. S2 : You're only provided with the pointer to the starting ... cases for S2. D. Deletion is not possible for certain cases in S2, but deletion is possible in all cases for S1. Ans. C
asked
Aug 22, 2018
in
DS
by
Na462
Loyal
(
6.6k
points)

49
views
linkedlists
datastructure
Page:
1
2
3
4
5
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
The day that made me an IIScian :)
Unanswered Previous year GATE/TIFR questions
From being a Failure to getting into IISc  (Rank 888, Score 692)
My interview experience at IITs/IISc
IIT Delhi CSE Mtech interview 14 may
Follow @csegate
Recent questions tagged linkedlists
Recent Blog Comments
Congratulations 👍 Very nice experience 😊
Congo :) U deserve it :)
Address will be confirmed again before shipping ...
sir by mistake I have given my home address...
Corrected now 👍
49,541
questions
54,071
answers
187,187
comments
70,978
users