Given,
A = x (y′ + z′)
= xy′ + xz′
To express as a complete sum-of-products, expand using all variable combinations:
= xy′(z + z′) + xz′(y + y′)
= xy′z + xy′z′ + xyz′ + xy′z′
After simplification, duplicate terms are removed:
A = xyz′ + xy′z + xy′z′
Consider the Boolean expression A(x, y, z) = x (y′ + z′). Which of the following is the complete sum-of-products form of the given Boolean expression?
Previous 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)
Nearest first
1
2
3
4
5
6
7
8
9
10
The right sequence of suboperations that are performed in arithmetic pipeline is –A. Align the mantissasB. Add or subtr…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Consider the following table about processes, their burst time and arrival time
ProcessBurst TimeArrival Time P190 P2…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Which of the following statements are true?A. In the write-through policy, only the cache is updatedB. In the write-bac…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
List I (Projection Type) List II (Description) A. Oblique Projection IV. When the angle between the projectors and th…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Consider the operators used in C programming given below:A. &&B. +=C. >>D. >=E. ?:Choose among the fol…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Which of the following are examples of data encoding schemes?A. Non-Return to Zero (NRZ)B. Manchester EncodingC. Amplit…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Consider the following DFA that generates set of strings over Σ = {a, b, c}.Identify the best description of the langua…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
The computer needs to process each instruction with the following sequence of steps:A. Calculate the effective addressB…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
int i, j;for(i = 1; i < 5; i += 2) for(j = 1; j < i; j += 2) printf("%d",…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
List I (RAID Levels) List II (Description) A. RAID Level 2 IV. Also known as Memory style error correcting code organ…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Next 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)
Ascending by ID
1
2
3
4
5
6
7
8
9
10
What shall be the average waiting time per process if we know that 10 processes (on average) arrive every second and th…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Arrange the steps involved when a user enters a URL in a browser and accesses a website.A. DNS resolutionB. HTTP reques…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Which of the following statements is correct for Pthreads?
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
In a group of 120 people:65 eat Rice, 45 eat Bread, 42 eat Curd,20 eat both Rice and Bread, 25 eat both Rice and Curd, …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
List I (Statements) List II (Logic Type) A. If the Indian team wins, then it is raining IV. Conditional B. If the I…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Consider the following statements for XML (Extensible Markup Language):A. The number of tags decreases and users can de…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Which of the following is NOT a software characteristic?
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Which of the following is not the characteristic of packet switching?
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Consider the following infix expression:
Q = ((A + B) * D) ↑ (E − F)
The equivalent postfix expression of Q is:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
The tight asymptotic bound for the recurrence:
$T(n) = 2T(n/4) + \sqrt{n}$
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
