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
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
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
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
in
Algorithms
by
akash.dinkar12
Boss
(
41.3k
points)

52
views
cormen
datastructure
linkedlists
descriptive
difficult
0
votes
0
answers
2
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
in
Algorithms
by
akash.dinkar12
Boss
(
41.3k
points)

14
views
cormen
datastructure
linkedlists
descriptive
0
votes
0
answers
3
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
in
Algorithms
by
akash.dinkar12
Boss
(
41.3k
points)

4
views
cormen
datastructure
linkedlists
descriptive
0
votes
0
answers
4
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
in
Algorithms
by
akash.dinkar12
Boss
(
41.3k
points)

8
views
cormen
datastructure
linkedlists
descriptive
0
votes
0
answers
5
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
in
Algorithms
by
akash.dinkar12
Boss
(
41.3k
points)

3
views
cormen
datastructure
linkedlists
descriptive
0
votes
1
answer
6
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
in
Algorithms
by
akash.dinkar12
Boss
(
41.3k
points)

9
views
cormen
datastructure
linkedlists
descriptive
0
votes
0
answers
7
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
in
Algorithms
by
akash.dinkar12
Boss
(
41.3k
points)

5
views
cormen
datastructure
linkedlists
descriptive
0
votes
0
answers
8
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
in
Algorithms
by
akash.dinkar12
Boss
(
41.3k
points)

4
views
cormen
datastructure
linkedlists
descriptive
0
votes
0
answers
9
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
(
109
points)

52
views
linkedlists
0
votes
1
answer
10
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
(
113k
points)

39
views
linkedlists
datastructure
0
votes
0
answers
11
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
(
113k
points)

79
views
arrays
linkedlists
0
votes
1
answer
12
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)

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

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

104
views
gateforumtestseries
datastructure
linkedlists
0
votes
0
answers
15
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.8k
points)

120
views
linkedlists
datastructure
0
votes
0
answers
16
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)

149
views
madeeasytestseries
datastructure
linkedlists
0
votes
0
answers
17
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
(
113k
points)

153
views
linkedlists
datastructure
0
votes
0
answers
18
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
(
4.1k
points)

110
views
timecomplexity
linkedlists
datastructure
0
votes
1
answer
19
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
(
113k
points)

114
views
linkedlists
datastructure
0
votes
0
answers
20
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
(
45.8k
points)

177
views
datastructure
linkedlists
0
votes
0
answers
21
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
(
113k
points)

191
views
linkedlists
datastructure
0
votes
0
answers
22
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
23
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
24
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
25
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
26
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
27
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
28
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
(
45.8k
points)

53
views
datastructure
linkedlists
0
votes
0
answers
29
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
(
45.8k
points)

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

422
views
iisc
cds
linkedlists
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
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
Follow @csegate
Recent questions tagged linkedlists
Recent Blog Comments
Refund time depends on the payment mode ...
@Arjun Sir , when can i expect my refund in the...
This book is returned you can enable a pay now...
@Pranavcool The book stocks are over and no one...
@Lokesh Thats unfortunate. I have refunded you....
49,830
questions
54,807
answers
189,530
comments
80,840
users