Technical Interview Questions for CS/IT Students on Discrete

Technical Interview Questions for CS/IT Students on Discrete Mathematics and Computational Structures

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?
#interview, #career