What is a spanning Tree?
- 1 Answers
- 1092 Views
- TCS, I also Faced
- E-Mail Answers
Answer / jagrit kashyap
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.
| Is This Answer Correct ? | 1 Yes | 0 No |
What are the functions to open and close the file in c language?
What is a pragma?
Why header files are used?
Explain function?
Write a function which takes as parameters one regular expression(only ? and * are the special characters) and a string and returns whether the string matched the regular expression.
The C language terminator is a.semicolon b.colon c.period d.exclamation mark
Explain spaghetti programming?
int i[2], j; int *pi;i[0] = 1; i[1] = 5; pi = i; j = *pi + 1 + *(pi + 1)Value of j after execution of the above statements will be a) 7 b) 6 c) 4 d) pointer
tell me the full form of c?
What are the two forms of #include directive?
What are the different types of endless loops?
Why Modern OS are interrupt driven?Give an example
C 
