{"id":225,"date":"2020-04-05T08:48:41","date_gmt":"2020-04-05T08:48:41","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=225"},"modified":"2020-04-05T08:48:41","modified_gmt":"2020-04-05T08:48:41","slug":"computer-science-mcq-0003","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=225","title":{"rendered":"Computer Science MCQ-0003"},"content":{"rendered":"

51.A point to point link that supports data flowing in only one direction at a time:
(A) Simplex link\u00a0 (B) Half Duplex link (ANS) <\/strong>(C) Full duplex link (D) Leased Line<\/p>\n

52.A networking device used to connect similar types of LANs :
(A) Bridge (ANS)<\/strong>(B) Repeater (C) Hub (D) MODEM<\/p>\n

53. A SIM card contain:
(A) Personal Identification Number
(B) International Mobile Subscriber Identity
(C) Authentication key
(D) All of these (ANS)<\/strong><\/p>\n

55. IC 74 LS 138 is a :
(A) NOR gate
(B) Decoder (ANS)<\/strong>
(C) Latch
(D) Tri-state Buffer<\/p>\n

56. Binary search algorithm employs the strategy of:
(A) Divide and Conquer technique (ANS)<\/strong>
(B) Dynamic Programming
(C) Branch & Bound technique
(D) Greedy Strategy<\/p>\n

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 (ANS)<\/strong><\/p>\n

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 (ANS)<\/strong>
(B) Activity Chart
(C) Flow chart
(D) E R Modelling<\/p>\n

59. In C++, the following statements causes:
# include \u00a0
int main ( )
{
int x = 10, Y = 5 ;
int* p=& x;
int* q = & Y ;
p=q;
delete (p) ;
return (0) ;
}<\/p>\n

(A) P – a dangling reference
(B) q – a dangling reference
(C) Both p and q as dangling references (ANS)<\/strong>
(D) None of these<\/p>\n

60. Conversion from one data type to another data type, inserted automatically by a programming language:
\u00a0(A) . Polymorphism (B) Coercion (ANS)<\/strong>
\u00a0(C) Auto Binding (D) Dynamic Binding<\/p>\n

61.The process of testing individual components in a software:
\u00a0(A) Interface Testing (B) Partition Testing
\u00a0(C) Unit Testing (ANS)<\/strong> (D) Structural Testing<\/p>\n

62. In C++, the operator which cannot be overloaded:
\u00a0(A) Bitwise & operator (B) Assignment operator
\u00a0(C) = = operator (D):: operator (ANS)<\/strong><\/p>\n

63.A solution to external fragmentation:
(A) Segmentation (B) Compaction (ANS)<\/strong>
(C) Swapping (D) Thrashing<\/p>\n

64. A type of inheritance in which the property of one class is inherited by more than one class
\u00a0(A) Hybrid Inheritance (B) Hierarchical Inheritance (ANS)<\/strong>
\u00a0(C) Multilevel Inheritance (D) Multiple Inheritance<\/p>\n

65. The worst case time complexity of merge sort algorithm for input size n :
\u00a0(A) O (n) (B) O (n^2) (C)O (log n) (D) O(n log n) (ANS)<\/strong><\/p>\n

67.If a variable is declared as register type, then the operator that cannot be applied to it :
\u00a0(A) Unary & (ANS)<\/strong> (B) Unary – (C) Binary & (D) Binary-<\/p>\n

69. What would be the output of the following C program
# include\u00a0 stdio.h
main ()
{
int x =1;
while (x < = 1);
{
printf (“Good Morning”);
– – x ;
}
}
(A) Good Morning
(B) Good Morning infinite times
(C) Blank Display (ANS)<\/strong>
(D) Syntax Error<\/p>\n

70. In a compiler, the task of scanning the source code, to recognize and classify various elements is known as:
\u00a0(A) Code Optimization (B) Syntactic Analysis
\u00a0(C) Lexical Analysis (ANS)<\/strong> (D) Semantic Analysis<\/p>\n

71.Time Complexity of Prim’s minimum spanning tree algorithm is:
\u00a0(A)O (n) (B) O (log n) (C) O (n log n) (D) O (n2<\/sup>) (ANS)<\/strong><\/p>\n

72.A fact in prolog is a special case of a :
(A) Query (B) Rule (ANS)<\/strong> (C) Term (D) Goal<\/p>\n

73.Grammars that can be translated to DFAs :
\u00a0(A) Left linear grammar (B) Right linear grammar (ANS)<\/strong>
\u00a0(C) Generic grammar (D) All of these<\/p>\n

74.An example of a compiler – complier is:
(A) JAVA (B) LEX
(C) YACC (ANS)<\/strong> (D) MATLAB<\/p>\n

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 (ANS)<\/strong>
(D) Reflexive, Anti – Symmetric, Non, Transitive<\/p>\n","protected":false},"excerpt":{"rendered":"

51.A point to point link that supports data flowing in only one direction at a time: (A) Simplex link\u00a0 (B) Half Duplex link (ANS) (C) Full duplex link (D) Leased Line 52.A networking device used to connect similar types of LANs : (A) Bridge (ANS)(B) Repeater (C) Hub (D) MODEM 53. A SIM card contain:…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"footnotes":""},"categories":[22],"tags":[],"class_list":["post-225","post","type-post","status-publish","format-standard","hentry","category-computer-science-combined"],"_links":{"self":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/225","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=225"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/225\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=225"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=225"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=225"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}