Data Structure Questions and Answers-Incidence Matrix and Graph Structured Stack

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Data Structure Questions and Answers-Incidence Matrix and Graph Structured Stack

Question 11 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Graph Structured Stack finds its application in .....
A
Bogo Sort
B
Tomita's Algorithm
C
Todd-Coxeter algorithm
D
All of the mentioned
Question 11 Explanation: 
Tomita's is a parsing algorithm which uses Graph Structured Stack in its implementation.

Question 12 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M.
A
True
B
False
Question 12 Explanation: 
The answer would depend on the intermediate vertices also.

There are 12 questions to complete.