Introduction to Data Structures MCQ question and answer with solution Page-10 section-2

Section 1 Section 2 Section 3

91.
How do you insert an element at the beginning of the list?

public void insertBegin(Node node)
{
	node.setNext(head);
	head = node;
	size++;
}

public void insertBegin(Node node)
{
	head = node;
	node.setNext(head);
	size++;
}

public void insertBegin(Node node)
{
	Node temp = head.getNext()
	node.setNext(temp);
	head = node;
	size++;
}

public void insertBegin(Node node)
{
	Node temp = head.getNext()
	node.setNext(temp);
	node = head;
	size++;
}

Answer & Solution Discuss in Board Save for Later

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

A. O(1)

B. O(n)

C. O(n²)

D. O(n⁴)

Answer & Solution Discuss in Board Save for Later

93.
What is the worst case time complexity of inserting a node in a doubly linked list?

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(1)

Answer & Solution Discuss in Board Save for Later

94.
What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?

A. O(1)

B. O(n)

C. O(n²)

D. O(n³)

Answer & Solution Discuss in Board Save for Later

95.
What does 'stack underflow' refer to?

A. accessing item from an undefined stack

B. adding items to a full stack

C. removing items from an empty stack

D. index out of bounds exception

Answer & Solution Discuss in Board Save for Later

96.
In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

A. Insertion

B. Deletion

C. To empty a queue

D. Both Insertion and To empty a queue

Answer & Solution Discuss in Board Save for Later

97.

What is the output of the following Java code?

public class array
{
	public static void main(String args[])
	{
		int []arr = {1,2,3,4,5};
		System.out.println(arr[2]);
		System.out.println(arr[4]);
	}
}

A. 3 and 5

B. 5 and 3

C. 2 and 4

D. 4 and 2

Answer & Solution Discuss in Board Save for Later

98.
Which of the following is not a disadvantage to the usage of array?

A. Fixed size

B. There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size

C. Insertion based on position

D. Accessing elements at specified positions

Answer & Solution Discuss in Board Save for Later

99.
Convert the following infix expressions into its equivalent postfix expressions.
(A + B ⋀D)/(E – F)+G

A. (A B D ⋀ + E F – / G +)

B. (A B D +⋀ E F – / G +)

C. (A B D ⋀ + E F/- G +)

D. (A B D E F + ⋀ / – G +)

Answer & Solution Discuss in Board Save for Later

100.

What is the output of following function for start pointing to first node of following 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);
}

A. 1 4 6 6 4 1

B. 1 3 5 1 3 5

C. 1 2 3 5

D. 1 3 5 5 3 1

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

91.
How do you insert an element at the beginning of the list?

Answer & Solution

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

Answer & Solution

93.
What is the worst case time complexity of inserting a node in a doubly linked list?

Answer & Solution

94.
What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?

Answer & Solution

95.
What does 'stack underflow' refer to?

Answer & Solution

96.
In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

Answer & Solution

97.
What is the output of the following Java code?

`public class array { public static void main(String args[]) { int []arr = {1,2,3,4,5}; System.out.println(arr[2]); System.out.println(arr[4]); } }`

Answer & Solution

98.
Which of the following is not a disadvantage to the usage of array?

Answer & Solution

99.
Convert the following infix expressions into its equivalent postfix expressions.
(A + B ⋀D)/(E – F)+G

Answer & Solution

100.
What is the output of following function for start pointing to first node of following 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); }`

Answer & Solution

Read More Section(Introduction to Data Structures)

Introduction to Data Structures MCQ question and answer with solution

91. How do you insert an element at the beginning of the list?

Answer & Solution

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

Answer & Solution

93. What is the worst case time complexity of inserting a node in a doubly linked list?

Answer & Solution

94. What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?

Answer & Solution

95. What does 'stack underflow' refer to?

Answer & Solution

96. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

Answer & Solution

97. What is the output of the following Java code? public class array { public static void main(String args[]) { int []arr = {1,2,3,4,5}; System.out.println(arr[2]); System.out.println(arr[4]); } }

Answer & Solution

98. Which of the following is not a disadvantage to the usage of array?

Answer & Solution

99. Convert the following infix expressions into its equivalent postfix expressions. (A + B ⋀D)/(E – F)+G

Answer & Solution

100. What is the output of following function for start pointing to first node of following 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); }

Answer & Solution

Read More Section(Introduction to Data Structures)

91.
How do you insert an element at the beginning of the list?

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

93.
What is the worst case time complexity of inserting a node in a doubly linked list?

94.
What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?

95.
What does 'stack underflow' refer to?

96.
In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

97.
What is the output of the following Java code?

`public class array { public static void main(String args[]) { int []arr = {1,2,3,4,5}; System.out.println(arr[2]); System.out.println(arr[4]); } }`

98.
Which of the following is not a disadvantage to the usage of array?

99.
Convert the following infix expressions into its equivalent postfix expressions.
(A + B ⋀D)/(E – F)+G

100.
What is the output of following function for start pointing to first node of following 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); }`