Lists Questions

MCQ bookmark_border

101.

What would be the asymptotic time complexity to find an element in the linked list?

A

O(1)

B

O(n)

C

O(n^2)

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

102.

What would be the asymptotic time complexity to insert an element at the second position in the linked list?

A

O(1)

B

O(n)

C

O(n^2)

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

103.

The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?

A

Singly linked list

B

Doubly linked list

C

Circular doubly linked list

D

Array implementation of list

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

104.

Consider the following definition in c programming language.

struct node
{
int data;
struct node * next;
}
typedef struct node NODE;
NODE *ptr;

Which of the following c code is used to create new node?

A

ptr = (NODE*)malloc(sizeof(NODE));

B

ptr = (NODE*)malloc(NODE);

C

ptr = (NODE*)malloc(sizeof(NODE*));

D

ptr = (NODE)malloc(sizeof(NODE));

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

105.

Linked lists are not suitable to for the implementation of?

A

Insertion sort

B

Radix sort

C

Polynomial manipulation

D

Binary search

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

106.

Linked list is considered as an example of ___________ type of memory allocation.

A

Dynamic

B

Static

C

Compile time

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

107.

In Linked List implementation, a node carries information regarding

A

Data

B

Link

C

Data and Link

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

108.

Linked list data structure offers considerable saving in

A

Computational Time

B

Space Utilization

C

Space Utilization and Computational Time

D

None of the mentioned

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

109.

What does the following function do for a given Linked List with first node as head?

A

Prints all nodes of linked lists

B

Prints all nodes of linked list in reverse order

C

Prints alternate nodes of Linked List

D

Prints alternate nodes in reverse order

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

110.

The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function.

/* 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.

A

*head_ref = prev;

B

*head_ref = current;

C

*head_ref = next;

D

*head_ref = NULL;

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion