Q101
Open questionBeaufort cipher is a variant of . . . . . . . .
Select an option to see the answer and solution.
Data Structure · all questionsMiscellaneous on Data Structures
Miscellaneous on Data Structures
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
1,171
Questions
6/59
Page
Pick an option on a question to see the right answer and solution.
Q102
Open questionWhich graph cannot contain K3, 3 as a minor of graph?
Select an option to see the answer and solution.
Q103
Open questionUnder what case of Master's theorem will the recurrence relation of merge sort fall?
Select an option to see the answer and solution.
Q104
Open questionHamming codes can be used for both single-bit error and burst error detection and correction.
Select an option to see the answer and solution.
Q105
Open questionWhat is the output of the following code?
#include<stdio.h>
#include<stdlib.h>
struct Node
{
int val;
struct Node *next;
}*head;
int recursive_get_len(struct Node *current_node)
{
if(current_node == 0)
return 0;
return 1 + recursive_get_len(current_node->next);
}
int main()
{
int arr[10] = {-1,2,3,-3,4,5}, n = 6, i;
struct Node *temp, *newNode;
head = (struct Node*)malloc(sizeof(struct Node));
head->next = 0;
temp = head;
for(i=0; i<n; i++)
{
newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->val = arr[i];
newNode->next = 0;
temp->next = newNode;
temp = temp->next;
}
int len = recursive_get_len(head->next);
printf("%d",len);
return 0;
}Select an option to see the answer and solution.
Q106
Open questionAtbash cipher is less secure than affine cipher.
Select an option to see the answer and solution.
Q107
Open questionIf the complement of a graph is an independent set, then the set of vertices itself is a vertex cover.
Select an option to see the answer and solution.
Q108
Open questionWhich of the following is a type of substitution cipher?
Select an option to see the answer and solution.
Q109
Open questionHow many bits are needed for standard encoding if the size of the character set is X?
Select an option to see the answer and solution.
Q110
Open questionAutokey cipher is also known as?
Select an option to see the answer and solution.
Q111
Open questionHow many printable characters does the ASCII character set consists of?
Select an option to see the answer and solution.
Q112
Open questionWhich algorithm is the most efficient numerical algorithm to obtain lcm?
Select an option to see the answer and solution.
Q113
Open questionFrom the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
Select an option to see the answer and solution.
Q114
Open questionWhat is the output of the following code?
int fact(int n)
{
if(n == 0)
return 1;
return n * fact(n - 1);
}
int main()
{
int n = 1;
int ans = fact(n);
printf("%d",ans);
return 0;
}Select an option to see the answer and solution.
Q115
Open questionWhich among the following is the eulerian tour for the graph given below?
Select an option to see the answer and solution.
Q116
Open questionUnder what case of Master's theorem will the recurrence relation of stooge sort fall?
Select an option to see the answer and solution.
Q117
Open questionWhich of the following is not an application of topological sorting?
Select an option to see the answer and solution.
Q118
Open questionWhich graph has a size of minimum vertex cover equal to maximum matching?
Select an option to see the answer and solution.
Q119
Open questionConsider the given page reference string 6, 1, 0, 3, 1, 2, 1, 5, 3, 2, 0, 1, 3. How many page faults will occur if the program has 4-page frames available to it and it uses the least recently used algorithm?
Select an option to see the answer and solution.
Q120
Open questionWhat is the rule for encryption in playfair cipher if the letters in a pair appear in same row?
Select an option to see the answer and solution.