Skip to content

C Programming Interview Questions Basics Viva Tutorials

3
  • Vinay Nagaraju
C Programming Interview Questions Basics Viva Tutorials

1.) If every node u in G is adjacent to every other node v in G, A graph is said to be a.) isolated b.) complete c.) finite d.) strongly connected ANSWER: b.) complete 2.) In a Heap tree a.) Values in a node is greater than every value in left sub tr

Read this post on ingenuitydias.com


Popular Articles by this blogger