# UGC NET Paper II (28 Aug 2016) Part 1

This quiz consists of the UGC NET questions of paper 2 of Computer Science and Applications conducted on 28 Aug 2016. This quiz is helpful for aspiring candidates of UGC NET and other competitive exams.

Congratulations - you have completed .

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1 |

The Boolean function

**[~ (~p∧q)∧~(~p∧~q)]∨(p∧r)**is equal to the Boolean function :q | |

p ∧ r | |

p ∨ q | |

p |

Question 2 |

Let us assume that you construct ordered tree to represent the compound proposition

**(~ (p∧q)) ↔ (~ p ∨ ~ q)**. Then, the prefix expression and post-fix expression determined using this ordered tree are given as ____ and _____ respectively.↔~∧pq∨ ~ ~ pq, pq∧~p~q~∨↔ | |

↔~∧pq∨ ~ p~q, pq∧~p~q~∨↔
| |

↔~∧pq∨ ~ ~ pq, pq∧~p~~q∨↔ | |

↔~∧pq∨ ~ p~ q, pq∧~p~ ~q∨↔ |

Question 3 |

Let

**A**and**B**be sets in a finite universal set**U**. Given the following :**|A – B|, |A ⊕ B|, |A| + |B|**and**|A ∪ B|**Which of the following is in order of increasing size ?|A – B| < |A ⊕ B| < |A| + |B| < |A ∪ B| | |

|A ⊕ B| < |A – B| < |A ∪ B| < |A| + |B| | |

|A ⊕ B| < |A| + |B| < |A – B| < |A ∪ B| | |

|A – B| < |A ⊕ B| < |A ∪ B| < |A| + |B| |

Question 4 |

What is the probability that a randomly selected bit string of length

**10**is a palindrome ?\(\frac{1}{64}\) | |

\(\frac{1}{32}\) | |

\(\frac{1}{8}\) | |

\(\frac{1}{4}\) |

Question 5 |

Given the following graphs:
Which of the following is correct?

\(G_1\) contains Euler circuit and \(G_2\) does not contain Euler circuit. | |

\(G_1\) does not contain Euler circuit and \(G_2\) contains Euler circuit. | |

Both \(G_1\) and \(G_2\) do not contain Euler circuit. | |

Both \(G_1\) and \(G_2\) contain Euler circuit. |

Question 6 |

The octal number \(326.4\) is equivalent to

\((214.2)_{10}\) and \((D6.8)_{16}\) | |

\((212.5)_{10}\) and \((D6.8)_{16}\) | |

\((214.5)_{10}\) and \((D6.8)_{16}\) | |

\((214.2)_{10}\) and \((D6.4)_{16}\) |

Question 7 |

Which of the following is the most efficient to perform arithmetic operations on the numbers?

Sign-magnitude | |

1’s complement | |

2’s complement | |

9’s complement |

Question 8 |

The Karnaugh map for a Boolean function is given as
The simplified Boolean equation for the above Karnaugh Map is

\(AB + CD + A\overline B + AD \) | |

\(AB + AC + AD + BCD\) | |

\(AB + AD + BC + ACD \) | |

\(AB + AC + BC + BCD\) |

Question 9 |

Which of the following logic operations is performed by the following given combinational circuit?

EXCLUSIVE-OR | |

EXCLUSIVE-NOR | |

NAND | |

NOR |

Question 10 |

Match the following:

**List – I**

**a. Controlled Inverter**

**b. Full adder**

**c. Half adder**

**d. Binary adder**

**List – II**

**i.**a circuit that can add 3 bits

**ii.**a circuit that can add two binary numbers

**iii.**a circuit that transmits a binary word or its 1’s complement

**iv.**a logic circuit that adds 2 bits

a - iii, b - ii, c - iv, d - i | |

a - ii, b - iv, c - i, d - iii | |

a - iii, b - iv, c - i, d - ii | |

a - iii, b - i, c - iv, d - ii |

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.

There are 10 questions to complete.

Part 2 Part 3 Part 4 Part 5