{"id":237,"date":"2020-04-05T08:54:49","date_gmt":"2020-04-05T08:54:49","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=237"},"modified":"2020-04-05T08:54:49","modified_gmt":"2020-04-05T08:54:49","slug":"computer-ugc-net-and-tet-mcq","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=237","title":{"rendered":"Computer UGC-NET and TET MCQ"},"content":{"rendered":"<p><strong>1) In a two pass assembler, adding literals to literal table and address resolution of local symbols are done using ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0First pass and second respectively<br \/> b.\u00a0\u00a0 \u00a0Both second pass<br \/> c.\u00a0\u00a0 \u00a0Second pass and first respectively<br \/> d.\u00a0\u00a0 \u00a0Both first pass<br \/> <strong>\u00a0<br \/> Answer = D \u00a0<\/strong><br \/> Explanation: A two pass assembler does two passes over the source file ( the second pass can be over a file generated in the first pass ). In the first pass all it does is looks for label definitions and introduces them in the symbol table. In the second pass, after the symbol table is complete, it does the actual assembly by translating the operations and so on.<\/p>\n<p> <strong>2) In Two pass assembler the object code generation is done during the\u00a0 ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Second pass<br \/> b.\u00a0\u00a0 \u00a0First pass<br \/> c.\u00a0\u00a0 \u00a0Zeroeth pass<br \/> d.\u00a0\u00a0 \u00a0Not done by assembler<br \/> \u00a0<br \/> <strong>Answer = A<\/strong><br \/> Explanation:\u00a0 On the second pass, the assembler:<br \/> \u0393\u00c7\u00f3 Examines the operands for symbolic references to storage locations and resolves these symbolic references using information in the symbol table.<br \/> \u0393\u00c7\u00f3 Ensures that no instructions contain an invalid instruction form.<br \/> \u0393\u00c7\u00f3 Translates source statements into machine code and constants, thus filling the allocated space with object code.<br \/> \u0393\u00c7\u00f3 Produces a file containing error messages, if any have occurred.<\/p>\n<p> <strong>3) Pick the machine independent phase of the compiler ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Syntax analysis<br \/> b.\u00a0\u00a0 \u00a0Code generation<br \/> c.\u00a0\u00a0 \u00a0Lexical analysis<br \/> d.\u00a0\u00a0 \u00a0Intermediate code generation<br \/> e.\u00a0\u00a0 \u00a0A,C and D<br \/> \u00a0<br \/> <strong>Answer = E<\/strong><br \/> Explanation:Machine independent phases are Lexical analysis, Syntax analysis, Semantic analysis, Intermediate code generation and sometime code optimization. Machine dependent phases are code generation and code optimization.<\/p>\n<p><strong>4) A system program that combines the separately compiled modules of a program into a form suitable for execution\u00a0 ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Assembler<br \/> b.\u00a0\u00a0 \u00a0Linking loader<br \/> c.\u00a0\u00a0 \u00a0Cross compiler<br \/> d.\u00a0\u00a0 \u00a0Load and Go<br \/> e.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = B<br \/> \u00a0<br \/> 5) Which of the following type of software should be used if you need to create,edit and print document\u00a0 ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Word processing<br \/> b.\u00a0\u00a0 \u00a0Spreadsheet<br \/> c.\u00a0\u00a0 \u00a0Desktop publishing<br \/> d.\u00a0\u00a0 \u00a0UNIX<br \/> e.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = A<\/strong><br \/> Explanation: Application software such as word processors (e.g. MS Word, LibreOffice) and layout applications (e.g. Adobe InDesign, Quark Express) are used for ths purpose.<\/p>\n<p> <strong>6) Output file of the Lex is &#8230;&#8230;. is the input file is Myfile ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Myfile.e<br \/> b.\u00a0\u00a0 \u00a0Myfile.yy.c<br \/> c.\u00a0\u00a0 \u00a0Myfile.lex<br \/> d.\u00a0\u00a0 \u00a0Myfile.obj<br \/> \u00a0<br \/> <strong>Answer = B<\/strong><br \/> Explanation: This Produce the file &#8220;myfile.yy.c&#8221;, which we can then compile with g++<\/p>\n<p> <strong>7) Type checking is normally done during ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Lexical analysis<br \/> b.\u00a0\u00a0 \u00a0Syntax analysis<br \/> c.\u00a0\u00a0 \u00a0Syntax directed translation<br \/> d.\u00a0\u00a0 \u00a0Code generation<br \/> \u00a0<br \/> <strong>Answer = C<br \/> \u00a0<br \/> 8)\u00a0 yacc is available as a command on the\u00a0 ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0MINIX<br \/> b.\u00a0\u00a0 \u00a0UNIX<br \/> c.\u00a0\u00a0 \u00a0DOS<br \/> d.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = B<\/p>\n<p> 9)\u00a0 Loading process can be divided into two separate programs, to solve some problems. The first is binder the other is ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Linkage editor<br \/> b.\u00a0\u00a0 \u00a0Module Loader<br \/> c.\u00a0\u00a0 \u00a0Relocator<br \/> d.\u00a0\u00a0 \u00a0None of these<br \/> <strong>Answer = B<\/p>\n<p> 10) In Lex, a class is complemented by first placing\u00a0 ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0^<br \/> b.\u00a0\u00a0 \u00a0OR<br \/> c.\u00a0\u00a0 \u00a0&#8211;<br \/> d.\u00a0\u00a0 \u00a0NOT<br \/> \u00a0<br \/> <strong>Answer = A<\/p>\n<p> 11) Which of the following is not a feature of compiler ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Scans the entire program first and then translate it into machine code<br \/> b.\u00a0\u00a0 \u00a0When all the syntax errors are removed execution takes place<br \/> c.\u00a0\u00a0 \u00a0slow for debugging<br \/> d.\u00a0\u00a0 \u00a0Execution time is more<br \/> \u00a0<br \/> <strong>Answer = D<\/strong><br \/> Explanation:\u00a0 No Explanation<\/p>\n<p> <strong>12) Parsing is also known as ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Lexical analysis<br \/> b.\u00a0\u00a0 \u00a0Syntax analysis<br \/> c.\u00a0\u00a0 \u00a0Semantic analysis<br \/> d.\u00a0\u00a0 \u00a0Code generation<br \/> \u00a0<br \/> <strong>Answer = B<\/strong><br \/> Explanation:No\u00a0 Explanation<\/p>\n<p> <strong>13) The linker ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0is same as the loader<br \/> b.\u00a0\u00a0 \u00a0is required to create a load module<br \/> c.\u00a0\u00a0 \u00a0is always used before programs are executed<br \/> d.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = B<\/p>\n<p> 14) Predictive parsers can be ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Recursive<br \/> b.\u00a0\u00a0 \u00a0Constructive<br \/> c.\u00a0\u00a0 \u00a0Non recursive<br \/> d.\u00a0\u00a0 \u00a0Both A and B<br \/> \u00a0<br \/> <strong>Answer =\u00a0 A<\/p>\n<p> 15) Producer consumer problem can be solved using ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0semaphores<br \/> b.\u00a0\u00a0 \u00a0event counters<br \/> c.\u00a0\u00a0 \u00a0monitors<br \/> d.\u00a0\u00a0 \u00a0All of above<br \/> e.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = D<\/p>\n<p> 16) Bottom up parsing involves <\/strong>?<br \/> a.\u00a0\u00a0 \u00a0shift reduce<br \/> b.\u00a0\u00a0 \u00a0Handle pruning<br \/> c.\u00a0\u00a0 \u00a0Operator check<br \/> d.\u00a0\u00a0 \u00a0A &amp; B<br \/> \u00a0<br \/> <strong>Answer = D<br \/> \u00a0<br \/> 17) An example of intermediate language is ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0SNOBOL<br \/> b.\u00a0\u00a0 \u00a0PASCAL<br \/> c.\u00a0\u00a0 \u00a0COBOL<br \/> d.\u00a0\u00a0 \u00a0UNCOL<br \/> \u00a0<br \/> <strong>Answer = D<\/p>\n<p> 18) In a two pass assembler the object code generation is done during the ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Second pass<br \/> b.\u00a0\u00a0 \u00a0First pass<br \/> c.\u00a0\u00a0 \u00a0Zeroeth pass<br \/> d.\u00a0\u00a0 \u00a0Not done by assembler<br \/> \u00a0<br \/> <strong>Answer = A<br \/> \u00a0 \u00a0<br \/> 19) A programming language is to be designed to run on a machine that does not have a big memory. The language should ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0prefer a 2 pass compiler to a 1 pass compiler<br \/> b.\u00a0\u00a0 \u00a0prefer a 1 pass compiler to a 2 pass compiler<br \/> c.\u00a0\u00a0 \u00a0prefer an interpreter to a compiler<br \/> d.\u00a0\u00a0 \u00a0Not support recursion<br \/> e.\u00a0\u00a0 \u00a0A, C, D<br \/> \u00a0<br \/> <strong>Answer = E \u00a0<br \/> \u00a0 \u00a0<br \/> 20) Which of the following system software resides in main memory always ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Text editor<br \/> b.\u00a0\u00a0 \u00a0Assembler<br \/> c.\u00a0\u00a0 \u00a0Linker<br \/> d.\u00a0\u00a0 \u00a0Loader<br \/> \u00a0<br \/> <strong>Answer = D<br \/> \u00a0<br \/> 21) In which addressing mode the operand is given explicitly in the instruction ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Absolute mode<br \/> b.\u00a0\u00a0 \u00a0Immediate mode<br \/> c.\u00a0\u00a0 \u00a0Indirect mode<br \/> d.\u00a0\u00a0 \u00a0Index mode<br \/> e.\u00a0\u00a0 \u00a0None of these<br \/> \u00a0<br \/> <strong>Answer = B<\/strong><br \/> Explanation: In Immediate addressing mode operand is directly found from the instruction. No memory address is required to read the operand.<\/p>\n<p> <strong>22) Which of the following is not true ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0UGL doesn&#8217;t support high level seven interaction<br \/> b.\u00a0\u00a0 \u00a0Many database management system package support 4GLs<br \/> c.\u00a0\u00a0 \u00a0All of above<br \/> d.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = A<br \/> \u00a0<br \/> 23)\u00a0 Nonmodifiable procedures are called ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0concurrent procedures<br \/> b.\u00a0\u00a0 \u00a0serially usable procedures<br \/> c.\u00a0\u00a0 \u00a0reentrant procedures<br \/> d.\u00a0\u00a0 \u00a0topdown procedures<br \/> e.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = B<br \/> \u00a0<br \/> 24) Which of the following is not a type of assembler ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0one pass<br \/> b.\u00a0\u00a0 \u00a0two pass<br \/> c.\u00a0\u00a0 \u00a0three pass<br \/> d.\u00a0\u00a0 \u00a0load and go<br \/> \u00a0<br \/> <strong>Answer = C<br \/> \u00a0 \u00a0<br \/> 25) Daisy chain is a device for ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Interconnecting a number of devices to number of controllers<br \/> b.\u00a0\u00a0 \u00a0Connecting a number of devices to a controller<br \/> c.\u00a0\u00a0 \u00a0Connecting a number of controller to devices<br \/> d.\u00a0\u00a0 \u00a0All of above<br \/> e.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = B<br \/> \u00a0\u00a0 \u00a0<br \/> 26) Input of Lex is ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0set to regular expression<br \/> b.\u00a0\u00a0 \u00a0statement<br \/> c.\u00a0\u00a0 \u00a0Numeric data<br \/> d.\u00a0\u00a0 \u00a0ASCII data<br \/> \u00a0<br \/> <strong>Answer =\u00a0 A<br \/> \u00a0<br \/> 27) Yacc semantic action is a sequence of ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Tokens<br \/> b.\u00a0\u00a0 \u00a0Expression<br \/> c.\u00a0\u00a0 \u00a0C statement<br \/> d.\u00a0\u00a0 \u00a0Rules<br \/> \u00a0<br \/> <strong>Answer = C<br \/> \u00a0 \u00a0<br \/> 28) Which of the following software tool is parser generator ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Lex<br \/> b.\u00a0\u00a0 \u00a0Yacc<br \/> c.\u00a0\u00a0 \u00a0Both A and B<br \/> d.\u00a0\u00a0 \u00a0None of these<br \/> \u00a0<br \/> <strong>Answer = B<br \/> \u00a0 \u00a0<br \/> 29) A Lex compiler generates ?<\/strong><br \/> a.\u00a0\u00a0 \u00a0Lex object code<br \/> b.\u00a0\u00a0 \u00a0Transition tables<br \/> c.\u00a0\u00a0 \u00a0C Tokens<br \/> d.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = B<br \/> \u00a0 \u00a0<br \/> 30) A Compiler has &#8230;&#8230;. phases ?<\/strong><br \/> a.\u00a0\u00a0 \u00a07<br \/> b.\u00a0\u00a0 \u00a06<br \/> c.\u00a0\u00a0 \u00a08<br \/> d.\u00a0\u00a0 \u00a0None of above<br \/> \u00a0<br \/> <strong>Answer = C<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>1) In a two pass assembler, adding literals to literal table and address resolution of local symbols are done using ? a.\u00a0\u00a0 \u00a0First pass and second respectively b.\u00a0\u00a0 \u00a0Both second pass c.\u00a0\u00a0 \u00a0Second pass and first respectively d.\u00a0\u00a0 \u00a0Both first pass \u00a0 Answer = D \u00a0 Explanation: A two pass assembler does two passes over&#8230;<\/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-237","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\/237","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=237"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/237\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=237"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=237"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=237"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}