{"id":190,"date":"2020-04-05T07:05:16","date_gmt":"2020-04-05T07:05:16","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=190"},"modified":"2020-04-05T07:05:16","modified_gmt":"2020-04-05T07:05:16","slug":"computer-organization-mcq-1","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=190","title":{"rendered":"Computer Organization MCQ -1"},"content":{"rendered":"<p><strong>Q.1\u00a0\u00a0 In Reverse Polish notation, expression A*B+C*D is written as\u00a0<\/strong> \u00a0<br \/> \u00a0<br \/> \u00a0(A)\u00a0 AB*CD*+\u00a0\u00a0 (B)\u00a0 A*BCD*+<br \/> \u00a0(C) AB*CD+*\u00a0\u00a0 (D)\u00a0 A*B*CD+<br \/> \u00a0<br \/> <strong>\u00a0 Ans: A<br \/> \u00a0<br \/> Q.2\u00a0\u00a0\u00a0 SIMD represents an organization that ______________.\u00a0 \u00a0<\/strong><br \/> \u00a0(A) refers to a computer system capable of processing several programs at the same time. \u00a0<br \/> \u00a0(B) represents organization of single computer containing a control unit, processor unit and a memory unit.<br \/> \u00a0(C) includes many processing units under the supervision of a common control unit<br \/> \u00a0(D) none of the above.<br \/> \u00a0<br \/> <strong>\u00a0 Ans: C<br \/> \u00a0<br \/> Q.3\u00a0\u00a0 Floating point representation is used to store<\/strong><br \/> \u00a0(A) Boolean values\u00a0\u00a0 (B)\u00a0 whole numbers<br \/> \u00a0(C)\u00a0 real integers\u00a0\u00a0 (D)\u00a0 integers<br \/> <strong>\u00a0<br \/> \u00a0Ans: C<br \/> \u00a0<br \/> Q.4\u00a0 Suppose that a bus has 16 data lines and requires 4 cycles of 250 nsecs each to transfer data. The bandwidth of this bus would be 2 Megabytes\/sec. If the cycle time of the bus was reduced to 125 nsecs and the number of cycles required for transfer stayed the same what would the bandwidth of the bus? <\/strong>\u00a0<br \/> \u00a0\u00a0 (A)\u00a0 1 Megabyte\/sec\u00a0\u00a0 (B)\u00a0 4 Megabytes\/sec<br \/> \u00a0\u00a0 (C)\u00a0 8 Megabytes\/sec\u00a0\u00a0\u00a0 (D)\u00a0 2 Megabytes\/sec<br \/> \u00a0<br \/> <strong>\u00a0Ans: D<br \/> \u00a0<br \/> Q.5\u00a0 Assembly language<\/strong><br \/> \u00a0<br \/> \u00a0(A) uses alphabetic codes in place of binary numbers used in machine\u00a0 language \u00a0<br \/> \u00a0(B)\u00a0 is the easiest language to write programs<br \/> \u00a0(C)\u00a0 need not be translated into machine language<br \/> \u00a0(D)\u00a0 None of these<br \/> \u00a0<br \/> <strong>\u00a0Ans: A \u00a0<br \/> \u00a0<br \/> Q.6\u00a0 In computers, subtraction is generally carried out by \u00a0<\/strong><br \/> \u00a0(A)\u00a0 9\u0393\u00c7\u00d6s complement\u00a0\u00a0 (B)\u00a0 10\u0393\u00c7\u00d6s complement<br \/> \u00a0(C)\u00a0 1\u0393\u00c7\u00d6s complement\u00a0\u00a0 (D)\u00a0 2\u0393\u00c7\u00d6s complement<br \/> \u00a0<br \/> <strong>\u00a0Ans: D \u00a0<br \/> \u00a0<br \/> Q.7\u00a0 The amount of time required to read a block of data from a disk into memory is composed of seek time, rotational latency, and transfer time. Rotational latency refers<\/strong><br \/> to<br \/> \u00a0(A) the time its takes for the platter to make a full rotation \u00a0<br \/> \u00a0(B)\u00a0 the time it takes for the read-write head to move into position over the appropriate track<br \/> \u00a0(C)\u00a0 the time it takes for the platter to rotate the correct sector under the head<br \/> \u00a0(D)\u00a0 none of the above<br \/> \u00a0<br \/> <strong>\u00a0Ans: A \u00a0<br \/> \u00a0<br \/> Q.8\u00a0 What characteristic of RAM memory makes it not suitable for permanent storage?<\/strong><br \/> \u00a0 (A) too slow\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 (B)\u00a0 unreliable<br \/> \u00a0 (C) it is volatile\u00a0\u00a0 (D)\u00a0 too bulky<br \/> \u00a0<br \/> <strong>\u00a0Ans: C \u00a0<br \/> \u00a0<br \/> Q.9\u00a0 Computers use addressing mode techniques for _____________________.<\/strong><br \/> \u00a0<br \/> \u00a0(A) giving programming versatility to the user by providing facilities as pointers to memory counters for loop control \u00a0<br \/> \u00a0(B)\u00a0 to reduce no. of bits in the field of instruction<br \/> \u00a0(C)\u00a0 specifying rules for modifying or interpreting address field of the instruction<br \/> \u00a0(D)\u00a0 All the above<br \/> \u00a0<br \/> <strong>\u00a0Ans: D \u00a0<br \/> \u00a0<br \/> \u00a0Q.10\u00a0 The circuit used to store one bit of data is known as<\/strong><br \/> \u00a0\u00a0 (A)\u00a0 Register\u00a0\u00a0 (B)\u00a0 Encoder<br \/> \u00a0\u00a0 (C)\u00a0 Decoder\u00a0\u00a0\u00a0 (D)\u00a0 Flip Flop<br \/> \u00a0\u00a0 \u00a0<br \/> \u00a0Ans: D \u00a0<br \/> \u00a0<br \/> <strong>Q. 11\u00a0 (2FAOC)_16 is equivalent to<br \/> <em>_ = Base<\/em><\/strong><br \/> \u00a0 (A) (195 084)_10<br \/> \u00a0 (B) (001011111010 0000 1100)_2<br \/> \u00a0 (C) Both (A) and (B)\u00a0 \u00a0<br \/> \u00a0 (D) None of these<\/p>\n<p> <strong>\u00a0 Ans: B<br \/> \u00a0<br \/> Q.12\u00a0 The average time required to reach a storage location in memory and obtain its contents is called the<\/strong><br \/> \u00a0(A) seek time\u00a0 (B) turnaround time<br \/> \u00a0(C) access time\u00a0 (D) transfer time<br \/> \u00a0<br \/> <strong>\u00a0Ans: C<br \/> \u00a0<br \/> Q.13\u00a0 Which of the following is not a weighted code?<\/strong><br \/> \u00a0(A) Decimal Number system\u00a0 (B) Excess 3-cod<br \/> \u00a0(C) Binary number System\u00a0 (D) None of these<br \/> \u00a0<br \/> <strong>\u00a0Ans: B<br \/> \u00a0<br \/> Q.14\u00a0 The idea of cache memory is based<\/strong><br \/> \u00a0(A) on the property of locality of reference<br \/> \u00a0(B) on the heuristic 90-10 rule<br \/> \u00a0(C) on the fact that references generally tend to cluster<br \/> \u00a0(D) all of the above<br \/> \u00a0<br \/> <strong>\u00a0Ans: A<br \/> \u00a0<br \/> Q.15\u00a0 _________ register keeps track of the instructions stored in program stored in memory.<\/strong><br \/> \u00a0(A) AR (Address Register)\u00a0\u00a0 (B) XR (Index Register)<br \/> \u00a0(C) PC (Program Counter)\u00a0\u00a0\u00a0 (D) AC (Accumulator)<br \/> \u00a0<br \/> \u00a0Ans: C<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Q.1\u00a0\u00a0 In Reverse Polish notation, expression A*B+C*D is written as\u00a0 \u00a0 \u00a0 \u00a0(A)\u00a0 AB*CD*+\u00a0\u00a0 (B)\u00a0 A*BCD*+ \u00a0(C) AB*CD+*\u00a0\u00a0 (D)\u00a0 A*B*CD+ \u00a0 \u00a0 Ans: A \u00a0 Q.2\u00a0\u00a0\u00a0 SIMD represents an organization that ______________.\u00a0 \u00a0 \u00a0(A) refers to a computer system capable of processing several programs at the same time. \u00a0 \u00a0(B) represents organization of single computer&#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":[18],"tags":[],"class_list":["post-190","post","type-post","status-publish","format-standard","hentry","category-computer-architecture-and-organization"],"_links":{"self":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/190","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=190"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/190\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=190"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=190"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=190"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}