Introduction To Data Structures - Practice Test

[#1] 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) S[N]

[#2] Consider you have a stack whose elements in it are as follows. 5 4 3 2 << top Where the top element is 2. You need to get the following stack 6 5 4 3 2 << top The operations that needed to be performed are (You can perform only push and pop):

(A) Push(pop()), push(6), push(pop())

(B) Push(pop()), push(6)

(C) Push(pop()), push(pop()), push(6)

(D) Push(6)

Correct Answer

(A) Push(pop()), push(6), push(pop())

[#3] Which data structure is used for implementing recursion?

(A) Queue

(B) Stack

(C) Array

(D) List

(E) Array

(F) Queue

(G) Stack

(H) Linked List

Correct Answer

(B) Stack
(G) Stack

[#4] Which of the following data structures can be used for parentheses matching?

(A) n-ary tree

(B) queue

(C) priority queue

(D) stack

Correct Answer

(D) stack

[#5] Here is an infix expression: 4 + 3(63-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?

(A) 1

(B) 2

(C) 3

(D) 4

Correct Answer

(D) 4

Introduction To Data Structures - Study Mode

[#1] 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)?

Correct Answer

[#2] Consider you have a stack whose elements in it are as follows. 5 4 3 2 << top Where the top element is 2. You need to get the following stack 6 5 4 3 2 << top The operations that needed to be performed are (You can perform only push and pop):

Correct Answer

[#3] Which data structure is used for implementing recursion?

Correct Answer

[#4] Which of the following data structures can be used for parentheses matching?

Correct Answer

[#5] Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?

Correct Answer

[#5] Here is an infix expression: 4 + 3(63-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?