UGC NET CS 2016 Aug – II

Question 1

The extent to which a software performs its intended functions without failures, is termed as

• Robustness
• Correctness
• Reliability
• Accuracy

Question 2

For a program of k variables, boundary value analysis yields ______ test cases.

• 4k – 1
• 4k
• 4k + 1
• 2^k – 1

Question 3

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

• q
• p ∧ r
• p ∨ q
• p

Question 4

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 pgiven 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 5

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 6

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

• 1/64
• 1/32
• 1/8
• 1/4

Question 7

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

• G₁ contains Euler circuit and G₂ does not contain Euler circuit.
• G₁ does not contain Euler circuit and G₂ contains Euler circuit.
• Both G₁ and G₂ do not contain Euler circuit.
• Both G₁ and G₂ contain Euler circuit.

Question 8

The octal number 326.4 is equivalent to

• (214.2)₁₀ and (D6.8)₎₁₆
• (212.5)₁₀ and (D6.8)₎₁₆
• (214.5)₁₀ and (D6.8)₎₁₆
• (214.5)₁₀ and (D6.4)₎₁₆

Question 9

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 10

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

• AB + CD + A`B + AD
• AB + AC + AD + BCD
• AB + AD + BC + ACD
• AB + AC + BC + BCD