Visual BI Solution - Written Interview Experience.
First Round 20 question.
Time Allocated - 30mins.
Subject included:
Data structures - Stack, Queues, Graph, Complexity, Trees.
C programming - strings.
Graphs include complexity of adjacent list and matrix?
Result of stack after postfix expression for given infix - 2*3-(4+5).
No. of nodes in tree with depth is given.
First Round 20 question.
Time Allocated - 30mins.
Subject included:
Data structures - Stack, Queues, Graph, Complexity, Trees.
C programming - strings.
Graphs include complexity of adjacent list and matrix?
Result of stack after postfix expression for given infix - 2*3-(4+5).
No. of nodes in tree with depth is given.
No comments:
Post a Comment