Miscellaneous On Data Structures - Study Mode
[#986] What is the rate of the hamming code of parity bit m=8?
Correct Answer
(D) 0.97
[#987] Which of the following statement about 0/1 knapsack and fractional knapsack problem is correct?
Correct Answer
(D) In 0/1 knapsack problem items are indivisible and in fractional knapsack items are divisible
[#988] How many times is the function recursive_min_element() called when the following code is executed? int min_of_two(int a, int b)
{
if(a < b)
return a
return b
}
int recursive_min_element(int *arr, int len, int idx)
{
if(idx == len - 1)
return arr[idx]
return min_of_two(arr[idx], recursive_min_element(arr, len, idx + 1))
}
int main()
{
int n = 10, idx = 0, arr[] = {5,2,6,7,8,9,3,-1,1,10}
int min_element = recursive_min_element(arr,n,idx)
printf("%d",min_element)
return 0
}
Correct Answer
(B) 10
[#989] What 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,0}, n = 7, 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
}
Correct Answer
(B) 7
[#990] What will be the output for the following code? #include <stdio.h>
#include <math.h>
void PowerSet(char *set, int set_size)
{
unsigned int pow_size = pow(2, set_size)
int count, j
for(count = 0
count < pow_size
count++)
{
for(j = 0
j < set_size
j++)
{
if(count & (1<<j))
printf("%c", set[j])
}
printf(",")
}
}
int main()
{
char strset[] = {'a','b','c'}
PowerSet(strset, 3)
return 0
}
Correct Answer
(C) ,a,b,ab,c,ac,bc,abc,