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
Recent questions tagged linkedlists
+1
vote
1
answer
1
Targate
The Answer given is A) I think the naswer should be B) as we have both the prev pointer and the next pointer available , it will take constant time to update the adjacent nodes pointers and delete the given node .?
asked
Jan 3, 2017
in
DS
by
Harsh181996
Active
(
4.4k
points)

892
views
linkedlists
datastructure
timecomplexity
+1
vote
0
answers
2
Me Test Series[Linked List]
asked
Dec 19, 2016
in
Programming
by
rahul sharma 5
Boss
(
25.3k
points)

159
views
algorithms
linkedlists
datastructure
madeeasytestseries
programming
+19
votes
1
answer
3
GATE199911b
Write a constant time algorithm to insert a node with data $D$ just before the node with address $p$ of a singly linked list.
asked
Dec 17, 2016
in
DS
by
Arjun
Veteran
(
425k
points)

662
views
gate1999
datastructure
linkedlists
+2
votes
1
answer
4
GATE19894xi
Provide short answers to the following questions: Express the following list in terms of a linked list structure suitable for internal representation. $(((ab)c)d((e)))$
asked
Nov 30, 2016
in
DS
by
makhdoom ghaya
Boss
(
30.2k
points)

218
views
gate1989
descriptive
datastructure
linkedlists
unsolved
+1
vote
1
answer
5
Linked List
asked
Nov 25, 2016
in
DS
by
thor
Loyal
(
6.8k
points)

103
views
linkedlists
+2
votes
1
answer
6
Linked list problem
asked
Nov 19, 2016
in
DS
by
thor
Loyal
(
6.8k
points)

836
views
linkedlists
datastructure
+8
votes
3
answers
7
GATE19876a
A list of $n$ elements is commonly written as a sequence of $n$ elements enclosed in a pair of square brackets. For example. $[10, 20, 30]$ is a list of three elements and $[]$ is a nil list. Five functions are defined below: $car (l)$ returns the first element of its argument list $l$ ... $f ([32, 16, 8], [9, 11, 12])$ (b) $g ([5, 1, 8, 9])$
asked
Nov 14, 2016
in
DS
by
makhdoom ghaya
Boss
(
30.2k
points)

633
views
gate1987
datastructure
linkedlists
+13
votes
3
answers
8
GATE19871xv
In a circular linked list oraganisation, insertion of a record involves modification of One pointer. Two pointers. Multiple pointers. No pointer.
asked
Nov 8, 2016
in
DS
by
makhdoom ghaya
Boss
(
30.2k
points)

2.7k
views
gate1987
datastructure
linkedlists
0
votes
0
answers
9
Ds+linked list
I am not getting how unsigned is used and how is it working???
asked
Nov 5, 2016
in
Programming
by
Rahul Jain25
Boss
(
11.1k
points)

124
views
linkedlists
algorithms
programming
datastructure
0
votes
0
answers
10
Kerala PSC AP Exam
Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete node X from the list? A) O(n) B) O(log 2 n) C) O(log n) D) O(1)
asked
Oct 27, 2016
in
DS
by
Sankaranarayanan P.N
Boss
(
11k
points)

87
views
linkedlists
+3
votes
1
answer
11
GO2017Programming130
Consider the following incomplete C function for reversing a singly linked list. node* reverse(node* trav){ if(trav>next) __________________ else { head > next = null; head = trav; } return trav; } Here, head is a global pointer pointing to the head of the ... > next = trav; trav>next > next = trav; trav > next = trav; trav = reverse(trav>next);
asked
Oct 19, 2016
in
Programming
by
Arjun
Veteran
(
425k
points)

432
views
go2017programming1
programming
programminginc
linkedlists
+2
votes
0
answers
12
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 you must acquire for any operation (lookup, insert, delete) ?
asked
Oct 11, 2016
in
Operating System
by
mcjoshi
Boss
(
28.6k
points)

388
views
operatingsystem
semaphore
linkedlists
+2
votes
2
answers
13
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*} &A. \ \ O(n) \\ &B. \ \ \text{max}(m,n) \\ &C. \ \ \text{min}(m,n) \\ &D. \ \ m+n \end{align*}$
asked
Sep 27, 2016
in
Algorithms
by
Vishal Goyal
Active
(
1.8k
points)

249
views
linkedlists
algorithms
0
votes
1
answer
14
UGCNETAUG2016II21
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 the linked list). Given the representation, which of the following operation can not be ... of the linked list. Deletion of the front node of the linked list. Deletion of the last node of the linked list.
asked
Sep 25, 2016
in
Others
by
makhdoom ghaya
Boss
(
30.2k
points)

473
views
ugcnetaug2016ii
datastructure
linkedlists
0
votes
1
answer
15
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 of XYZ p = p→next; } return val2; } What is XYZ in above code ? Please provide a sound explaination too.
asked
Sep 23, 2016
in
DS
by
Manikant Kumar
(
397
points)

213
views
datastructure
linkedlists
0
votes
1
answer
16
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?
asked
Sep 9, 2016
in
Programming
by
cse23
Loyal
(
8.5k
points)

183
views
linkedlists
programminginc
+3
votes
1
answer
17
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 midpoint of the sequence the root of the tree * Recursively construct balanced search trees from elements to the left and right of the ... O(n) 2 O(n log n) 3 O(n2) 4 Depends on the contents of the original sequence
asked
Aug 23, 2016
in
Algorithms
by
dd
Veteran
(
57k
points)

594
views
linkedlists
algorithms
recurrence
recurrenceeqation
+1
vote
1
answer
18
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 * pTempNode = NULL; int nCurrentElement = 0; for ( pTempNode = Head; pTempNode != NULL; ... nCurrentElement  NthNode > 0) { pNthNode = pNthNode >pNext; } } if (pNthNode ) { return pNthNode; } else return NULL; }
asked
Jul 29, 2016
in
Programming
by
Anushka Basu
(
19
points)

122
views
linkedlists
+2
votes
1
answer
19
UGCNETDec2013II22
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 nonempty queue? Neither of the pointer change Only front pointer changes Only rear pointer changes Both of the pointer changes
asked
Jul 25, 2016
in
Programming
by
jothee
Veteran
(
105k
points)

981
views
ugcnetdec2013ii
datastructure
linkedlists
+2
votes
2
answers
20
Amazon Interview question on Linked list
Given a linked list : 1>2>3>4>5>6, make the following changes 1>6>2>5>3>4 What would be the most effiicient way to make this change?
asked
Jul 22, 2016
in
Algorithm Challenges
by
sh!va
Boss
(
32.5k
points)

885
views
linkedlists
algorithms
amazon
interview
+1
vote
2
answers
21
UGCNETSep2013II12
The efficient data structure to insert/delete a number in a stored set of number is Queue Linked list Doubly linked list Binary tree
asked
Jul 20, 2016
in
Others
by
jothee
Veteran
(
105k
points)

741
views
ugcnetsep2013ii
datastructure
queues
linkedlists
+2
votes
4
answers
22
ISRO201449
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 operations depends on the length of the linked list? Delete the first element of the list Interchange the first two elements of the list Delete the last element of the list Add an element at the end of the list
asked
Jul 1, 2016
in
DS
by
jothee
Veteran
(
105k
points)

2.7k
views
isro2014
datastructure
linkedlists
+5
votes
2
answers
23
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 ?
asked
Jun 28, 2016
in
Programming
by
shekhar chauhan
Boss
(
45.3k
points)

379
views
programming
datastructure
linkedlists
recursion
+4
votes
1
answer
24
Linked List
Linked Lists are not suitable for _____. A. Binary Search B. Polynomial Manipulation C. Insertion D. Radix Sort
asked
Jun 16, 2016
in
DS
by
im.raj
Junior
(
557
points)

4.2k
views
linkedlists
binarysearch
+4
votes
1
answer
25
ISRO200872
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list? Deleting a node whose location is given Searching an unsorted list for a given item Inserting a node after the node with a given location Traversing the list to process each node
asked
Jun 13, 2016
in
DS
by
jothee
Veteran
(
105k
points)

3.2k
views
isro2008
datastructure
linkedlists
+1
vote
1
answer
26
ISRO200871
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)$
asked
Jun 13, 2016
in
DS
by
jothee
Veteran
(
105k
points)

2.3k
views
isro2008
datastructure
linkedlists
Page:
« prev
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
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged linkedlists
Recent Blog Comments
Amazing work Sir
Not in my hands. Flipkart is showing my location...
Arjun sir, plz provide go book through...
@
[email protected]
Can this be updated?
Even In 2019 my 16 questions goes for negative...
50,644
questions
56,503
answers
195,553
comments
101,037
users