Miscellaneous on Data Structures MCQ question and answer with solution

Home / Data Structure / Miscellaneous On Data Structures

11.
Given below is the pseudocode of the dominating set problem. Which of the following best suits the blank?
Dominant(G = (V, E))
{
    D = { }
    while (E!=0)
    {
        pick any edge e connecting to vertices X and Y
        add one vertex between X and Y to set D
        ________________
    }
    return D;
}

Answer & Solution Discuss in Board Save for Later

13.
Which of the following code will generate unique random numbers every time?

#include <stdlib.h> 
int main() 
{ 
     srand(0); 
     printf("%d\n", rand()%50); 
     return 0; 
}

#include <stdlib.h> 
int main() 
{ 
     srand(time(0)); 
     printf("%d\n", rand()%50); 
     return 0; 
}

#include <stdlib.h> 
int main() 
{ 
    srand(1); 
    printf("%d\n", rand()%50); 
    return 0; 
}

#include <stdlib.h> 
int main() 
{
     printf("%d\n", rand()%50); 
     return 0; 
}

Answer & Solution Discuss in Board Save for Later

17.
Which of the following refers to the independence number of a graph?

Answer & Solution Discuss in Board Save for Later

Read More Section(Miscellaneous on Data Structures)

Each Section contains maximum 100 MCQs question on Miscellaneous on Data Structures. To get more questions visit other sections.