0% found this document useful (0 votes)
3 views14 pages

Nimcet Pyq's (Computer) - 2

The document contains a series of past questions from the MCA entrance exam, focusing on computer science topics such as CPU operations, memory management, Boolean algebra, and data processing functions. Each question presents multiple-choice answers, testing knowledge on concepts like cache organization, virtual memory, and binary arithmetic. It serves as a study resource for students preparing for the NIMCET exam.

Uploaded by

Siddhartha Saha
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views14 pages

Nimcet Pyq's (Computer) - 2

The document contains a series of past questions from the MCA entrance exam, focusing on computer science topics such as CPU operations, memory management, Boolean algebra, and data processing functions. Each question presents multiple-choice answers, testing knowledge on concepts like cache organization, virtual memory, and binary arithmetic. It serves as a study resource for students preparing for the NIMCET exam.

Uploaded by

Siddhartha Saha
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

India’s Most Trustable MCA Entrance Academy

Computer PYQ’s of NIMCET


2008
1. A CPU has an arithmetic unit that adds bytes and then (C) the cache hit ratio is degraded if two or more blocks
sets its V, C and Z flag bits as follows: The V-bit is set if used alternatively map onto the same block frame in the
arithmetic overflow occurs. The C-bit is a set if a carry- cache.
out is generated from the most significant bit during an (D) the number of blocks required for the cache increases
operation. The Z-bit is set if the result is zero. What are linearly with the size of the main memory.
the values of V, C and Z flag bits respectively after the
6. Let A [1…..10] be an array, let A [i] = 2i for 1 ≤ i ≤ 10.
8-bits bytes 1100 1100 and 1000 1111 are added?
After the assignment j = A [A[5]] is executed, the value of
(A) 0, 0, 0 (B) 1, 1, 0
A [j] is equal to
(C) 1, 1, 1 (D) 0, 1, 0
(A) Undefined (B) 1
2. Which one of the following statements is always true? (C) 5 (D) 10
(A) A compiled program uses more memory than an
7. The first instruction of bootstrap loader program of an
interpreted program.
operating system is stored in
(B) A compiler converts a program to a lower level
(A) RAM (B) BIOS
language for execution.
(C) Hard disk (D) None of these
(C) A compiler for a high level language takes less
memory than its interpreter. 8. The function ABC+ AB’C + A’BC + A'B’C is equivalent to
(D) Compiled programs take more time to execute than
interpreted programs. (A) AC'+ AB+ A'C (B) AB’+ AC’+ A'C
(C) A’B+ AC’+ AB’ (D) A'B+ AC+ AB’
3. Floating point numbers in a computer are represented
1s using a 10-bit mantissa (including a sign bit) and a 7- 9. The addition of 4 bit, 2's complement binary numbers
bit exponent (including a sign bit). What is the 1101 and 0100 results in
approximate value of the maximum number, which can (A) 0001 and an overflow
be represented? Assume that the mantissa is stored in (B) 1001 and no overflow
the normalized form, that is, without leading zeroes (C) 0001 and no overflow
(A) 2128 (B) 2127 (D) 1001 and an overflow
64
(C) 2 (D) 263
10. Given √(224)r = (13)r the value of radix r is
4. The capacity of a memory unit is defined by the (A) 10 (B) 8
number of words multiplied by the number of bits per (C) 6 (D) 5
word. How many separate address and data line are
needed for a memory of 4K x 16? 11. Let A =11111010 and B = 00001010 be two 8 bit 2’s
(A) 10 address lines and 16 data lines complement numbers. Their product in 2's complement
(B) 12 address lines and 10 data lines is
(C) 12 address lines and 16 data lines (A) 11000100 (B) 10011100
(D) 12 address lines and 8 data lines (C) 10100101 (D) 11010101

5. The main disadvantage of direct mapping of cache 12. Which of the following is (are) true about virtual
organization is that memory systems that uses pages
(A) it doesn't allow simultaneous access to the intended I. The virtual addres8 space can be larger than the
data and its tag amount of physical memory.
(B) it is more expensive than other type of organizations. IL. Programs must be resident in main memory

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
throughout their execution. f(x, y, z) = z(x + y) + ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(𝑧̅ + 𝑥 + 𝑦)(𝑥̅ + 𝑦̅) is
III. Pages correspond to semantic characteristics of the (A) 2 (B) 3
programs. (C) 4 (D) 5
(A) I only (B) II only
105. How many bits are required to store an ASCII
(C) I and II only (D) I and III only
character?
104. The minimum number of gates needed to (A) 7 (B) 6
implement the Boolean function (C) 8 (D) None of these

2009
16. On receiving an interrupt from an I/O device, the (C) 𝐴𝐶𝐷̅ + 𝐴̅𝐵𝐶̅ − 𝐴𝐶̅ 𝐷
̅
CPUs ̅ B𝐷 + 𝐴𝐶𝐷
(D) A ̅ + 𝐵𝐶𝐷 ̅
(A) hand over the control of address and data bus to
21. Assuming all numbers are in 2′s complement
interrupting device.
representation, which of the following numbers is
(B) branch off to interrupt service subroutine
divisible by 11111011?
immediately.
(A) 11100100 (B) 11010111
(C) branch off to interrupt service subroutine after
(C) 11011011 (D) 00000110
completion of current instruction.
(D) None of the above 22. A switching circuit that produces one in a set of
input bits as an output based on the control value of
17. Micro-programmed control unit is
control bits is termed as
(A) faster than hard-wired unit.
(A) full adder (B) inverter
(B) slower than hard-wired unit.
(C) multiplexer (D) converter
(C) to facilitate easy implementation of new instructions
(D) both (B) and (C) 23. A computer with a 32-bit word size uses 2′ s
complement to represent numbers. The range of
18. Index register in a digital computer is used for
integers that can be represented by this computer is
(A) pointing to the stack address.
(A) −232 to 232 (B) −231 to 232
(B) indirect addressing.
(C) keeping track of the number of times loop is (C) −231 to 232 − 1 (D) −232 to 231
executed. 24. To change upper case to the lower case letter in
(D) address modification. ASCII, correct mask and operation should be
19. In the virtual memory system, the address space (A) 0100000 and NOR (B) 0100000 and NAND
specified by address lines of the CPU must be …. than (C) 0100000 and OR (D) None of the above
the physical memory size and … than the secondary 25. Why is the width of a data bus so important to the
storage size. processing speed of a computer?
(A) smaller, smaller (B) smaller, larger (A) The narrower it is, the greater the computer’s
(C) larger, smaller (D) larger, larger processing speed.
20. The switching expression corresponding to (B) The wider it is, the more data can fit into the main
𝑓(𝐴, 𝐵, 𝐶, 𝐷) = ∑(1, 4, 5, 9, 11, 12) is memory
(C) The wider it is, the greater the computer’s
(A) 𝐵𝐶̅ 𝐷
̅+A ̅ C̅D + AB
̅D
processing speed.
(B) 𝐴𝐵C̅ + ACD + B ̅C̅D
(D) The wider it is, the slower the computer’s processing
speed.

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
2010
26. Which of the following is NOT one of the major data 31. A main memory has an access time of 45 ns. A 5 ns
processing function of a computer? time gap is necessary for the completion of one access
(A) gathering Data to beginning access. The bandwidth of the memory:
(B) Processing data into information (A) 25 MHz (B) 40 MHz
(C) analyzing the data or information (C) 40 MHz (D) 50 MHz
(D) storing data or information
32. A CPU has 12 bit address for memory addressing. If
27. Simplified form of a Boolean function the memory has a total capacity of 16 KB, What is the
F (X,Y,Z) = ∑(0,2,6,5,6) length of the memory?
4
(A) 𝑍̅𝑋 − 𝑋𝑌̅ (B) 𝑍̅ = 𝑋𝑌̅ (A) 2 bytes (B) 4 bytes
(C) ̅̅̅̅
𝑌𝑍 = 𝑋𝑍̅ (D) None of these (C) 8 bytes (D) 16 bytes

28. Which gate is equivalent to (NOR) OR (XOR) ? 33. For a microprocessor using I/O mapped I/O
(A) NAND gate (B) OR gate (A) Memory and I/O addresses are distinct
(C) AND gate (D) XOR gate (B) Not all data transfer instructions are available for I/O
(C) Both (A) and (B)
29. Which of the following places the common data
(D) None of above
elements in order from smallest to largest ?
(A) Field, record, character, database 34. Execution of an operating system is initiated by
(B) Character, record, field, database program called the
(C) Character, field, record, database (A) Windows Manager (B) Scheduler
(D) Bit, byte, character, record, field, database (C) Bootstrap (D) None of the above

30. Which one of the following is a stored program 35. If (12𝑥)3 = (123)𝑥 then the value of x
machine (A) 1 (B) 2
(A) Micro-processor (B) Calculator (C) Both (A) and (B) (D) None of these
(C) Analog-Computer (D) Micro-Computer
isko ques ko dekh ke hi solve
[Link] abt the rules of base of
2011 radix

36. The ASCII code of ‘A’ is


(A) 66D (B) 41H
(C) 01000010 (D) 01100011
37. An Eight bit Byte is capable of representing how
many different characters ?
(A) 64 (B) 128
(C) 256 (D) 512 (A) Z’ + (X. Y) (B) Z. (X + Y)
(C) (𝑍. 𝑋 ′ ) + 𝑌 (D) 𝑍 ′ . (𝑋 + 𝑌)
38. The least significant bit of the binary number, which
is equivalent to any odd decimal number is 40. Consider x and y be some Boolean variables, +
(A) 0 (B) 1 denotes the OR operation and “.” Denotes the AND
(C) 1 or 0 (D) All of the above operation. What will be the Simplified form of the
Boolean expression : 𝑥. (𝑥 + 𝑦) ?
39. Which of the Following Boolean expression
(A) y (B) 1
represents the shaded portion of venn diagram ?
(C) 0 (D) x
Note: Here “.” Represents an AND operation and “+”
denotes OR operation. 41. Which one of the Following is not a valid rule of
Boolean algebra?

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
(A) 𝐴 + 1 = 1 (B) 𝐴 = 𝐴′ 43. The sum of 11010 + 01111 equals to
(C) 𝐴𝐴 = 𝐴 (D) 𝐴 + 0 = 𝐴 (A) 101001 (B) 101010
(C) 110101 (D) 101000
42. When two binary numbers are added, then an
overflow will never occur if 44. Which Protocol needs to be installed for Internet
(A) Both numbers of same sign access on a network ?
(B) The carry into the sign bit position and out of sign bit (A) TCP/IP (B) TELNET
position are not equal (C) IPX/SPX (D) Net BEUI
(C) The carry into the sign bit position and out of sign bit
position are equal 45. A petabyte represents approximately
(D) The Carry into the sign bit position is 1 (A) 1000 Gigabytes (B) 1000 Kilobytes
basicaclly yaad rakho,carry from MSB is 1 (C) 1000 Terabytes (D) 1000 Yottabytes

2012
46. AN I/O processor controls the flow of information 51. The range of numbers that can be stored in 8 bits, if
between negative numbers are stored in 2’s complement form is
(A) cache memory and I/O devices (A) -128 to +128 (B) -128 to +127
(B) main memory and I/O devices (C) -127 to +128 (D) -127 to +127
(C) two I/O devices
(D) cache and main memories 52. Primary Storage is ____________ as compared to
secondary memory.
47. Which of following devices will take highest time in (A) Slow and expensive (B) fast and inexpensive
taking the backup of the data from a computer (C) fast and expensive (D) slow and inexpensive
(A) Magnetic Disk (B) Pen Drive
(C) CD (D) Magnetic Tape 53. Which of the Following unit is used to supervise
each Instruction in the CPU ?
48. ROM Is a kind of (A) Control Unit (B) Accumulator
(A) Primary Memory (B) cache Memory (C) ALU (D) Control Register
(C) Removable memory (D) Secondary Memory
54. (2𝐹𝐴0𝐶)16 is equivalent to
49. The errors that can be pointed out by compilers are (A) (195084)10
(A) Syntax errors (B) Semantic errors (B) (00101111101000001100)2
(C) Logical errors (D) Internal errors (C) Both (A) and (B)
(D) None of these
50. Let x = 11111010 and y = 00001010 be two 8-bit 2’s
complement numbers. Their Product in 2’s Complement 55. The decimal equivalent of octal number 111010 is
notation is (A) 81 (B) 72
(A) 11000100 (B) 10011100 (C) 71 (D) 61
(C) 10100101 (D) 11010101

2013 dono ans sahi [Link] banta ha NAND aur NOR gate [Link] adders banta ha NAND gate se

56. All digital circuits can be realized by using only (A) Flip-Flop (B) Rectifier
(A) Exclusive OR gates (B) Half adders (C) Comparator (D) All of these
(C) Multiplexers (D) OR gate
59. Convert the Hexadecimal number 4DF to its
57. The Boolean function 𝑎 + (𝑎. 𝑏) is equivalent to Octal
(A) 𝑎. 𝑏 (B) 𝑎 + 𝑏 (A) 2333 (B) 2337
̅
(C) 𝑎. 𝑏 (D) 𝑎̅ + 𝑏 (C) 2773 (D) 2373
means always true
58. Which of the following circuit is used as a memory 60. A tautology is a Boolean formula that is always true.
device in computers? Which of the Following is a tautology?

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
(A) 𝑥 (B) (𝑥 + 𝑥̅ )𝑦 (A) World Wide Word
(C) 𝑥 + 𝑦̅ + 𝑥̅ (D) (𝑥𝑦) + 𝑥̅ (B) World Wide Web
(C) World Wide Webinar
61. Acronym of EEPROM is (D) Word Widing Works
(A) Extended Erasable Programmable Memory
(B) Electrically Erasable Read Only Memory 64. The answer of the operation (10111)2 × (1110)2
(C) Electrically Erasable Programmable Read Only in hex equivalent is
Memory (A) 150 (B) 14C
(D) Extended Erasable Page-Oriented Memory (C) 142 (D) 13E
62. For reproducing sound, a CD audio player uses a 65. The minimum number of bits to represent a
(A) Quartz crystal (B) Titanium needle character from ASCII code set is
(C) Barium ceramic (D) Laser beam (A) 2 (B) 8
(C) 5 (D) 7
63. When we open an Internet site, we see www. What
does www stand for?

2014
66. The decimal equivalent of the hexadecimal 𝑋 = 𝑋+𝐶 𝑌 =𝑌+𝐵
operation A10 + B21 is (A) 𝑋 = 1.0 , 𝑌 = 1.0 (B) 𝑋 = 1.0, 𝑌 = 0.0
(A) 5425 (B) 5246 (C) 𝑋 = 0.0, 𝑌 = 1.0 (D) 𝑋 = 0.0 , 𝑌 = 0.0
(C) 2849 (D) 5344
71. The Boolean expression 𝑋. (𝑋 + 𝑌) is same as
67. What is the 2’s complement of (A) 𝑋. (1 + 𝑌) (B) 𝑋
0011 0101 1001 1100 ? (C) 𝑋. 1 (D) All of these
(A) 1100 1010 1100 1011
72. How many bytes are there in a nibble ?
(B) 1100 1010 0110 0011
(A) one-fourth (B) half
(C) 1100 1010 0110 0100
(C) 2 (D) 4
(D) 1100 1010 1111 1111
73. The number of bit strings of length 8, that start with
68. Mulitplication of 1112 𝑏𝑦 1012 is
the bit 0 or end with the bits 11 is
(A) 1100112 (B) 1000112
(A) 132 (B) 180
(C) 1111002 (D) 0001012
(C) 256 (D) 160
69. What is the 8 bit 2’s complement representation of
74. The result of multiplication of the numbers
the negative integer −93 ?
(10101)2 and (11101)2 in hexadecimal form is
(A) 1010011 (B) 10100010
(A) 609 (B) 216
(C) 0𝑋𝐴2 (D) None of these
(C) 261 (D) 906
70. Consider the values A = 2.0 × 1030 , B = −2.0 ×
75. The binary equivalent of (531.53125)10 is
1030 , C = 1.0. Assume that the floating point numbers
(A) (1001010011.100001)2
are represented with 32 bits. What are the values of X
(B) (1000010011.10011)2
and Y. When the Following sequence of operation are
(C) (1010010011.11001)2
executed on a computer?
(D) (1000010011.10001)2
𝑋 =𝐴+𝐵 𝑌 =𝐴+𝐶

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
2015
76. When the Value of 37H is divided by 17H, representation of 8P is
the remainder (A) (𝐶3𝐷8)36 (B) (187𝐵)16
(A) COH (B) 03H (C) (187𝐵)16 (D) (987𝐵)16
(C) 07H (D) 09H
82. Given, f1, f3 and f is canonical sum of products form
77. The number of Boolean function possible with n (in decimal) from the circuit.
binary variables is equal to
𝑛
(A) 22 (B) 2𝑛
𝑛+1
(C) 22 (D) 2𝑛+1
78. Consider 4-bit gray code representation of numbers.
Let h3h2h1h0 be the gray code representation of a number
n and g3g2g1g0 be the gray code representation of the
f1 = ∑ 𝑚(4,5,6,7,8) , f3 = ∑ 𝑚(1,6,15)
number ( n+1) modulo 15. Which one of the following
and f = ∑ 𝑚(1,6,8,15), then f2 is
functions is correct ?
(A) ∑(4,6) (B) ∑(4,8)
(A) g0(h3h2h1h0) = ∑(1, 2, 3, 6, 10, 13, 14, 15)
(C) ∑(6,8) (D) ∑(4,6,8)
(B) g1(h3h2h1h0) = ∑(4, 9, 10, 11, 12,13, 14, 15)
(C) g2(h3h2h1h0) = ∑(2, 4, 5, 6, 7, 12, 13, 15) 83. Which of the following is equivalent to the
(D) g1(h3h2h1h0) = ∑(0, 1, 6, 7, 10, 11, 12, 13) expression (𝑋 ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅̅̅̅̅̅̅̅̅
+ 𝑌 + 𝑍) ?
̅
(A) (𝑋 + 𝑌)𝑍̅ (B) (𝑋 + 𝑌)𝑍̅
79. The minimum number NAND gates required to
realize 𝐴𝐵 + 𝐴𝐵′ 𝐶 + 𝐴𝐵′ 𝐶 ′ is (C) (𝑋̅ + 𝑌̅)𝑍̅ (D) (𝑋 + 𝑌)𝑍
(A) 3 (B) 2 84. {𝑝 → 𝑞 ∨ 𝑟, 𝑞 → 𝑠, 𝑟 → 𝑠} is locally equivalent
(C) 1 (D) 0 to
80. Which optical phenomenon is utilized in the (A) 𝑞 → 𝑟 (B) 𝑟 → 𝑞
operation of the latest write-once optical storage (C) 𝑝 → 𝑠 (D) 𝑠 → 𝑝
medium called digital paper? 85. The minimum number of MOS transistors required
(A) Polarisation (B) Interference to make a dynamic RAM cell is
(C) Internal reflection (D) Diffraction (A) 1 (B) 2
81. P is a 16-bit signed integer. The 2’s Complement (C) 3 (D) 4
representation of P is (𝐹87𝐵)18 . The 2’s complement

2016
86. Consider a hard disk with 16 recording surfaces (0-15) 87. Consider the following minterm expression for F.
having 16384 cylinder (0-16383) and each cylinder 𝐹(𝑃, 𝑄, 𝑅, 𝑆) = ∑ 0, 2, 5 , 7,8,10,13,15
contains 64 sectors (0-63). Data storage capacity in each The minterms 2, 7, 8 and 13 are ‘do not care’ terms. The
sector in 512 bytes. Data are organised cylinder-wise and minimal sum-of-product form for F is
the addressing format is < cylinder no., surface no., (A) 𝑄𝑆̅ + 𝑄̅ 𝑆
sector no. >. A file of size 42797 KB is stored in the disk (B) 𝑄𝑆 + 𝑄̅ 𝑆̅
and the starting disk location of the file is < 1200, 9, 40>.
(C) 𝑄̅ 𝑅̅ 𝑆̅ + 𝑄̅ 𝑅𝑆̅ + 𝑄𝑅̅ 𝑆 + 𝑄𝑅𝑆
What is the cylinder number of the last sector of the file,
if it is stored in a continuous manner ? (D) 𝑃̅𝑄̅ 𝑆̅ + 𝑃̅𝑄𝑆 + 𝑃𝑄𝑆 + 𝑃𝑄̅ 𝑆̅
(A) 1284 (B) 1282 88. The Boolean expression represented by the
(C) 1286 (D) 1288 following Venn diagram is

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
91. The 2’s complement representation of the number
(−100)10 in a 8-bit computer is
(A) 10011011 (B) 01100100
(C) 11100100 (D) 10011100

92. The number of terms in the product of sum


canonical form of | (x1 to x2) ( x3 x4) | is
(A) a XOR b (B) 𝑎′ 𝑏 + 𝑎𝑏 ′
(A) 7 (B) 8
(C) 𝑎𝑏 + 𝑎’𝑏’ (D) (𝑎 + 𝑏’) (𝑎’ + 𝑏)
(C) 9 (D) 10
89. The range of n-bit signed magnitude representation
93. Find the odd one out:
is
(A) HTTP (B) FCFS
(A) 0 𝑡𝑜 2𝑛 − 1
(C) HTML (D) TCP/IP
(B) −(2𝑛−1 − 1) 𝑡𝑜 (2𝑛−1 − 1)
(C) −(2𝑛 − 1) 𝑡𝑜 (2𝑛−1 − 1) 94. Consider the equation (43)𝑥 = (𝑦3)8 where x and
(D) 0 𝑡𝑜 (2𝑛−1 − 1) y are unknown. The number of possible solutions are
(A) 4 (B) 6
90. A hard disk has a rotational speed of 6000 rpm. Its (C) 5 (D) 7
average latency time is
(A) 5 × 10−3 𝑠𝑒𝑐 (B) 0.05 sec 95. Subtract (1010)2 𝑓𝑟𝑜𝑚 (1101)2 using first
(C) 1 sec (D) 0.5 sec complement
(A) (1100)2 (B) (0101)2
(C) (1001)2 (D) (0011)2

2017
96. Which one of the following Boolean algebraic rule is (A) 2 milliseconds (B) 1.5 milliseconds
correct ? (C) 1.85 microseconds (D) 1.85 milliseconds
(A) 𝐴. 𝐴’ = 1
100. Which of the following is the representation of
(B) 𝐴 + 𝐴𝐵 = 𝐴 + 𝐵
decimal number (-147) in 2’s complement notation on
(C) 𝐴 + 𝐴’𝐵 = 𝐴 + 𝐵
12-bit machine ?
(D) 𝐴(𝐴 + 𝐵) = 𝐵
(A) 111101101100 (B) 110001001101
97. The representation of a floating point binary (C) 111101101101 (D) 000001101101
number +1001.11 in 8-bit fraction and 6-bit exponent
101. The First instruction of bootstrap loader program
format is
of an operating system is stored in
(A) Fraction: 01001110 exponent: 000100
(A) RAM (B) Hard Disk
(B) Fraction: 00001001 exponent: 000011
(C) BIOS (D) None of these
(C) Fraction: 10010000 exponent: 110000
(D) Fraction: 00100100 exponent: 011000 102. Consider the equation (123)5 = (𝑥8)𝑦 with x and
y as unknown. The number of possible solutions is
98. Which Term is redundant in the expansion
(A) 1 (B) 2
AB + A’C + BC ? (C) 3 (D) 4
(A) 𝐵𝐶 (B) 𝐴′ 𝐶
103. The Smallest integer that can be represented by an
(C) 𝐴𝐵 (D) None of these
8-bit number in 2’s complement form is
99. Let the memory access time is 10 milliseconds and (A) -256(B) -128
cache access time is 10 microseconds. Assume the (C) -127 (D) -255
cache hit ratio 15%. The effective memory access time
is

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
104. Which of the following in a functionally complete 105. The Total number of binary function that can be
set of gates ? defined using n Boolean variables is
I. NAND (A) 2𝑛−1 (B) 2𝑛
II NOR (C) 2𝑛+1 (D) None of these
(A) I but not II (B) II but not I
(C) Neither I nor II (D) Both I and II

2018
[Link] is the minimal form of Karnaugh map shown 110. If a signal passing through a gate is inhibited by
below? (Assume that x denotes a don’t care term) sending a low into one of the inputs and the output is
high, the gate is
(A) NOR (B) NAND
(C) AND (D) OR

111. Given, √(224)𝑟 = (13)𝑟 , the value of the radix is


(A) 10 (B) 8
(C) 5 (D) 6

112. The output of the combination circuit given below

(A) 𝑏̅𝑑̅ (B) 𝑏̅𝑑̅ + 𝑏̅𝑐̅


(C) 𝑏̅𝑑̅ + 𝑎̅𝑑̅𝑐̅𝑑̅ (D) 𝑏̅𝑑̅ + 𝑏̅𝑐̅ + 𝑐̅𝑑̅

107. In order to store floating numbers in computers


using the normalized representation and 32-bit single is
precision, the number of bits used for exponent and (A) A + B + C (B) A (B + C)
fraction are ____, ____ respectively. (C) B (C + A) (D) C (A + B)
(A) 11, 21 (B) 16, 15
113. Which one of the following expressions does NOT
(C) 16,16 (D) 8, 23
represent exclusive NOR of x and y ?
108. Let the memory access time is 10 milliseconds and (A) 𝑥𝑦 + 𝑥̅ 𝑦̅ (B) 𝑥 ⊕ 𝑦̅
cache access time is 10 microseconds. Assume the (C) 𝑥̅ ⊕ 𝑦 (D) 𝑥̅ ⨁𝑦̅
cache hit ratio 15%. The effective memory access time
114. What type of errors are not detected by
is
assemblers?
(A) 2 milliseconds (B) 1.5 milliseconds
(A) Syntax error (B) Run time error
(C) 1.85 microseconds (D) 1.85 milliseconds
(C) Logical error (D) All of these
109. What are the values of R1 and R2 respectively in the
115. Consider the equation (43)𝑥 = (𝑦3)8 , where x and
expression
y are unknown. The number of possible solutions is
(235)𝑅1 = (565)10 = (1065)𝑅2
(A) 4 (B) 5
(A) 8,16 (B) 16,8
(C) 6 (D) 7
(C) 8, 12 (D) 16,12

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
2019
116. In IEEE single precision floating point 120. For the circuit shown below, the complement of
representation, exponent is represented in……. the output
(A) 8 bit sign-magnitude representation
(B) 8 bit 2’ s complement representation
(C) Biases exponent representation with a bias value
127
(D) Biases exponent representation with a bias value
128 (A) 0 (B) 𝑋
[Link] 4-bit 2’s complement arithmetic, which of the (C) 𝑋 ′ (D) 1
following addition will result in overflow? 121. If N is a 16-bit signed integer, then 2’s complement
(A) 1111 + 1101 (B) 0110 + 0110 representation of N is (𝐹87𝐵)16 . Then, 2’s complement
(C) 1101 + 0101 (D) 0101 + 1011 representation of 8*N is
118. If we can generate a maximum of 4 Boolean (A) (𝐶3𝐷8)16 (B) (187𝐵)16
function using 𝑛 Boolean variables, what will be (C) (𝐹878)16 (D) (987𝐵)16
minimum value of 𝑛? 122. The base (or radix) of the number system such that
(A) 65536 (B) 16 the following equation holds 312/20 = 13.1 is
(C) 1 (D) 4 (A) 3 (B) 4
119. If the 2’s complement representation of a number (C) 5 (D) 6
is (011010)2 , What is its equivalent hexadecimal 123. Which of the following represents (𝐷4)16?
representation? (A) (4𝐸)16 − (5𝐵)16 (B) (14𝐸)16 − (7𝐴)16
(A) (110)16 (B) (1𝐴)16 (C) (15𝐶)16 − (6𝐷)16 (D) (1𝐸4)16 − (𝐴7)16
(C) (16)16 (D) (26)16
124. How many Boolean expression can be formed with
3 Boolean variables?
(A) 16 (B) 1024
(C) 32 (D) 256

125 In a 8 bit representation of computer system the


decimal number 47 has to be subtracted from 38 and
the result in binary 2’s complement is …………
(A) 11110111 (B) 10001001
(C) 11111001 (D) 11110001

2020
126. Assume 𝑥 ′ represent negation of x the Boolean 128. Dynamic RAM consumes ………….. power and
function 𝑥 ′ 𝑦 ′ + 𝑥𝑦 + 𝑥 ′ 𝑦 is equivalent to? …………. Than Static RAM
(A) 𝑥 ′ + 𝑦 (B) 𝑥 + 𝑦 (A) More, Faster (B) More, Slower
(C) 𝑥 + 𝑦 ′ (D) 𝑥 ′ + 𝑦 ′ (C) Less, Slower (D) Less, Faster

127. The memory unit which directly communicates 129. The binary equivalent of (234.125)10
with the CPU is known as (A) (11101010.101)16 (B) (10101010.011)16
(A) Primary Memory (B) Secondary Memory (C) (11101010.001)16 (D) (10101110.011)16
(C) Shared Memory (D) Auxiliary Memory

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
130. Determine the octal equivalent of (432267)10 ? (A) 6 (B) 4
(A) (432267)8 (B) (346731)8 (C) 5 (D) 3
(C) (2164432)8 (D) None of these
133. The time required for fetching and execution of
131. One Exabyte is equal to one simple machine instruction is known as
(A) 1018 Bytes (A) Delay time (B) CPU cycle
(B) 1 Zetta Bytes divided (/) by one thousand (C) Real Time (D) Seek Time
(C) 1 Peta Bytes multiplied (x) by one thousand
134. The equivalence of given expression 𝑥 + 𝑥 ′ 𝑦 with
(D) All of the above
Boolean theorem is……….
132. Consider the following circuit. (A) 𝑥 (B) 𝑥 + 𝑦
(C) 𝑥 ′ (D) 0

135. The Logic XOR operation of (4𝐴𝐶𝑂)16 and


(𝐵53𝐹)16 results
(A) AACB (B) 0000
(C) FFFF (D) ABCD
How many minimum numbers of two input NAND gates
are required to design the above circuit?

2021
136. The process when processor fetch or decode 141. The number (2217)8 is equivalent to
another instruction during the execution of current (A) (608)16 (B) (028𝐹)16
instruction is called (C) (048𝐹)16 (D) (2297)16
(A) Supercomputing (B) Pipelining
142. To fetch data from the secondary memory which
(C) Cloud Computing (D) Grid Computing
one of the following registers is used?
137. Which of the following is used by ALU to store the (A) MAR (B) PC
intermediate results? (C) IR (D) MBR
(A) Stack (B) Heap
143. The binary multiplication 00 * 11 will give
(C) Registers (D) Accumulator
(A) 11 (B) 00
138. One TeraByte (TB) = ……………..GB and (C) 01 (D) 10
One ExaByte (EB) = ………………..GB
144. Consider a computer system with speed of 106
(A) 210 𝐺𝐵, 216 𝐺𝐵 (B) 210 𝐺𝐵, 220 𝐺𝐵
instruction per second. A program P, having 2𝑛2 steps is
(C) 210 𝐺𝐵, 224 𝐺𝐵 (D) 210 𝐺𝐵, 230 𝐺𝐵
run on this system, where n is the input size. If n =
139. The cache memory is more effective because of 10000, what is the execution time for P?
(A) Memory localisation (A) 1.2 s (B) 20 s
(B) Locality of reference (C) 100 s (D) 200 s
(C) Memory Size
145. To access the I/O devices, the status flag is
(D) None of the mentioned
continuously checking in
140. Which of the following is the fastest means of (A) Program Controlled I/O
memory access for CPU? (B) Memory mapped I/O
(A) Registers (B) Cache (C) I/O mapped
(C) Main Memory (D) Stack (D) None of these

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
2022
146. Suppose the largest n bit number requires ‘d’ digits (A) 2.50 × 10−10 sec (B) 4.00 × 10−10 sec
in decimal representation. Which of the following (C) 1.00 × 10−10 sec (D) None of the above
relations between ‘n’ and ‘d’ is approximately correct
152. The minimum number of NAND gates required for
(A) 𝑑 = 2𝑛 (B) 𝑛 = 2𝑑
implementing the Boolean expression, 𝐴𝐵 + 𝐴𝐵̅𝐶 +
(C) 𝑑 < 𝑛𝑙𝑜𝑔10 2 (D) 𝑑 > 𝑛𝑙𝑜𝑔10 2
𝐴𝐵̅𝐶̅ is:
147. ‘Floating point representation’ is used to represent (A) 1 (B) 0
(A) Boolean Values (B) Integers (C) 2 (D) 3
(C) Whole Numbers (D) Real Numbers
153. FFFF will be the last memory location in a memory
148. Which of the following is equivalent to the Boolean of size
expression: (𝑋 + 𝑌). (𝑋 + 𝑌̅). (𝑋̅ + 𝑌) (A) 1k (B) 16k
(A) 𝑋𝑌 (B) 𝑋𝑌̅ (C) 32k (D) 64k
̅
(C) 𝑋𝑌 (D) 𝑋̅𝑌̅
154. The maximum and minimum value represented in
′ ′
149. The Boolean expression 𝐴𝐵 + 𝐴𝐵 + 𝐴 𝐶 + 𝐴𝐶 is signed 16 bit 2’s complement representations are
unaffected by the value of the Boolean variable (A) 0 and 65535 (B) −32768 and 32767
(A) B (B) None of these (C) −16384 and 16383 (D) 0 and 32767
(C) A (D) C
155. If a signal passing through a gate is inhibited by
150. Write the simplified form of the Boolean expression sending a low into one of the inputs, and the output is
(𝐴 + 𝐶)(𝐴𝐷 + 𝐴𝐷 ′ ) + 𝐴𝐶 + 𝐶: HIGH, the gate is a(n) :
(A) 𝐴 + 𝐶 (B) 𝐴′ + 𝐶 (A) NOR (B) AND
(C) 𝐴 + 𝐶 ′ (D) 𝐴 + 𝐷 (C) NAND (D) OR

151. If a processor clock is rated as 2500 million cycles


per second, then its clock period is:

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
Answer Key
2008
1. B 2. B 3. B 4. C 5. D 6. A 7. B 8. B 9. C 10. D
11. A 12. B 13. C 14. A 15. A

2009
16. C 17. A 18. B 19. C 20. A 21. A 22. C 23. C 24. C 25. B

2010
26. A 27. B 28. A 29. C 30. D 31. B 32. B 33. C 34. C 35. D

2011
36. B 37. C 38. B 39. B 40. D 41. B 42. D 43. A 44. A 45. C

2012
46. B 47. D 48. D 49. A 50. A 51. B 52. C 53. A 54. C 55. B

2013
56. B 57. B 58. A 59. B 60. C 61. C 62. D 63. B 64. C 65. D

2014
66. A 67. C 68. B 69. D 70. A 71. B 72. B 73. A 74. C 75. B

2015
76. D 77. B 78. B 79. B 80. D 81. A 82. C 83. D 84. C 85. A

2016
86. A 87. B 88. C 89. B 90. A 91. D 92. * 93. B 94. C 95. D

2017
96. C 97. A 98. D 99. * 100. C 101. A 102. C 103. B 104. D 105. D

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy
2018
106. D 107. D 108. * 109. B 110. B 111. C 112. C 113. D 114. C 115. B

2019
116. C 117. B 118. C 119. B 120. D 121. A 122. C 123. B 124. D 125. A

2020
126. A 127. A 128. C 129. C 130. D 131. D 132. B 133. B 134. B 135. C

2021
136. B 137. D 138. B 139. A 140. C 141. A 142. B 143. D 144. A 145. A

2022
146. C 147. D 148. A 149. A 150. A 151. B 152. B 153. D 154. B 155. C

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]


India’s Most Trustable MCA Entrance Academy

810-9977-628, 95160-01679, 99817-28109 [Link] [Link]

You might also like