5 years ago in UGC CS - December 2012

Consider the circuit shown below. In a
certain steady state, Y is at logical 'l'.
What are possible values of A, B, C ?

[A] A = 0, B = 0, C = 1
[B] A = 0, B = C = 1
[C] A = 1, B = C = 0
[D] A = B = 1, C = 1
Loading...
Next Question

Overall Stats

Attempted 12
Correct 7
Incorrect 2
Viewed 3

Answers

Guest
Guest
suguri sai bharath
suguri sai bharath - 9 months ago

suguri sai bharath is saying A = 0, B = 0, C = 1 is correct answer

Srijana Shet Yiascm
Srijana Shet Yiascm - 11 months ago

Srijana Shet Yiascm from Bengaluru, India is saying A = 0, B = 0, C = 1 is correct answer

Manish Bhatti
Manish Bhatti - 1 year ago

Manish Bhatti is saying A = B = 1, C = 1 is correct answer

Raghuveer Dhakad
Raghuveer Dhakad - 2 years ago

Raghuveer Dhakad from Delhi, India is saying A = 0, B = 0, C = 1 is correct answer

Nazia Sayed
Nazia Sayed - 2 years ago

Nazia Sayed from Mumbai, India is saying A = 0, B = 0, C = 1 is correct answer

Related Questions

The worst case time complexity of AVL tree is better in comparison to binary search tree for

  • [A] Search and Insert Operations
  • [B] Search and Delete Operations
  • [C] Insert and Delete Operations
  • [D] Search, Insert and Delete Operations

In DML, RECONNCT command cannot be used with

  • [A] OPTIONAL Set
  • [B] FIXED Set
  • [C] MANDATOR Set
  • [D] All of the above

Which of the following is true while converting CFG to LL(I) grammar ?

  • [A] Remove left recursion alone
  • [B] Factoring grammar alone
  • [C] Both of the above
  • [D] None of the above