51.A point to point link that supports data flowing in only one direction at a time:
(A) Simplex link (B) Half Duplex link (C) Full duplex link (D) Leased Line
52.A networking device used to connect similar types of LANs :
(A) Bridge (B) Repeater (C) Hub (D) MODEM
53. A SIM card contain:
(A) Personal Identification Number
(B) International Mobile Subscriber Identity
(C) Authentication key
(D) All of these
55. IC 74 LS 138 is a :
(A) NOR gate
(B) Decoder
(C) Latch
(D) Tri-state Buffer
56. Binary search algorithm employs the strategy of:
(A) Divide and Conquer technique
(B) Dynamic Programming
(C) Branch & Bound technique
(D) Greedy Strategy
57. Dangling - else ambiguity can be eliminated by:
(A) Matching else with nearest if
(B) Matching else with unmatched if
(C) Removing last occurrence of else
(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:
(A) Data flow diagrams
(B) Activity Chart
(C) Flow chart
(D) E R Modelling
59. In C++, the following statements causes:
# include
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
60. Conversion from one data type to another data type, inserted automatically by a programming
language:
(A) . Polymorphism (B) Coercion
(C) Auto Binding (D) Dynamic Binding
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) O (n) (B) O (n^2) (C)O (log n) (D) O(n log 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) (C) (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-
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)O (n) (B) O (log n) (C) O (n log n) (D) O (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 - complier 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
(A) Simplex link (B) Half Duplex link (C) Full duplex link (D) Leased Line
52.A networking device used to connect similar types of LANs :
(A) Bridge (B) Repeater (C) Hub (D) MODEM
53. A SIM card contain:
(A) Personal Identification Number
(B) International Mobile Subscriber Identity
(C) Authentication key
(D) All of these
55. IC 74 LS 138 is a :
(A) NOR gate
(B) Decoder
(C) Latch
(D) Tri-state Buffer
56. Binary search algorithm employs the strategy of:
(A) Divide and Conquer technique
(B) Dynamic Programming
(C) Branch & Bound technique
(D) Greedy Strategy
57. Dangling - else ambiguity can be eliminated by:
(A) Matching else with nearest if
(B) Matching else with unmatched if
(C) Removing last occurrence of else
(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:
(A) Data flow diagrams
(B) Activity Chart
(C) Flow chart
(D) E R Modelling
59. In C++, the following statements causes:
# include
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
60. Conversion from one data type to another data type, inserted automatically by a programming
language:
(A) . Polymorphism (B) Coercion
(C) Auto Binding (D) Dynamic Binding
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) O (n) (B) O (n^2) (C)O (log n) (D) O(n log 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) (C) (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-
69. What would be the output of the following C program
# include
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)O (n) (B) O (log n) (C) O (n log n) (D) O (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 - complier 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
5 comments:
answers are
51) half duplex (its only one direction AT A TIME)
55) decoder
62) :: operator
69) blank display (there is ; after while)
71)o(n2)
72) rule
question no: 58,60,80,29,44
doubt in answers....but will get back soon
@ Neethu..
51. half duplex will not be the answer because even though its unidirectional it can not at the same time.
@neethu...
Qno.64.)the property of one class inherited by more than one class
the answer will be multiple inheritance
final key problems
Deleted questions are
37. The output generated by the following C program does not include the value:
#include
main()
{
int n=3;
while(n>1)
{
if((n%2)!=1)
n=n/2;
else
n=3*n+1;
printf(“%d”,n);
}
}
(A) 5 (B) 6 (C) 8 (D) 16
The correct answer is option B..
We checked these answer by using turbo c++ compiler
51. A point to point link that supports data flowing in only one direction at a time
(A) Simplex link (B) Half Duplex link
(C) Full Duplex link (D) Leased Line
The correct option is B
Source:data communication and computer networks
By faurossa
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) xyz (C) xyxzyz (D) xy+xz+yz
The correct option is B
Source :computer organization and architecture by Morris Mano
68.If grammar G=(N,,P,S) with non terminal N={S}, terminals ={0,1} and production rules.
S0S, SS1, S0, then L(G)=
(A) 0*01* (B) 0*1* (C) 0*11* (D) 0*1*0
The correct option is A
Source: automata and formal languages by peter linz
87. The technique used for producing color displays with random scan CRT monitors:
(A) Beam Penetration (B) Shadow Mask
(C) Direct View Storage (D) Gas-Discharge
The correct option is A
Source:computer graphics by steve bakener
Wrongly answered questions
54. In the given tree, in what order does the vertices are processed if in-order traversal is used:
(A) ABCDEFGHIJ (B) CBDEAFIHJG
(C) CEDBIJHGFA (D) CBEDAFGIHJ
Correct option is B
Source: data structures by lipchutz shaum’s series
59. In C++, the following statements causes.
#include
int main()
{
int x=10,y=5;
int* p=&x;
int* q=&y;
p=q;
delete(p);
return (0);
}
[if !supportLists]-->(A) p-a dangling reference
[if !supportLists]-->(B) q-a dangling reference
[if !supportLists]-->(C) Both p and q as dangling references
[if !supportLists]-->(D) None of these
Correct option is C
Source : let us c by yaswant kanithkar
69. What would be the output of the following C program.
#include
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
Correct option is C
Source : let us c by yaswant kanithkar
Post a Comment