21. What will be the chromatic number of the following graph?
22. An even length cyclic graph has the edge chromatic number of 3.
23. In Huffman coding, data in a tree always occur?
24. What is the output of the following code?
#include<stdio.h>
int get_len(char *s)
{
int len = 0;
while(s[len] != '\0')
len++;
return len;
}
int main()
{
char *s = "";
int len = get_len(s);
printf("%d",len);
return 0;
}
#include<stdio.h>
int get_len(char *s)
{
int len = 0;
while(s[len] != '\0')
len++;
return len;
}
int main()
{
char *s = "";
int len = get_len(s);
printf("%d",len);
return 0;
}25. Which of the following cipher require the use of tabula recta?
26. Consider the given pseudocode for eulerizing a graph. Which of the following best suits the blank?
Pick up all the vertices of _______
Repeat edges between the vertices until the graph has no odd degree
Repeat only pre-existing edges
Pick up all the vertices of _______
Repeat edges between the vertices until the graph has no odd degree
Repeat only pre-existing edges27. How many steps are required to prove that a decision problem is NP complete?
28. In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.
29. Which of the following cipher is a special case of affine cipher?
30. Tabula recta consists of . . . . . . . .
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.
- Miscellaneous on Data Structures - Section 1
- Miscellaneous on Data Structures - Section 2
- Miscellaneous on Data Structures - Section 3
- Miscellaneous on Data Structures - Section 4
- Miscellaneous on Data Structures - Section 5
- Miscellaneous on Data Structures - Section 6
- Miscellaneous on Data Structures - Section 8
- Miscellaneous on Data Structures - Section 9
- Miscellaneous on Data Structures - Section 10
- Miscellaneous on Data Structures - Section 11
- Miscellaneous on Data Structures - Section 12