 Sample Questions, Previous Year Solved Papers, Study Materials For Competitive Examinations Like UGC NET, SET And GATE Computer Science.

## Saturday, 18 July 2015

61.         The process of testing individual components in a software.
(A) Interface Testing        (B) Partition Testing
(C) Unit Testing                (D) Structural Testing
62.         In C++, the operator which cannot be overloaded.
(A) Bitwise & operator      (B) Assignment operator
(C) == operator                  (D) :: operator
63.         A solution to external fragmentation.
(A) Segmentation             (B) Compaction
(C) Swapping                    (D) Thrashing
64.         A type of inheritance in which the property of one class is inherited by more than one class.
(A) Hybrid Inheritance
(B) Hierarchical Inheritance
(C) Multilevel Inheritance
(D) Multiple Inheritance
65.         The worst case time complexity of merge sort algorithm for input size n.
(A) q(n)                   (B) q(n2)
(C) q(log n)             (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.
(A) x+y+z                (B) xÅyÅz
(C) xyÅxzÅyz        (D) xy+xz+yz
67.         If a variable is declared as register type, then the operator that cannot be applied to it.
(A) Unary &            (B) Unary -
(C) Binary &           (D) Binary -
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)=
(A) 0*01*     (B) 0*1*
(C) 0*11*    (D) 0*1*0
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
70.      In a compiler, the task of scanning the source code, to recognize and classify various elements is known as.
(A) Code Optimization     (B) Syntactic Analysis
(C) Lexical Analysis         (D) Semantic Analysis

71.      Time complexity of Prim’s minimum spanning tree algorithm is:
(A) q(n)                   (B) q(log n)
(C) q(nlog n)          (D) q(n2)
72.      A fact in prolog is a special case of a:
(A) Query   (B) Rule
(C) Term     (D) Goal
73.      Grammars that can be translated to DFAs:
(A) Left linear grammar    (B) Right linear grammar
(C) Generic grammar       (D) All of these
74.      An example of a compiler-compiler is:
(A) JAVA    (B) LEX
(C) YACC   (D) MATLAB
75.      A relation R on a set X is said to be a partial ordering if R is:
(A) Reflexive, Symmetric, Transitive
(B) Reflexive, Symmetric, Non-Transitive
(C) Reflexive, Anti-Symmetric, Transitive
(D) Reflexive, Anti-Symmetric, Non-Transitive
76.      What would be the output of the following C program
#include<stdio.h>
main()
{
int I,x=1,y=1,z=0;
printf(“%d %d”,x,y);
for(I=0;I<3;I++)
{
x+y=z;
printf(“%d”,z);
x=y;
y=z;
}
}
(A) 1 1 2 3 5           (B) 1 1 1 1 1
(C) 1 1 0 0 0           (D) Syntax Error
77.      Let V1={A,B,C} and V2={P,Q}, then the graph below is a:
(A) Complete Graph                     (B) Digraph
(C) Bipartite Graph                       (D) Connected Graph
78.      Natural objects can be realistically modeled using:
(A) Binary space partitioning tree
(B) Fractal Geometry
(C) Octrees
(D) Constructive Solid Geometry