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

Section 1 Section 2 Section 3

91.

What is the functionality of the following piece of code?

public void function(Object item)
{
	Node temp=new Node(item,trail);
	if(isEmpty())
	{
		head.setNext(temp);
		temp.setNext(trail);
	}
	else
	{
		Node cur=head.getNext();
		while(cur.getNext()!=trail)
		{
			cur=cur.getNext();
		}
		cur.setNext(temp);
	}
	size++;
}

A. Insert at the front end of the dequeue

B. Insert at the rear end of the dequeue

C. Fetch the element at the rear end of the dequeue

D. Fetch the element at the front end of the dequeue

Answer & Solution Discuss in Board Save for Later

92.
What is the time complexity to insert a node based on position in a priority queue?

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(n²)

Answer & Solution Discuss in Board Save for Later

93.
In general, the index of the first element in an array is . . . . . . . .

A. 0

B. -1

C. 2

D. 1

Answer & Solution Discuss in Board Save for Later

94.
The postfix form of A*B+C/D is?

A. *AB/CD+

B. AB*CD/+

C. A*BC+/D

D. ABCD+/*

Answer & Solution Discuss in Board Save for Later

95.

Consider the following doubly linked list: head-1-2-3-4-5-tail. What will be the list after performing the given sequence of operations?

Node temp = new Node(6,head,head.getNext());
Node temp1 = new Node(0,tail.getPrev(),tail);
head.setNext(temp);
temp.getNext().setPrev(temp);
tail.setPrev(temp1);
temp1.getPrev().setNext(temp1);

A. head-0-1-2-3-4-5-6-tail

B. head-1-2-3-4-5-6-tail

C. head-6-1-2-3-4-5-0-tail

D. head-0-1-2-3-4-5-tail

Answer & Solution Discuss in Board Save for Later

96.
Which of the following is not the application of stack?

A. A parentheses balancing program

B. Tracking of local variables at run time

C. Compiler Syntax Analyzer

D. Data Transfer between two asynchronous process

Answer & Solution Discuss in Board Save for Later

97.
Which of the following is true about linked list implementation of queue?

A. In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end

B. In push operation, if new nodes are inserted at the beginning, then in pop operation, nodes must be removed from the beginning

C. In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from end

D. In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from beginning

Answer & Solution Discuss in Board Save for Later

98.
What is the time complexity of pop() operation when the stack is implemented using an array?

A. O(1)

B. O(n)

C. O(logn)

D. O(nlogn)

Answer & Solution Discuss in Board Save for Later

99.
What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?

A. O(nlogn)

B. O(logn)

C. O(n)

D. O(n²)

Answer & Solution Discuss in Board Save for Later

100.
The data structure required for Breadth First Traversal on a graph is?

A. Stack

B. Array

C. Queue

D. Tree

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

Introduction to Data Structures MCQ question and answer with solution

Answer & Solution

92. What is the time complexity to insert a node based on position in a priority queue?

Answer & Solution

93. In general, the index of the first element in an array is . . . . . . . .

Answer & Solution

94. The postfix form of A*B+C/D is?

Answer & Solution

Answer & Solution

96. Which of the following is not the application of stack?

Answer & Solution

97. Which of the following is true about linked list implementation of queue?

Answer & Solution

98. What is the time complexity of pop() operation when the stack is implemented using an array?

Answer & Solution

99. What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?

Answer & Solution

100. The data structure required for Breadth First Traversal on a graph is?

Answer & Solution

Read More Section(Introduction to Data Structures)

92.
What is the time complexity to insert a node based on position in a priority queue?

93.
In general, the index of the first element in an array is . . . . . . . .

94.
The postfix form of A*B+C/D is?

96.
Which of the following is not the application of stack?

97.
Which of the following is true about linked list implementation of queue?

98.
What is the time complexity of pop() operation when the stack is implemented using an array?

99.
What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?

100.
The data structure required for Breadth First Traversal on a graph is?