NTANET (Based on NTAUGC) Computer Science (PaperII): Questions 587  590 of 2012
Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exampattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.
Rs. 550.00 or
How to register?
Question number: 587
» Computer Arithmetic » Logic Families » Design of Combinational and Sequential Circuits
Appeared in Year: 2013
Question
Which of the following statements are true?
I. A circuit that adds two bits, producing a sum bit and a carry bit is called half adder.
II. A circuit that adds two bits, producing a sum bit and a carry bit is called full adder.
III. A circuit that adds two bits and a carry bit producing a sum bit and a carry bit is called full adder.
IV. A device that accepts the value of a Boolean variable as input and produces its complement is called an inverter. (December PaperII)
Choices
Choice (4)  Response  

a. 


b. 


c. 


d. 


Question number: 588
» Discrete Mathematics » Permutation and Combination
Appeared in Year: 2013
Question
How many people must there be in a room before there is a chance that two of them were born on the same day of the year? (September PaperIII)
Choices
Choice (4)  Response  

a.  At least 23 

b.  At least 183 

c.  At least 366 

d.  At least 730 

Question number: 589
» Computer Arithmetic » Logic Families » Design of Combinational and Sequential Circuits
Appeared in Year: 2013
Question
What type of logic circuit is represented by the figure shown below?
(September Paper II)
Choices
Choice (4)  Response  

a.  XAND 

b.  XOR 

c.  XNOR 

d.  XNAND 

Question number: 590
» Encoding Decoding Error Correction Detection » Error Correcting and Detecting Codes » Decoding of Linear Codes, Hamming Codes
Appeared in Year: 2013
Question
Hamming distance between and is (June Paper III)
Choices
Choice (4)  Response  

a.  3 

b.  4 

c.  5 

d.  6 
