1
GATE CSE 2018
MCQ (Single Correct Answer)
+2
-0.6
A queue is implemented using a non-circular 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 of a node from the tail. GATE CSE 2018 Data Structures - Linked List Question 3 English

Which one of the following is the time complexity of the most time-efficient implementation of $$enqueue$$ and $$dequeue,$$ respectively, for this data structure?

A
$$\theta \left( 1 \right),\theta \left( 1 \right)$$
B
$$\theta \left( 1 \right),\theta \left( n \right)$$
C
$$\theta \left( n \right),\theta \left( 1 \right)$$
D
$$\theta \left( n \right),\theta \left( n \right)$$
2
GATE CSE 2013
MCQ (Single Correct Answer)
+2
-0.6
The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?
A
10,20,15,23,25,35,42,39,30
B
15,10,25,23,20,42,35,39,30
C
5,20,10,23,25,42,35,39,30
D
15,10,23,25,20,35,42,39,30
3
GATE CSE 2010
MCQ (Single Correct Answer)
+2
-0.6
The following C function takes a simply-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; 
} Node;
 
Node *move_to_front(Node *head) { 
     Node *p, *q; 
     if ((head = = NULL: || (head->next = = NULL)) return head; 
     q = NULL; p = head; 
     while (p-> next !=NULL) { 
       q=P; 
       p=p->next; 
     } 
     return head; 
} 
Choose the correct alternative to replace the blank line.
A
q = NULL; p->next = head; head = p;
B
q->next = NULL; head = p; p->next = head;
C
head = p; p->next = q; q->next = NULL;
D
q->next = NULL; p->next = head; head = p;
4
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
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 the function completes execution?
struct node { 
    int value; 
    struct node *next; 
}; 

Void rearrange (struct node *list ){ 
    struct node *p, * q; 
    int temp; 
    if( !list || !list-> next) return; 
    p = list; q = list->next; 
    while (q) { 
      temp = p->value; 
      p-> value = q ->value; 
      q-> value = temp; 
      p = q-> next; 
      q = p ? p->next : 0; 
    } 
}
A
1,2,3,4,5,6,7
B
2,1,4,3,6,5,7
C
1,3,2,5,4,7,6
D
2,3,4,5,6,7,1
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12