Miscellaneous on Data Structures MCQ question and answer with solution Page-9 section-9

Section 1 Section 2 Section 3 Section 4 Section 5 Section 6 Section 7 Section 8 Section 9 Section 10 Section 11 Section 12

81.

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 = "lengthofstring";
      int len = get_len(s);
      printf("%d",len);
      return 0;
}

A. 14

B. 0

C. Compile time error

D. Runtime error

Answer & Solution Discuss in Board Save for Later

82.
Which of the following cipher does not require the use of tabula recta?

A. running key cipher

B. vigenere cipher

C. gronsfeld cipher

D. trithemius cipher

Answer & Solution Discuss in Board Save for Later

83.

What 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 = 0;
      int ans = fact(n);
      printf("%d",ans);
      return 0;
}

A. 0

B. 1

C. 2

D. 3

Answer & Solution Discuss in Board Save for Later

84.
What will be the time complexity of update query operation in an array of size n when we use square root optimization?

A. O(√n)

B. O(n)

C. O(1)

D. O(n²)

Answer & Solution Discuss in Board Save for Later

85.

Given below is the pseudocode of the vertex cover problem. Which of the following best suits the blank?

Vertex_Cover(G = (V, E))
{
    A = { }
    while (E!=0)
    {
        pick any edge (u, v) from E
        add u and v to A
        ________________
    }
    return A
}

A. remove every edge incident on either u or v

B. add every edge incident on u

C. delete the vertex

D. delete adjacent edge

Answer & Solution Discuss in Board Save for Later

86.
Who invented the concept of inclusion-exclusion principle?

A. Abraham de Moivre

B. Daniel Silva

C. J.J. Sylvester

D. Sieve

Answer & Solution Discuss in Board Save for Later

87.
In a stack algorithm, the set of pages in a k-frame memory is always a subset of pages in a . . . . . . . . frame memory.

A. k-1

B. k

C. k+1

D. k(k+1)

Answer & Solution Discuss in Board Save for Later

88.
What will be the chromatic index for a complete graph having n vertices (consider n to be an even number)?

A. n

B. n + 1

C. n - 1

D. 2n + 1

Answer & Solution Discuss in Board Save for Later

89.
Which of the following correctly defines poly graphic substitution cipher?

A. a substitution based cipher which uses multiple substitutions at different positions

B. a substitution based cipher which uses fixed substitution over entire plain text

C. a substitution based cipher in which substitution is performed over a block of letters

D. a transposition based cipher which uses fixed substitution over entire plain text

Answer & Solution Discuss in Board Save for Later

90.
What is the advantage of iterative code for finding power of number over recursive code?

A. Iterative code requires less time

B. Iterative code requires less space

C. Iterative code is more compiler friendly

D. It has no advantage

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

81.
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 = "lengthofstring"; int len = get_len(s); printf("%d",len); return 0; }`

Answer & Solution

82.
Which of the following cipher does not require the use of tabula recta?

Answer & Solution

83.
What 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 = 0; int ans = fact(n); printf("%d",ans); return 0; }`

Answer & Solution

84.
What will be the time complexity of update query operation in an array of size n when we use square root optimization?

Answer & Solution

85.
Given below is the pseudocode of the vertex cover problem. Which of the following best suits the blank?

`Vertex_Cover(G = (V, E)) { A = { } while (E!=0) { pick any edge (u, v) from E add u and v to A ________________ } return A }`

Answer & Solution

86.
Who invented the concept of inclusion-exclusion principle?

Answer & Solution

87.
In a stack algorithm, the set of pages in a k-frame memory is always a subset of pages in a . . . . . . . . frame memory.

Answer & Solution

88.
What will be the chromatic index for a complete graph having n vertices (consider n to be an even number)?

Answer & Solution

89.
Which of the following correctly defines poly graphic substitution cipher?

Answer & Solution

90.
What is the advantage of iterative code for finding power of number over recursive code?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

81. 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 = "lengthofstring"; int len = get_len(s); printf("%d",len); return 0; }

Answer & Solution

82. Which of the following cipher does not require the use of tabula recta?

Answer & Solution

83. What 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 = 0; int ans = fact(n); printf("%d",ans); return 0; }

Answer & Solution

84. What will be the time complexity of update query operation in an array of size n when we use square root optimization?

Answer & Solution

85. Given below is the pseudocode of the vertex cover problem. Which of the following best suits the blank? Vertex_Cover(G = (V, E)) { A = { } while (E!=0) { pick any edge (u, v) from E add u and v to A ________________ } return A }

Answer & Solution

86. Who invented the concept of inclusion-exclusion principle?

Answer & Solution

87. In a stack algorithm, the set of pages in a k-frame memory is always a subset of pages in a . . . . . . . . frame memory.

Answer & Solution

88. What will be the chromatic index for a complete graph having n vertices (consider n to be an even number)?

Answer & Solution

89. Which of the following correctly defines poly graphic substitution cipher?

Answer & Solution

90. What is the advantage of iterative code for finding power of number over recursive code?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

81.
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 = "lengthofstring"; int len = get_len(s); printf("%d",len); return 0; }`

82.
Which of the following cipher does not require the use of tabula recta?

83.
What 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 = 0; int ans = fact(n); printf("%d",ans); return 0; }`

84.
What will be the time complexity of update query operation in an array of size n when we use square root optimization?

85.
Given below is the pseudocode of the vertex cover problem. Which of the following best suits the blank?

`Vertex_Cover(G = (V, E)) { A = { } while (E!=0) { pick any edge (u, v) from E add u and v to A ________________ } return A }`

86.
Who invented the concept of inclusion-exclusion principle?

87.
In a stack algorithm, the set of pages in a k-frame memory is always a subset of pages in a . . . . . . . . frame memory.

88.
What will be the chromatic index for a complete graph having n vertices (consider n to be an even number)?

89.
Which of the following correctly defines poly graphic substitution cipher?

90.
What is the advantage of iterative code for finding power of number over recursive code?