Consider the C code fragment given below.
typedef struct node
{ int data; node* next ; } node; void join(node* m, node* n) { node* p = n; while (p->next != NULL) { p = p->next; } p–>next = m; }
Assuming that m and n point to valid NULL- terminated linked lists, invocation of join will
Consider the C struct defined below:
struct data {
int marks [100]; char grade; int cnumber; }; struct data student;
The base address of student is available in register R1. The field student.grade can be accessed efficiently using
Consider a combination of T and D flip flip-flop is connected to the input of the connected to the input of the D flip-flop is connected to the input of the T flip-flop and the output of the T Flip-flop is connected to the input of the D Flip-flop,
Initially, both Q0 and Q1 are set to 1 (before the 1 clock cycle). The outputs
After 3rd clock pulse :11
After 4th clock pulse: 01
Qt can be observed from the diagram that : Q1 Q0 after the 3rd cycle are 11 and after the 4th cycle are 01
Therefore, option B is correct
Consider the systems, each consisting of m linear equations in n variables.
I. If m < n, then all such systems have a solution
II. If m > n, then none of these systems has a solution
III. If m = n, then there exists a system which has a solution
Which one of the following is CORRECT?
I is not correct Has no solution, when no of equations is less than no of variables. II is not correct Eg: Has a solution III is correct Eg: Has solutions
Language is defined by the grammar: Language is defined by the grammar: Consider the following statements: P: is regular Q: L2 is regular Which one of the following is TRUE?
CFL but not regular
Consider the following types of languages: L1: Regular, L2 Context-free, L3 Recursive, L4 Recursively enumerable. Which of the following is/are TRUE? I. is recursively enumerable II. is recursive III. is context-free IV. is context-free
is recursive but not CFL as CFL’s are not closed under complementation.
Match the following: