Recent questions tagged linked-lists - GATE Overflow

+28 votes

7 answers

1

GATE2004-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

asked Sep 19, 2014 in DS by Kathleen Veteran (52.2k points) | 6.8k views

+29 votes

3 answers

2

GATE2003-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->next) ... -decreasing 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

asked Sep 17, 2014 in DS by Kathleen Veteran (52.2k points) | 3.7k views

+15 votes

6 answers

3

GATE2002-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$

asked Sep 15, 2014 in DS by Kathleen Veteran (52.2k points) | 2.4k views

+26 votes

4 answers

4

GATE2008-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 node { int value ... $1, 3, 2, 5, 4, 7, 6$ $2, 3, 4, 5, 6, 7, 1$

asked Sep 12, 2014 in DS by Kathleen Veteran (52.2k points) | 4.2k views

Page:

« prev
1
2
3
4
5
6

Recent questions tagged linked-lists

50,737 questions

57,299 answers

198,278 comments

104,992 users