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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Recent questions tagged linkedlists
0
votes
0
answers
1
Printing elements of linkedlist using recursion.
asked
Mar 6
in
Programming
by
Ahsanul Hoque
(
163
points)

68
views
recursion
linkedlists
+7
votes
2
answers
2
GATE20183
A queue is implemented using a noncircular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let $n$ denote the number of nodes in the queue. Let 'enqueue' be implemented by inserting a new node at the head, and 'dequeue' be implemented by deletion ... $\theta(1), \theta(1)$ $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(n), \theta(n)$
asked
Feb 14
in
DS
by
gatecse
Boss
(
18k
points)

1.8k
views
gate2018
algorithms
datastructure
queues
normal
linkedlists
0
votes
1
answer
3
linked list
the sorage requirements of a linked stack with n elements will be what
asked
Feb 9
in
DS
by
kd.....
(
211
points)

102
views
linkedlists
datastructure
algorithms
programminginc
+1
vote
1
answer
4
Linked List
How D) could be answer here? I think for head>next=temp; will not work properly. Am I doing any mistake?
asked
Jan 26
in
DS
by
srestha
Veteran
(
83.8k
points)

76
views
linkedlists
datastructure
+2
votes
0
answers
5
Linked List
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 decreasekey operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following ... (C) O(N2) (D) Θ(N2 Log N) Doubt : What is decrease key? Decreasing the value? and answer to the question.
asked
Jan 18
in
Programming
by
gauravkc
Loyal
(
5.4k
points)

79
views
linkedlists
datastructure
+2
votes
1
answer
6
Linked List
Which of the following is worst choice to sort a linked list? a)Merge Sort b) Quick Sort c) heap sort d) Insertion sort
asked
Jan 18
in
DS
by
srestha
Veteran
(
83.8k
points)

87
views
linkedlists
datastructure
+2
votes
0
answers
7
Data Structure
The minimum size of queue required when performing BFS on above graph is ________. (Size of queue is represented by maximum number of element at any time). I am getting 3. Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If ... [20] [30] is ________. (Assume the first element is stored at A[1][1][1] and each element take 1 memory location)
asked
Jan 9
in
Programming
by
Shubhanshu
Boss
(
15k
points)

106
views
datastructure
algorithms
linkedlists
+2
votes
0
answers
8
What will be the output of this C program
asked
Jan 8
in
Programming
by
_shashi
(
199
points)

115
views
programminginc
linkedlists
+1
vote
1
answer
9
Linked list
In a circular single linked list how many external pointers are there because in some books there are two external pointers start pointing at first node and last pointing at last node while some given only last pointer and some have only first pointer
asked
Dec 30, 2017
in
DS
by
kd.....
(
211
points)

73
views
linkedlists
datastructure
programminginc
algorithms
–1
vote
0
answers
10
Linked_list
Insertion at beginning and end ....both require theta(n) ?
asked
Dec 21, 2017
in
Programming
by
Pawan Kumar 2
Active
(
4.4k
points)

49
views
linkedlists
0
votes
2
answers
11
ACE test
What is the time complexity to insert a new Node in a singly circular linked list at Starting ? (Number of nodes in list = N) A. O(1) B. O(N)
asked
Dec 10, 2017
in
Programming
by
Mr_22B
Active
(
1.1k
points)

173
views
acetestseries
linkedlists
0
votes
1
answer
12
Linked list doubt previous year question
asked
Dec 9, 2017
in
Programming
by
hem chandra joshi
Active
(
4.3k
points)

57
views
linkedlists
+1
vote
1
answer
13
linked lists and bit vectors
Consider the following statements about free space management I) Bit vectors are inefficient unless the entire vector is kept in main memory. II) Linked list approach requires less I/O time. III) Linked list approach is more efficient than bit vectors in terms of storage space. Which of the following statements is/are TRUE:?
asked
Nov 27, 2017
in
DS
by
Parshu gate
Active
(
4.9k
points)

137
views
linkedlists
datastructure
+1
vote
0
answers
14
linked list
Let P be a single linked list.Let Q be a pointer to an intermediate node 'X' in the list.What is the worst case time complexity of best known algorithm to delete the node 'X ' from the list
asked
Nov 25, 2017
in
Programming
by
saipriyab
Active
(
1.3k
points)

154
views
linkedlists
algorithms
datastructure
+2
votes
1
answer
15
Data structure
what should be the statement at A
asked
Nov 21, 2017
in
DS
by
nikkey123
Active
(
1.5k
points)

58
views
datastructure
linkedlists
0
votes
2
answers
16
Circular single linked list conceptual
Please explain how to approach this problem?
asked
Nov 20, 2017
in
Mathematical Logic
by
Parshu gate
Active
(
4.9k
points)

60
views
linkedlists
+1
vote
1
answer
17
Linked List
Here In this question it is given that we have to perform nlogn decrease key operation and n find operation . 1)Finding an element in the linked list itself takes O(n) and there are N such operations total=O(n2). 2)Decrease key: Find key O(n) + O(1) for decrease=O(n) and there are nlogn such operations: total O(n2logn). Please correct Me : Image :
asked
Nov 16, 2017
in
Algorithms
by
saxena0612
Boss
(
11.4k
points)

97
views
linkedlists
datastructure
+2
votes
1
answer
18
Circular Linked List
In circular singly linked list, insertion of node requires modification of how many pointers? 1 pointers 2 pointers 3 pointers 4 pointers
asked
Nov 14, 2017
in
Programming
by
hacker16
Active
(
2.6k
points)

484
views
linkedlists
datastructure
+5
votes
1
answer
19
Linked List (Time Complexity)
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? O(n) O(1) θ(n2) θ(n)
asked
Nov 14, 2017
in
Programming
by
hacker16
Active
(
2.6k
points)

304
views
timecomplexity
datastructure
algorithms
linkedlists
+1
vote
1
answer
20
linked lists
Consider the following Linked list Node structure struct Node { int data; struct Node * next; } typedef struct Node Node; Consider the following function to reverse the singly linked list Node* reverse_list(Node *head) { Node *temp = NULL; Node *next ; while(head) { next = 1 ... respectively (A) head, head>next (B) head>next,head (C) NULL, head>next (D) head>next, next
asked
Nov 12, 2017
in
DS
by
Parshu gate
Active
(
4.9k
points)

72
views
datastructure
linkedlists
0
votes
1
answer
21
linked list
i am getting 7 but ans given is 6.
asked
Nov 7, 2017
in
Programming
by
raviyogi
Active
(
2.5k
points)

89
views
linkedlists
programminginc
+1
vote
0
answers
22
linked list conceptual
asked
Nov 6, 2017
in
DS
by
Parshu gate
Active
(
4.9k
points)

70
views
linkedlists
datastructure
+3
votes
1
answer
23
Loop detection in a Linked list
Consider the following code which is used to detect the loop in the linked list. Find the missing statement A? p = head; q = head>next; while(A) { if(p == q) exit(0) //loop detected p = p>next; q = (q>next)?(q>next>next) : q> ... (p!=NULL)  (q!=NULL) Given ans is c.......but I think b could also be correct if not than why..... Please explain
asked
Nov 3, 2017
in
Programming
by
Shivi rao
Junior
(
775
points)

126
views
linkedlists
datastructure
+5
votes
1
answer
24
Inplace Merge Sort via Doubly linked list in place of Array
asked
Nov 2, 2017
in
Algorithms
by
Chhotu
Boss
(
10.4k
points)

156
views
algorithms
sorting
spacecomplexity
linkedlists
complete
timecomplexity
+1
vote
1
answer
25
Linked List
Consider the following program struct node { int value; Node *next; } boolean fun(Node *head) { Node *a,*b; a=head; if(a==NULL) return TRUE; b=a>next; while(b!=NULL && b!=a) { b=b>next; if(b==NULL) return TRUE; b=b>next; a=a>next; } return(b==NULL); } Is the following code return this? a)
asked
Oct 29, 2017
in
DS
by
srestha
Veteran
(
83.8k
points)

98
views
linkedlists
datastructure
+2
votes
1
answer
26
Linked List
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list? (a). Deleting a node whose location is given. (b). Searching an unsorted list of a given item. (c). inserting a node after the node with a given location. (d). Traversing the list to process each node.
asked
Oct 26, 2017
in
Programming
by
Shubham Kumar Gupta
Junior
(
533
points)

129
views
linkedlists
datastructure
programminginc
queues
+3
votes
1
answer
27
2. Linked List
Consider the given Doubly Linked List: Consider C like language code snippet with respect to doubly linked list given "p" is pointer to linked list node p=first>next>next>next>prev; p>next>next>prev=p; printf("%d",p>next>next>prev>next>data); What is the output?Plz explain
asked
Oct 17, 2017
in
DS
by
srestha
Veteran
(
83.8k
points)

109
views
linkedlists
datastructure
+1
vote
0
answers
28
Testbook Test Series  Linked Lists
Consider the following code which is used to detect the loop in the linked list. Find the missing statement A? p = head; q = head>next; while(A) { if(p == q) exit(0) //loop detected p = p>next; q = (q>next)?(q>next> ... first to the end of the linked list. my answer is q!=NULL and it is in one of the options. Please correct me if I am wrong.
asked
Oct 14, 2017
in
DS
by
Jaspreet Singh 4
(
153
points)

115
views
datastructure
linkedlists
testbooktestseries
0
votes
1
answer
29
Linked List
Suppose p and q are 2 nodes in linked list, where p pointing to head node and q pointing to next to head node. Now, chk this condition while(A) { if(p==q)exit(0); p=p>next; q=(q>next)?(q>next>next):q>next; } ... >next>next? And what should be value of A, so that this while loop satisfies the condition that this linked list satisfies the condition for a loop?
asked
Oct 13, 2017
in
DS
by
srestha
Veteran
(
83.8k
points)

106
views
linkedlists
datastructure
0
votes
1
answer
30
UGCNETdec200623
What is the time required to insert an element in a stack with linked implementation? (A) O (log2n) (B) O (n) (C) O (n log2n) (D) O (1)
asked
Sep 29, 2017
in
DS
by
rishu_darkshadow
Loyal
(
7k
points)

560
views
linkedlists
stack
Page:
1
2
3
4
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
Regarding acceptance fee of CCMT round1
ISRO Revised Answer Key Available Now.
Selected for M.Tech Computer Science in University of Hyderabad
Gate 2019 suggestion
IIIT Hyderabad interview Experience  2017
Follow @csegate
Gatecse
Recent questions tagged linkedlists
Recent Blog Comments
very good chance for you bro. Prepare for the ...
I am getting 125. Is there any chance of ...
Download the pdf ... Changed questions are marked ...
Which Questions have dropped or Answer changed?
Thank you . yes i confirmed it by calling and ...
35,485
questions
42,741
answers
121,445
comments
42,135
users