Stacks Questions

MCQ bookmark_border

141.

What does the following function check for? (all necessary headers to be included and function is called from main)

A

full stack

B

invalid index

C

empty stack

D

infinite stack

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

142.

What does

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

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

143.

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)

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

144.

Which of the following array position will be occupied by a new element being pushed for a stack of size N elements(capacity of stack > N).

A

S[N-1].

B

S[N].

C

S[1].

D

S[0].

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

145.

What happens when you pop from an empty stack while implementing using the Stack ADT in Java?

A

Undefined error

B

Compiler displays a warning

C

EmptyStackException is thrown

D

NoStackException is thrown

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

146.

What is the functionality of the following piece of Java code?

Assume:

A

print alternate elements of array

B

duplicate the given array

C

parentheses matching

D

reverse the array

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

147.

A

space allocation for array is fixed and cannot be changed during run-time

B

user unable to give the input for stack operations

C

a runtime exception halts execution

D

all of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

148.

Which of the following array element will return the top-of-the-stack-element for a stack of size N elements(capacity of stack > N).

A

S[N-1].

B

S[N].

C

S[N-2].

D

S[N+1].

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

149.

What is the functionality of the following piece of code?

public void display() 
{
	if(size == 0)
		System.out.println("underflow");
	else
	{
		Node current = first;
		while(current != null)
		{
			System.out.println(current.getEle());
			current = current.getNext();
		}
	}
}

A

reverse the list

B

display the list

C

display the list excluding top-of-the-stack-element

D

reverse the list excluding top-of-the-stack-element

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

150.

What does

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

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion