50. practice questions on translations(part 1)

📍 Telegram channel link(for NOTES and DOUBTS)
t.me/gatecsele...
📍I will cover entire 'GATE CS-IT' syllabus and make videos🎥 of each and every PYQ on youtube.
📍I am not taking even a single rupee💸 from any student👩🏻‍💻.
📍If you want to support me😀then you can donate💰any amount of money according to your wish🤞🏻.
📍UPI ID ⬇️
tinyurl.com/AK...
📚 Subject Wise Playlist 📚
📖 Pointers In C - • Pointers in C (from C ...
📖 DBMS -
• Databases (DBMS) for G...
📖 COMPUTER NETWORK (CN) -
• Computer Networks (CN)...
📖 DISCRETE MATHS -
• Discrete Mathematics f...
🔖Logic - • Logic (from Discrete M...
🔖 Combinatorics -
• Combinatorics (from Di...
🔖 Set Theory -
• Set Theory (from Discr...
🔖 Group Theory -
• Group Theory (from Dis...
🔖 Graph Theory -
• Graph Theory (from Dis...
🔖 Poset Lattice And Boolean Algebra -
• Poset Lattice and Bool...
🔖 Generating Function -
• Generating Functions (...
🔖 Discrete Probability -
• Discrete Probability (...
📖 TOC -
• Theory of Computation ...
📖 Digital Logic -
• Digital Logic for GATE...
📖 C Language -
• C Language for GATE - ...
📖 Aptitude -
• Aptitude for GATE - Co...
📋 PYQ and Solutions 📋
▶️ GATE 2020 CSE Solution -
• GATE CSE 2020 Solutions
▶️ DBMS Gate Questions -
• GATE PYQs | DBMS
▶️ CN Gate Questions -
• GATE PYQs | Computer N...
▶️ Logic Gate Questions -
• GATE PYQs | Logic
▶️ GATE 2021 SET 1 SOLUTIONS -
• GATE CSE 2021 Solutions
▶️ Combinatorics Gate Questions -
• GATE PYQs | Combinatorics
▶️ Set Theory Gate Questions -
• GATE PYQs | Set Theory
▶️ Group Theory Gate Questions -
• GATE PYQs | Group Theory
👩🏻‍🎓 TOPPERS PODCAST - • The GATE Toppers Podcast
📽️ General Videos -
• General Videos
gate cse,gate computer science,gate lectures,gate computer science lectures,amit sir,gatecse,computer science,cs,computer,air 1,top rank gate,best lectures for gate,complete lectures for gate,gate 2022,gate 2023,gate cse 2022,gate cse 2023,toc,dbms,combinatorics,discrete maths,group theory,gate cse lectures,gate cse preparation strategy,gate cse preparation
gate cse,gate computer science,gate lectures,gate computer science lectures,amit sir,gatecse,computer science,cs,computer,air 1,top rank gate,best lectures for gate,complete lectures for gate,gate 2022,gate 2023,gate cse 2022,gate cse 2023,gate cse lectures,gate cse preparation,gate cse preparation strategy,reasoning syllabus for gate,reasoning syllabus,reasoning,what is reasoning,syllabus of reasoning,free reasoning classes,reasoning gate cse

[@pushkarkumar7173]

Whenever I have a 1%doubt you immediately resolve in video.thanks for considering some common doubt

[@patelheet2080]

Sir you have changed the whole resolution of sociality in real life .. Beacause whatever we think in a real life ( or we can say intuition ) is totally different in terms of logic .. So I want to give a big round of applause to you sir ...👏👏👏👏for exposing out the actual reality in terms of logic ... Now I understand the fact of logic ....

[@karmpatel6832]

At 24:21 When you ask "Samaj rahe ho" & then immediately you answer "nai samaj paye" :)) Sometimes, I thought about how you visualize a student in front of camera & can involve in this much level !!

[@ashutoshtripathy3015]

THAT THINGS I AM ALSO THINKING A LOT. IN ONLINE WITHOUT ANY STUDENT HOW SIR IS EXPLAINING ALONE ??

[@evolve_everyday_0911]

SAMEEEEE....I legit laughed bcz I thought he read my mind

[@kanchangupta538]

he explained a lot a lot. marvellous efforts.

[@parththakor7362]

Sir you are perfect 💞....

[@atreyarao2202]

For people who have done programming there is a easier way to understand the above concept and an easier way to solve it. [Explanation will take time, but once you get the jist you will find it very easy] Assume domain as an array of objects. Now lets take 1 example : "Birds can fly", B(x): x is bird, F(X): x can fly 1) Domain: Universe, so in our array assume all objects in universe now to make the statement "Birds can fly" true how many times we need to iterate the array? Till the end right? so we use "For All X". now run a for loop and inside it you need to write an if condition representation of "Birds can fly" which returns true for "every" elements in array. This condition would be : if( B(X) && F(X) ) This condition when you run on array of all objects will return false for not a bird as well, for example 1st element was a bird but 2nd element was building, now for building it s returning false, but we dont care about other objects in universe we are only concerned with birds so I can modify if condition like this: if( (B(X) && F(X)) || !B(X)) if not bird then condition becomes true! now above condition in logic is: (B(X) ^ F(X)) V -B(X) => -B(X) + F(X) // absorption law B(X)->F(X) because we need to iterate the entire array it is "For All X" so answer is: ForAllX ( B(X)->F(X) ) 2) some birds can fly Now in an array of all objects in universe to check if " some birds can fly " should I iterate the entire array or iterate till I get a bird which can fly? iterate till I get a bird which can fly right? so we use "There exist". now right an if condition which matches this condition and "breaks" the for loop if found, as we are not worried about elements after that. if(B(X) && F(X)), // this will be true when object is bird and it can fly. so: ThereExistX ( B(X) ^ F(X)) a) For "For All X," assume you're writing a function that takes two parameters: an array and a condition. The function should return true if the condition is true for all elements in the array. b) For "There exists X," assume you're writing a function that also takes two parameters: an array and a condition. This function should return true as soon as it finds a single element that matches the condition. You only need to write condition for both 3) some birds can't fly so as you need to find only 1 bird which cant find to prove the above statement true we use "there exist X" if condition can be: if(B(X) && !F(X)) =>theirExistX B(X) ^ -F(X) 4)Not all birds can fly: I need to find one bird which cannot fly so I will use "There exist" if( B(X) && !F(X))=> "ThereExistX" (B(X) ^ -F(X)). All problems can be solved with this.

[@GateCse-2025]

mere bhai rank 1 tu hi layega..😂😂

[@Ounknown098]

Bahot hard explaination mja aa gya sir ❤❤

[@KULDEEPKUMARPRAJAPATI-lr1zp]

@46:25 since in general (A ->B)->C is equivalent to ((A and B )-> C) so, here we can also write as (for all)x[(c(x)->f(x))->d(x)] , am I correct @GATE CSE LECTURES BY AMIT KHURANA, sir??

[@Rohan219Chavan]

Isn't "All birds can't fly" same as "Birds can't fly" ? I m stating the statement based on the predicate logic statement we got in respective cases.

[@pavansingh8089]

You can see this post may be it's help you..... kzbin.infoJLeH9rQ3L_Y?feature=share

[@aman_wild]

same doubt i have

[@vrengineers2462]

sir, your teaching is better than " RAMESH SUNDARAM ".....

[@ajaybanshkar55]

28:44 Vx(Bx-->~Fx) is it right?

[@aditiy5138]

thank u very very much sir !

[@Rohan219Chavan]

Did you appeared in GATE exam 2023? or aiming for 2024?

[@aditiy5138]

@@Rohan219Chavan I'm preparing for 2024

[@pawanchoure1289]

very nice sir.........

[@sanyasingh333]

I didn't understand the ques-1 @8:45 Sir first says that @8:47 "Birds can't fly" means "All Birds can't fly " thats why we write "for all" quantifier But he said that "Birds can't fly" is not equivalent to "All birds can't fly" if All & Every is same then why "All birds can't fly" is not equal to ques-3 @10:30 he said tha "Not every bird can fly" is same as "Not all birds can fly" because "Every" & "All" are equivalent Then why not "All birds can't fly" is not equivalent to "Every birds can't fly" ?

[@neelkapatel4410]

Hello, is your doubt clear now? i also have same doubt please reply🙏

[@pavansingh8089]

See this post may be it's help you..... kzbin.infoJLeH9rQ3L_Y?feature=share

[@aman_wild]

same doubt

[@The_hustle_]

best content ...

[@rowhitsharma410]

JUST PERFECT

[@abirchoudhury4455]

How is the statement "Not all bird can fly" and "Every bird can't fly" are equivalent. Are their logical translations equal anyhow ??

[@vayudpandey5394]

Sir aap chidiya ud me hamesha jeete honge

[@LipishaGupta]

Thank you sir

[@Ramu9119]

samaj gaye guru ji ghee kha swaad aharaha hai

[@vidhayakjpsingh2795]

2:03 sir bird can fly or birds can fly dono m For all use hoga?

[@AmitKhuranaSir]

Yes....

[@garvitmathur4270]

Sir can birds can't fly be negation of birds can fly ??

[@cfyghu]

High brow ❤❤❤❤❤❤

[@Prabhat56682]

Thank you so much sir

[@pavansingh8089]

Thanks Sir.....

[@cosmophile8218]

watch out at @8;02

[@MISHRAMANASATUL]

I hate birds

[@sushant123rocky7]

I think isme sir ne by mistake "all birds can't fly" ko "Not all birds can fly" ke sath equate kr dia hai......"all birds can't fly" and "birds can't fly" should be equal right??

[@AmitKhuranaSir]

Please watch my lecture carefully you will get your answer.... All birds can't fly and birds can't fly are not same....

[@Rohan219Chavan]

@@AmitKhuranaSir Sir with reference to 1st question and 3rd question. Isn't the 3rd statement the negation of the first. if yes, then Ax(B(x)->F(x)) ko ~[Ax (B(x)->F(x))] kar ke solve kar sakte he kya?

[@pavansingh8089]

​@@Rohan219Chavan No, 3rd statement is not the negation of 1st statement.

[@prabalsingh8181]

properties of quantifier states that (for all) --> (there exist) ..... i.e strong --> weak. so all birds can't fly --> some birds can't fly. and if some birds can't fly then not all birds can fly..... now ,,,, talking about birds can't fly it has no relation with birds can't fly....

[@lovelyfamily4886]

4/7/23