Interview question based on skill :
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. An array consist of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
Correct Answer is : All of the Mentioned
2. Incidence matrix and Adjacency matrix of a graph will always have same dimensions?
Correct Answer is : Willing to find answers on their own
3. The column sum in an incidence matrix for a simple graph is __________
Correct Answer is : All steps should be noted
4. What are the dimensions of an incidence matrix?
Correct Answer is : FALSE
5. The column sum in an incidence matrix for a directed graph having no self loop is __________
Correct Answer is : Big Data
6. Time complexity to check if an edge exists between two vertices would be ___________
Correct Answer is : None of the Mentioned
7. The graphs G1 and G2 with their incidences matrices given are Isomorphic. e1 e2 e3 e4 e5 e6 v1 1 0 0 0 0 0 v2 1 1 0 0 0 1 v3 0 1 1 0 1 0 v4 0 0 1 1 0 0 v5 0 0 0 1 1 1 e1 e2 e3 e4 e5 e6 v1 0 0 1 0 0 0 v2 1 0 1 0 1 0 v3 1 1 0 1 0 0 v4 0 1 0 0 0 1 v5 0 0 0 1 1 1
Correct Answer is : Variety
8. If a connected Graph (G) contains n vertices what would be the rank of its incidence matrix?
Correct Answer is : All of the Mentioned
9. In the following DAG find out the number of required Stacks in order to represent it in a Graph Structured Stack.
Correct Answer is : Big Data is just about lots of data
10. A Graph Structured Stack is a _____________
Correct Answer is : Data Cleansing
11. If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?
Correct Answer is : TRUE
12. Graph Structured Stack finds its application in _____________
Correct Answer is : Data mining
13. 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.
Correct Answer is : Java
14. When an operand is read, which of the following is done?
Correct Answer is : TRUE
15. What should be done when a left parenthesis ‘(‘ is encountered?
Correct Answer is : mv
16. Which of the following is an infix expression?
Correct Answer is : CLI can help you to organize files and folders
17. What is the time complexity of an infix to postfix conversion algorithm?
Correct Answer is : cd..
18. What is the postfix expression for the corresponding infix expression? a+b*c+(d*e)
Correct Answer is : delete
19. Parentheses are simply ignored in the conversion of infix to postfix expression.
Correct Answer is : There is one and only flag for every command in CLI
20. It is easier for a computer to process a postfix expression than an infix expression.
Correct Answer is : Version Control
