कम्प्युटर ज्ञान – Computer Knowledge MCQ
कम्प्युटर ज्ञान – IT प्रवेश
Computer Knowledge · IT Entrance – B.Sc. CSIT, BIT & BCA · ३९१ प्रश्न
३९१ प्रश्न उपलब्ध। मोड छान्नुहोस्:
कम्प्युटर ज्ञान: प्रश्न र उत्तर
सही लागेको विकल्पमा थिच्नुहोस्। सही भए हरियो, गलत भए रातो देखिन्छ; ३ सेकेन्डपछि सही उत्तर र व्याख्या देखिन्छ।
सही: ० / ०
-
Which gate gives output 0 only when all its inputs are 1?
सही उत्तर: क) NAND
NAND is the complement of AND, so it outputs 0 only when every input is 1. NOR outputs 1 only when all inputs are 0.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
How many rows are there in the truth table of a function with 3 input variables?
सही उत्तर: क) 8
A truth table has 2^n rows for n inputs, so 3 inputs give 2^3 = 8 rows. 6 would be 3 x 2, which is a common mistake.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
In Boolean algebra, A·A' equals:
सही उत्तर: क) 0
A variable ANDed with its own complement is always 0, because one of them is always 0 (complement law). Similarly, A + A' = 1.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
An XOR gate gives output 1 when:
सही उत्तर: क) Its two inputs are different
Exclusive-OR outputs 1 only when the inputs differ (01 or 10). When both inputs are equal, the output is 0; the opposite behaviour belongs to XNOR.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
How many bits are used in the standard ASCII code?
सही उत्तर: ग) 7
Standard ASCII uses 7 bits and represents 128 characters. Extended ASCII uses 8 bits (256 characters), and Unicode uses more.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
What is the minimum number of bits needed to represent 100 different values?
सही उत्तर: ग) 7
6 bits give only 2^6 = 64 values, while 7 bits give 2^7 = 128, which is enough for 100. 8 bits would work but is not the minimum.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
The Gray code equivalent of binary 0110 is:
सही उत्तर: ग) 0101
The first Gray bit equals the first binary bit; each next Gray bit is the XOR of adjacent binary bits: 0, 0 XOR 1 = 1, 1 XOR 1 = 0, 1 XOR 0 = 1, giving 0101. In Gray code consecutive numbers differ by only one bit.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
The range of an 8-bit signed number in 2's complement form is:
सही उत्तर: घ) -128 to +127
With n bits, 2's complement represents -2^(n-1) to 2^(n-1) - 1, i.e. -128 to +127 for 8 bits. The range -127 to +127 applies to sign-magnitude and 1's complement forms.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
The 4-bit 2's complement of 0110 is:
सही उत्तर: क) 1010
Invert 0110 to get 1001 (1's complement), then add 1 to get 1010. 1001 is only the 1's complement.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
-
The binary equivalent of octal 57 is:
सही उत्तर: ग) 101111
Each octal digit converts to 3 bits: 5 = 101 and 7 = 111, giving 101111. Hexadecimal digits, by contrast, convert to 4 bits each.
💬 टिप्पणी / गल्ती रिपोर्ट (०)
यी अभ्यास प्रश्न हुन्, आधिकारिक प्रश्न होइनन्। पाठ्यक्रम, विज्ञापन र नतिजाका लागि सम्बन्धित निकायको आधिकारिक वेबसाइट हेर्नुहोस्। उत्तरमा गल्ती भेटे प्रश्नमुनिको "टिप्पणी / गल्ती रिपोर्ट" मा लेख्नुहोस्।
नमस्ते! पाठ्यक्रम, सामान्य ज्ञान, भाषा परीक्षा वा कुनै प्रश्नको उत्तर बुझ्न सोध्नुहोस्।
AI ले गल्ती गर्न सक्छ। महत्वपूर्ण कुरा आधिकारिक स्रोतमा जाँच्नुहोस्।