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
+5
votes
1
answer
1
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.3k
views
isro2008
datastructures
linkedlists
+1
vote
1
answer
2
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
datastructures
linkedlists
+14
votes
1
answer
3
ISI2015PCBCS3a
Consider a linked list containing $n$ nodes, where each node contains two pointers $ptr1$ and $ptr2$. For each node, $ptr1$ points to the next node of the list. Describe how pointer $ptr2$ should be set up for each node so that you will be able to locate the $i$th node from the start node in the list traversing no more than $[\log\: i] + [i/2]$ nodes.
asked
May 29, 2016
in
DS
by
jothee
Veteran
(
105k
points)

689
views
descriptive
isi2015pcbcs
datastructures
linkedlists
+8
votes
1
answer
4
CMI2012B07
We use the notation $[x1,x2,...,xn]$ to denote a list of integers. $[]$ denotes the empty list, and $[n]$ is the list consisting of one integer $n$. For a nonempty list l, $head(l)$ returns the first element of $l$, and $tail(l)$ returns the list ... (tail(l)) then return g(tail(l)) else return(false) When does $f(l)$ return the value true for an input $l$? Explain your answer.
asked
May 23, 2016
in
DS
by
jothee
Veteran
(
105k
points)

391
views
cmi2012
descriptive
datastructures
linkedlists
+2
votes
0
answers
5
CMI2011B07a
A finite sequence of bits is represented as a list with values from the set $\{0,1\}$for example, $[0,1,0], [1,0,1,1], \dots [ \: ]$ denotes the empty list, and $[b]$ is the list consisting of one bit $b$. For a nonempty list $l, \text{ head}(l)$ returns the first ... g2(n) if (n == 0) then return(0) else return f2(g2(n1),g1(n)) endif What is the value of $g2(7)$ and $g2(8)$?
asked
May 20, 2016
in
DS
by
jothee
Veteran
(
105k
points)

98
views
cmi2011
descriptive
linkedlists
+1
vote
0
answers
6
CMI2010B07a
A finite sequence of bits is represented as a list with values from the set {0,1}—for example, [0,1,0], [1,0,1,1], . . . . [ ] denotes the empty list, and [b] is the list consisting of one bit b. The function $length(l)$ returns the length (number of ... tail(t)),mystery2(s,tail(t)))) endif What is the value of $length(mystery2(s,t))$ in terms of $length(s)$ and $length(t)$?
asked
May 19, 2016
in
DS
by
jothee
Veteran
(
105k
points)

113
views
cmi2010
descriptive
linkedlists
+6
votes
1
answer
7
ISRO20134
The following steps in a linked list p = getnode() info(p) = 10 next (p) = list list = p result in which type of operation? Pop operation in stack. Removal of a node. Inserting a node. Modifying an existing node.
asked
Apr 25, 2016
in
DS
by
makhdoom ghaya
Boss
(
30.7k
points)

3k
views
isro2013
linkedlists
0
votes
4
answers
8
How to manipulate the given linked list in the following manner in O(n) time ?
If we are given a linked list then we have to manipulate such that even indexed node are arranged together and odd indexed nodes are arranged together after even indexed nodes for instance the given linked list is 1>2>3>4>5>6 , so the op should be 2>4>6>1>3>5
asked
Apr 7, 2016
in
Algorithms
by
radha gogia
Loyal
(
6.4k
points)

223
views
linkedlists
placementquestions
descriptive
+49
votes
6
answers
9
GATE2016215
$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 operations on the list in ... put together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$
asked
Feb 12, 2016
in
DS
by
Akash Kanase
Boss
(
41.9k
points)

10.7k
views
gate20162
datastructures
linkedlists
timecomplexity
normal
+2
votes
2
answers
10
Linked list
asked
Jan 31, 2016
in
Programming
by
Sourabh Kumar
Active
(
1.5k
points)

1.4k
views
linkedlists
0
votes
1
answer
11
MadeEasy Test Series: Programming & DS  Linked Lists
Here, what will be the Head>Next , I am confused is it first element 50 or second element 29.
asked
Jan 22, 2016
in
DS
by
Pradip Nichite
Active
(
1.1k
points)

219
views
madeeasytestseries
datastructures
linkedlists
+1
vote
0
answers
12
Linked allocation
A program has just read the $12^{th}$ disk block using linked allocation. If it next want to read the $5^{th}$ disk block, then the number of disk blocks must the program already read to reach the $5^{th}$ disk block ________.
asked
Jan 22, 2016
in
Operating System
by
Sourabh Kumar
Active
(
1.5k
points)

133
views
linkedlists
0
votes
1
answer
13
linked list
What does the following function do for a given Linked List with first node as head? void fun1(struct node* head) { if(head == NULL) return; fun1(head>next); printf("%d ", head>data); } will it print 54321 or 4321 if i/p is 12345?Will the last 5 get printed or not , due to return;
asked
Jan 21, 2016
in
Programming
by
chat28
Junior
(
657
points)

900
views
linkedlists
0
votes
1
answer
14
Given the unordered linked list as a queue, what operations would take O(1) time?
asked
Jan 4, 2016
in
DS
by
Utk
Active
(
2k
points)

165
views
linkedlists
timecomplexity
0
votes
2
answers
15
MadeEasy Test Series: Programming & DS  Linked Lists
Delete the duplicate node Delete the alternate duplicate node Delete the adjacent node None of these
asked
Dec 27, 2015
in
DS
by
Sandeep Singh
Loyal
(
7.2k
points)

185
views
datastructures
linkedlists
madeeasytestseries
+2
votes
3
answers
16
link list
asked
Dec 27, 2015
in
DS
by
nitish
Active
(
1.2k
points)

399
views
linkedlists
+1
vote
1
answer
17
Counting number of pointer modification
In circular linked list, insertion of a node at the end involves pointer modification: (A) one (B) two (C) three (D) none
asked
Nov 15, 2015
in
DS
by
shikharV
Active
(
3.5k
points)

220
views
programminginc
pointers
linkedlists
+2
votes
5
answers
18
ISRO200876
The minimum number of fields with each node of doubly linked list is 1 2 3 4
asked
Sep 20, 2015
in
DS
by
ajit
Active
(
2.5k
points)

2.2k
views
isro2008
datastructures
linkedlists
0
votes
2
answers
19
which statement is true about doubly linked list?
asked
May 5, 2015
in
Programming
by
Gunjan Rathore
(
47
points)

2.3k
views
linkedlists
+18
votes
2
answers
20
GATE2005IT54
The following C function takes a singlylinked list of integers as a parameter and rearranges the elements of the list. The list is represented as pointer to a structure. The function is called with the list containing the integers $1, 2, 3, 4, 5, 6, 7$ in the given order. What will be the contents of the list ... $2, 1, 4, 3, 6, 5, 7$ $1, 3, 2, 5, 4, 7, 6$ $2, 3, 4, 5, 6, 7, 1$
asked
Nov 4, 2014
in
DS
by
Ishrat Jahan
Boss
(
16.3k
points)

1.8k
views
gate2005it
datastructures
linkedlists
normal
+33
votes
9
answers
21
GATE2004IT13
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worstcase time complexity of the bestknown algorithm to delete the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$
asked
Nov 2, 2014
in
DS
by
Ishrat Jahan
Boss
(
16.3k
points)

5.3k
views
gate2004it
datastructures
linkedlists
normal
ambiguous
+21
votes
4
answers
22
GATE19961.12
Consider the following statements: Firstinfirst out types of computations are efficiently supported by STACKS. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. Implementing QUEUES on a circular array is more efficient than ... and $(ii)$ are true $(iii)$ and $(iv)$ are true $(ii)$ and $(iv)$ are true
asked
Oct 9, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

3k
views
gate1996
datastructures
easy
queues
stack
linkedlists
+15
votes
2
answers
23
GATE19952.22
Which of the following statements is true? As the number of entries in a hash table increases, the number of collisions increases. Recursive programs are efficient The worst case complexity for Quicksort is $O(n^2)$ Binary search using a linear linked list is efficient I and II II and III I and IV I and III
asked
Oct 8, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

2.3k
views
gate1995
datastructures
linkedlists
hashing
+17
votes
3
answers
24
GATE19941.17, UGCNETSep2013II32
Linked lists are not suitable data structures for which one of the following problems? Insertion sort Binary search Radix sort Polynomial manipulation
asked
Oct 4, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

4.4k
views
gate1994
datastructures
linkedlists
normal
ugcnetsep2013ii
+25
votes
2
answers
25
GATE201036
The following C function takes a singlylinked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank. typedef struct node { int value; struct node *next; } node ... $q \rightarrow next = NULL; p \rightarrow next = head; head = p$;
asked
Sep 30, 2014
in
DS
by
jothee
Veteran
(
105k
points)

2.7k
views
gate2010
datastructures
linkedlists
normal
+7
votes
3
answers
26
GATE199313
Consider a singly linked list having $n$ nodes. The data items $d_1, d_2, \dots d_n$ are stored in these $n$ nodes. Let $X$ be a pointer to the $j^{th}$ node $(1 \leq j \leq n)$ in which $d_j$ is stored. A new data item $d$ stored in node with address ... to insert $d$ into the list to obtain a list having items $d_1, d_2, \dots, d_{j}, d,\dots, d_n$ in order without using the header.
asked
Sep 30, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

917
views
gate1993
datastructures
linkedlists
normal
+16
votes
3
answers
27
GATE199718
Consider the following piece of 'C' code fragment that removes duplicates from an ordered list of integers. Node *removeduplicates (Node* head, int *j) { Node *t1, *t2; *j=0; t1 = head; if (t1! = NULL) t2 = t1 >next; else return head; ... of times statements marked $S2$ get executed? What is the significance of the value in the integer pointed to by $j$ when the function completes?
asked
Sep 29, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

1.4k
views
gate1997
datastructures
linkedlists
normal
+23
votes
5
answers
28
GATE19971.4
The concatenation of two lists is to be performed on $O(1)$ time. Which of the following implementations of a list should be used? Singly linked list Doubly linked list Circular doubly linked list Array implementation of list
asked
Sep 29, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

5k
views
gate1997
datastructures
linkedlists
easy
+17
votes
5
answers
29
GATE199819a
Let $p$ be a pointer as shown in the figure in a single linked list. What do the following assignment statements achieve? q: = p > next p > next:= q > next q > next:=(q > next) > next (p > next) > next:= q
asked
Sep 26, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

1.8k
views
gate1998
datastructures
linkedlists
normal
+34
votes
4
answers
30
GATE200440
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ will be the slowest? $\text{union}$ only $\text{intersection, membership}$ $\text{membership, cardinality}$ $\text{union, intersection}$
asked
Sep 19, 2014
in
DS
by
Kathleen
Veteran
(
52.2k
points)

4.3k
views
gate2004
datastructures
linkedlists
normal
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged linkedlists
Recent Blog Comments
@ben10 There are two questions in it, as per time...
Is official answer key out ??
https://gateoverflow.in/331364/isro202036 ,...
For the postorder to preorder conversion, please...
Getting 111 marks. If big endian option changes...
50,737
questions
57,284
answers
198,184
comments
104,863
users