List of top Programming and Data Structures Questions on Linked Lists

Consider a list [−2, 0, 3, 5, 9, 11, 13]. Apply binary search to find element -2. Determine the number of key comparison required?

Which of the following technique of searching compares every element of list where the list can be in any order?

Consider a list of elements 8, 7, 3, 4, 1, 9 and perform the insertion sort in ascending order. Which of the following intermediate list occur during sorting.
(A) 7, 8, 3, 4, 1, 9
(B) 7, 3, 8, 4, 1, 9
(C) 3, 4, 7, 8, 1, 9
(D) 7, 3, 4, 8, 1, 9
(E) 1,7, 3, 4, 8, 9
Choose the correct answer from the options given below:

Which of the following sequences when stored in an array at locations A[1],..., A[10] forms a max-heap?

Consider the problem of reversing a singly linked list. To take an example, given the linked list below,

The reversed linked list should look like

Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in \( O(1) \) space?

Consider the following ANSI C program:

#include <stdio.h> 
#include <stdlib.h> 
struct Node{ 
	int value; 
	struct Node *next; }; 
int main(){ 
	struct Node *boxE, *head, *boxN; int index = 0; 
	boxE = head = (struct Node *) malloc(sizeof(struct Node)); 
	head->value = index; 
	for (index = 1; index <= 3; index++){ 
		boxN = (struct Node *) malloc(sizeof(struct Node)); 
		boxE->next = boxN; 
		boxN->value = index; 
		boxE = boxN; } 
	for (index = 0; index <= 3; index++) { 
		printf("Value at index %d is %d\n", index, head->value); 
		head = head->next; 
		printf("Value at index %d is %d\n", index+1, head->value); } }

Which one of the statements below is correct about the program?