Skip to main content

Logic Gate

  1. Not Gate: 
Not gate kisi bhi value ko change kr deta hai


Question: Explain the operation of a NOT gate in digital logic. Provide a truth table for a NOT gate and explain how it inverts the input signal.
Ans: "NOT gate digital logic mein ek aisa gate hai jo ek input signal ko ulta (inverse) karta hai. Iska kaam ek single input signal ko lekar use opposite output signal generate karna hota hai. NOT gate ka truth table niche diya gaya hai:

Input (A)             Output (Y)
0                             1
1                             0
Is truth table se dikhaya gaya hai ki NOT gate input signal ko ulta karke output signal deta hai. Agar input 0 hota hai, to output 1 hota hai, aur agar input 1 hota hai, to output 0 hota hai. Yani, NOT gate ek signal ko reverse karta hai."

2.    Or Gate
A+b = y Ka Expression Or gate hota hai.


3. AND Gate  -----------
Ans: Agar zero hoti hai dono me se koi v value to return 0 hoga aur agr dono 1 and  1 hota hai to output 1 deta hai.


4.Nor Gate
Ans: NOR GATE ek universale gates hote hai

Agar both input 0 hai to 1 dega otherwise 0 output dega




Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

Block vs Inline Elements In HTML

  Block: Block element always start in New Line  Block element always start in new line occupy complete width available  Example: h2, p, div Inline Element: They do not start in new line occuply width as much required  Example: img, anchor a,span There are no different between div and span, only difference is div is block element and span is Inline, it will help you to group your content or elements
Post a Comment
Read more

Time Complexity

What is time complexity ? Ans: Time complexity not a run time of a code, its totally depends on system configuration, processor, server , input size will increase time complexity. Time complexity ko likhne ke tarike jo hote hai use notation kehte hai. Notation is basically symbol NOTATION OF COMPLEXITY Best Case: kam se kam time me chla gya code best case hota hai Ω (Omega) Ω(1) se likhte hai Average Case: Ek average time jisme code chle  Θ(n+1)/2 Worst Case: Worst case ka mtlb kuch bhi ho jaye is time ko ye exceed nhi kregea O(n) Nested Loop me Time Complexity multiply hoti hai aur n^2 banti hai Wahi Do different loops me N+M hoti hai jisme jiski sabse bdi value hai wo big of O me jati hai O(1) - Constant Time: Operations that take a constant amount of time, regardless of the size of the input data. O(log n) - Logarithmic Time: Algorithms that have a logarithmic time complexity, often seen in binary search or certain tree-based algorithms. This is best time Complexity this i...
Post a Comment
Read more

Find Unique Number in Array Java , XOR

 Question:  WAP to find unique number in Array Java package aRray ; import java . util .*; public class practicalArray { public static void main ( String [] args ) { Scanner scan = new Scanner ( System . in ) ; // Step 1: Input size of the array from the user int size = scan . nextInt () ; // Step 2: Create an integer array of the specified size int [] arr = new int [ size ] ; // Step 3: Initialize 'res' with the first element of the array int res = arr [ 0 ] ; // Step 4: Loop to read array elements and find the unique number for ( int i = 1 ; i < size ; i ++ ) { // Read an integer from the user and store it in the array arr [ i ] = scan . nextInt () ; // Step 5: Use XOR (^) operation to find the unique number res = res ^ arr [ i ] ; } // Step 6: Print the unique number System . out . print...
Post a Comment
Read more