Miscellaneous on Data Structures
practice.

In general, backtracking can be used to solve?

Space signal is of how many unit?

The words are separated by a space of how many durations?

What is the need for co-ordinate compression?

Which among the following best represents the time complexity to find an euler tour of a tree?

What will be the output for the following code?

#include <stdio.h> 
bool func(int arr[], int n, int sum) 
{ 
    if (sum == 0) 
	return true; 
    if (n == 0 && sum != 0) 
	return false; 
    if (arr[n-1] > sum) 
	return func(arr, n-1, sum); 
 
    return func(arr, n-1, sum) || func(arr, n-1, sum-arr[n-1]); 
} 
int main() 
{ 
    int arr[] = {4,6, 12, 2}; 
    int sum = 12; 
    int n = sizeof(arr)/sizeof(arr[0]); 
    if (func(arr, n, sum) == true) 
	printf("true"); 
    else
	printf("false"); 
    return 0; 
}

If chromatic number of a line graph is 4 then the chromatic index of the graph will be?

What is the LCM of 48, 18, 6?

How many unique colors will be required for proper vertex coloring of an empty graph having n vertices?

Which among the following is the message complexity for the flooding algorithm?

What is the meaning of cipher in cryptography?

What is the running time of implementing a min-cut algorithm using bidirected edges in a graph?

What is the output of the following code?

#include<stdio.h>
#include<stdlib.h>
struct Node
{
     int val;
     struct Node* next;
}*head;
int linear_search(int value)
{
      struct Node *temp = head->next;
      while(temp != 0)
      {
           if(temp->val == value)
             return 1;
           temp = temp->next;
      }
      return 0;
}
int main()
{
     int arr[5] = {1,2,3,4,5};
     int n = 5,i;
     head = (struct Node*)malloc(sizeof(struct Node));
     head->next = 0;
     struct Node *temp;
     temp = head;
     for(i=0; i<n; i++)
     {
           struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
           newNode->next = 0;
           newNode->val = arr[i];
           temp->next = newNode;
           temp = temp->next;
     }
     int ans = linear_search(-1);
     if(ans == 1)
     printf("Found");
     else
     printf("Not found");
     return 0;
}

Which of the following cipher uses a numeric key?

Which of the following is not an Eigen value of the Laplacian matrix of the complete bipartite graph?

The leaves in a state-space tree represent only complete solutions.

There is no existing relationship between a Hamiltonian path problem and Hamiltonian circuit problem.

What will be the ciphered text corresponding to "ALGORITHM" if trithemius cipher is used for encryption?

In case of stability, how many symmetric possibilities of trouble can occur?

What does co-prime mean in the Euler's totient function?