NIELIT STQC 2021 Quiz-74

Matrix multiplication is a/an _________ property.

What is the Cartesian product of A = {1,2} and B = {a, b}?

Consider the following statements:

(i). Any Dynamic Programming algorithm with n subproblems will run in O(1) time.

(ii). Dynamic programming solves a problem faster then greedy method.

(iii). Unlike greedy algorithms, dynamic programming methods always provide correct/optimal solution.

Which of the above statement/s is/are correct?

Which of the following standard algorithms is not Dynamic Programming based?

Consider the following statements:
S₁ : A lexeme is a sequence of characters in the source program that is matched by pattern for a token.
S₂ : The set of string described by a rule is called pattern associated with a token.
Which of the following is true?

Which of the following would not be specified in a communication protocol ?

Comparing the time T1 taken for a single instruction on a pipelined CPU, with time T2 taken on a non-pipelined but identical CPU, we can say that __________?

What will be the output of the following C code?

#include <stdio.h>

void main()

{

char *p = calloc(100, 1);

p = "Gradeup";

printf("%s\n", p);

}

Which command is used to insert data into the row of a table:

Consider the circuit shown below: