FeedBack Form

Your Name :
Your Email :
Your Location :
Your Message :
   
FeedBack

DATA STRUCTURE INTERVIEW QUESTION & ANSWERS

Technical
Follow Us
 
51. Define graph?
  A graph is a collection of two sets V and E where V is a finite non empty set of vertices and E is a finite non empty set of edges. Vertices are nothing but the nodes in the graph and the line joining the two adjacent vertices is called edge or arc.
Your Name Your Email-ID
Your Answer
 
52. What are the different types of graphs?
  Basically graphs are of four types :
  • Connected graph
  • Non connected graph
  • Undirected graph
  • Directed graph
Your Name Your Email-ID
Your Answer
 
 
53. What is the difference between connected and undirected graph?
  Connected graph : A graph is linked if there is a pathway between any two nodes of the graph such a graph is called as a connected graph.
Undirected graph : This graph contains an unordered edges.
Your Name Your Email-ID
Your Answer
 
54. What are the two simple ways of representing graphs?
  Adjacency matrix and associative lists are two simple ways to represent graphs.
Your Name Your Email-ID
Your Answer
 
55. Define dynamic memory?
  The dynamic memory allocation means one can allocate the memory of required size, as well as de allocate(free) it. So that freed memory can be utilized further. Also the memory can be reallocated.
Your Name Your Email-ID
Your Answer