51
A point to point link that supports data flowing in only one direction at a time
Answer
B. Half Duplex link
52
A networking device used to connect similar types of LANs.
Answer
A. Bridge
53
A SIM card contain:
Answer
D. All of these
54
In the given tree, in what order does the vertices are processed if in-order traversal is used:
Answer
B. CBDEAFIHJG
55
IC 74 LS 138 is a:
Answer
B. Decoder
56
Binary search algorithm employs the strategy of.
Answer
A. Divide and Conquer technique
57
Dangling-else ambiguity can be eliminated by.
Answer
D. Matching else with nearest unmatched if
58
Among the following, a representation that can be used for designing a system as a collection of procedures or modules:
Answer
A. Data flow diagrams
59. In C++, the following statements causes.
#include<iostream.h>
int main()
{
int x=10,y=5;
int* p=&x;
int* q=&y;
p=q;
delete(p);
return (0);
}
(A) p-a dangling reference
(B) q-a dangling reference
(C) Both p and q as dangling references
(D) None of these
Answer: C
60
Conversion from one data type to another data type, inserted automatically by a programming language.
Answer
B. Coercion
61
The process of testing individual components in a software.
Answer
C. Unit Testing
62
In C++, the operator which cannot be overloaded.
Answer
D. :: operator
63
A solution to external fragmentation.
Answer
B. Compaction
64
A type of inheritance in which the property of one class is inherited by more than one class.
Answer
B. Hierarchical Inheritance
65
The worst case time complexity of merge sort algorithm for input size n.
Answer
D. q(nlog n)
66
A full adder circuit with x, y and z as input bits produces an output, the binary sum represented by.
Answer
B. xÅyÅz
67
If a variable is declared as register type, then the operator that cannot be applied to it.
Answer
A. Unary &
68
If grammar G=(N,å,P,S) with non terminal N={S}, terminals å={0,1} and production rules.
S®0S, S®S1, S®0, then L(G)=
S®0S, S®S1, S®0, then L(G)=
Answer
A. 0*01*
69. What would be the output of the following C program.
#include<stdio.h>
main()
{
int x=1;
while(x<=1);
{
printf(“Good Morning”);
--x;
}
}
(A) Good Morning (B) Good Morning infinite times
(C) Blank Display (D) Syntax Error
Answer: C
70
In a compiler, the task of scanning the source code, to recognize and classify various elements is known as.
Answer
C. Lexical Analysis
71
Time complexity of Prim’s minimum spanning tree algorithm is:
Answer
D. q(n2)
72
A fact in prolog is a special case of a:
Answer
B. Rule
73
Grammars that can be translated to DFAs:
Answer
B. Right linear grammar
74
An example of a compiler-compiler is:
Answer
C. YACC
75
A relation R on a set X is said to be a partial ordering if R is:
Answer
C. Reflexive, Anti-Symmetric, Transitive
Discussion
Ask a doubt or share a tip.
No comments yet — start the discussion.