# Welcome to the Data Structures and Algorithms MCQs Page

Dive deep into the fascinating world of Data Structures and Algorithms with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Data Structures and Algorithms, a crucial aspect of GATE CSE Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Data Structures and Algorithms, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within GATE CSE Exam.

Check out the MCQs below to embark on an enriching journey through Data Structures and Algorithms. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of GATE CSE Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Data Structures and Algorithms. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

### Data Structures and Algorithms MCQs | Page 1 of 30

## Explore more Topics under GATE CSE Exam

void fun1(struct node* head)

{

if(head == NULL)

return;

fun1(head->next);

printf("%d ", head->data);

}

void fun(struct node **head_ref)

{

struct node *temp = NULL;

struct node *current = *head_ref;

while (current != NULL)

{

temp = current->prev;

current->prev = current->next;

current->next = temp;

current = current->prev;

}

if(temp != NULL )

*head_ref = temp->prev;

}

Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call?

/* Link list node */

struct node

{

int data;

struct node* next;

};

/* head_ref is a double pointer which points to head (or start) pointer

of linked list */

static void reverse(struct node** head_ref)

{

struct node* prev = NULL;

struct node* current = *head_ref;

struct node* next;

while (current != NULL)

{

next = current->next;

current->next = prev;

prev = current;

current = next;

}

/*ADD A STATEMENT HERE*/

}

What should be added in place of "/*ADD A STATEMENT HERE*/", so that the function correctly reverses a linked list.

1->2->3->4->5->6

void fun(struct node* start)

{

if(start == NULL)

return;

printf("%d ", start->data);

if(start->next != NULL )

fun(start->next->next);

printf("%d ", start->data);

}

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;

}

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;

}

}

# Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!