Discrete Mathematics
1.
Do you think Dijisktra’s Algorithms is flawless to find out the shortest path?
2.
Are trees and graphs are relevant in computing? Where?
3.
What do you mean by an equivalence relation?
4.
Explain ‘Pigeon Hole Principle’?
5.
What...
More
Discrete Mathematics
1.
Do you think Dijisktra’s Algorithms is flawless to find out the shortest path?
2.
Are trees and graphs are relevant in computing? Where?
3.
What do you mean by an equivalence relation?
4.
Explain ‘Pigeon Hole Principle’?
5.
What is a spanning tree?
6.
What’s the difference between a complete binary tree and full binary tree?
7.
What do you mean by a ‘regular graph’?
8.
What is the difference between a graph and a tree?
9.
Do you know about the Traveling Salesman Problem?
10.
Have you heard about Graph Coloring Problem with Minimal number of Colours?
Compilers
1.
Can you differentiate between ‘syntax analysis’ and ‘semantic analysis’ during
compiler design?
2.
In simple words, what shall be the basic difference between top-down and bottom-up
parsing?
3.
Can you say something about type checking and its importance?
4.
What is the need for Symbol Table?
5.
What is the fundamental difference between a ‘compiler’ and an ‘Interpreter’?
6.
Which of the
Less
