Dark Mode

Recent questions tagged linked-list

0 votes

2 answers

241

MadeEasy Test Series: Programming & DS - Linked Lists
Delete the duplicate node Delete the alternate duplicate node Delete the adjacent node None of these

Sandeep Singh asked in DS Dec 27, 2015

by Sandeep Singh

599 views

2 votes

3 answers

242

nitish asked in DS Dec 27, 2015

by nitish

851 views

1 vote

1 answer

243

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

shikharV asked in DS Nov 15, 2015

1.2k views

2 votes

5 answers

244

ISRO2008-76
The minimum number of fields with each node of doubly linked list is 1 2 3 4

ajit asked in DS Sep 20, 2015

by ajit

19.4k views

0 votes

2 answers

245

which statement is true about doubly linked list?

Gunjan Rathore asked in Programming in C May 4, 2015

by Gunjan Rathore

9.1k views

24 votes

2 answers

246

GATE IT 2005 | Question: 54
The following C function takes a singly-linked 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 ... $1, 3, 2, 5, 4, 7, 6$ $2, 3, 4, 5, 6, 7, 1$

Ishrat Jahan asked in DS Nov 3, 2014

by Ishrat Jahan

7.9k views

65 votes

9 answers

247

GATE IT 2004 | Question: 13
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 the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$

Ishrat Jahan asked in DS Nov 1, 2014

by Ishrat Jahan

24.8k views

33 votes

4 answers

248

GATE CSE 1996 | Question: 1.12
Consider the following statements: First-in-first 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 ... $(ii)$ are true $(iii)$ and $(iv)$ are true $(ii)$ and $(iv)$ are true

Kathleen asked in DS Oct 9, 2014

14.8k views

26 votes

3 answers

249

GATE CSE 1995 | Question: 2.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

Kathleen asked in DS Oct 8, 2014

11.3k views

35 votes

4 answers

250

GATE CSE 1994 | Question: 1.17, UGCNET-Sep2013-II: 32
Linked lists are not suitable data structures for which one of the following problems? Insertion sort Binary search Radix sort Polynomial manipulation

Kathleen asked in DS Oct 4, 2014

23.0k views

41 votes

2 answers

251

GATE CSE 2010 | Question: 36
The following C function takes a singly-linked 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; ... $q \rightarrow next = NULL; p \rightarrow next = head; head = p$;

go_editor asked in DS Sep 30, 2014

10.8k views

14 votes

4 answers

252

GATE CSE 1993 | Question: 13
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^{\text{th}}$ node $(1 \leq j \leq n)$ in which $d_j$ is stored. A new data item $d$ stored ... 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.

Kathleen asked in DS Sep 29, 2014

3.6k views

23 votes

3 answers

253

GATE CSE 1997 | Question: 18
Consider the following piece of 'C' code fragment that removes duplicates from an ordered list of integers. Node *remove-duplicates (Node* head, int *j) { Node *t1, *t2; *j=0; t1 = head; if (t1! = NULL) t2 = t1 ->next ... statements marked $S2$ get executed? What is the significance of the value in the integer pointed to by $j$ when the function completes?

Kathleen asked in DS Sep 29, 2014

4.7k views

44 votes

5 answers

254

GATE CSE 1997 | Question: 1.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

Kathleen asked in DS Sep 29, 2014

19.4k views

26 votes

5 answers

255

GATE CSE 1998 | Question: 19a
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

Kathleen asked in DS Sep 26, 2014

7.7k views

62 votes

4 answers

256

GATE CSE 2004 | Question: 40
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}$

Kathleen asked in DS Sep 18, 2014

19.0k views

55 votes

8 answers

257

GATE CSE 2004 | Question: 36
A circularly linked list is used to represent a Queue. A single variable $p$ is used to access the Queue. To which node should $p$ point such that both the operations $\text{enQueue}$ and $\text{deQueue}$ can be performed in constant time? rear node front node not possible with a single pointer node next to front

Kathleen asked in DS Sep 18, 2014

30.8k views

55 votes

6 answers

258

GATE CSE 2003 | Question: 90
Consider the function $f$ defined below. struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL) || (p->next == NULL)|| ((p->data <= p ->next -> data) && f(p- ... order of data value the elements in the list are sorted in non-increasing order of data value not all elements in the list have the same data value

Kathleen asked in DS Sep 17, 2014

17.5k views

25 votes

6 answers

259

GATE CSE 2002 | Question: 1.5
In the worst case, the number of comparisons needed to search a single linked list of length $n$ for a given element is $\log n$ $\frac{n}{2}$ $\log_2 {n} - 1$ $n$

Kathleen asked in DS Sep 15, 2014

14.7k views

42 votes

4 answers

260

GATE CSE 2008 | Question: 62
The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. 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 after function completes execution? struct ... $1, 3, 2, 5, 4, 7, 6$ $2, 3, 4, 5, 6, 7, 1$

Kathleen asked in DS Sep 12, 2014

19.0k views

Page:

« prev
1
...
4
5
6
7
8
9

Recent questions tagged linked-list