Enough for? It is enough to surely get 30-50 marks but that won’t get you even to an NIT unless you have some reservation. If you carefully read the below […]

Predicate logic formulas without quantifiers can be verified using derivation. But when it comes to first order logic (predicate logic with quantifiers), the simplest way is to apply logical reasoning. […]

What is the no. of distinct binary trees possible with n labeled nodes? Solution $ \frac{(2n)!} { (n+1)!}$ (Proof to be Added) What is the no. of distinct binary trees […]

It might be because of the name but many graduate students find it difficult to understand $\textsf{NP}$ problems. So, I thought of explaining them in an easy way. (When explanation […]

You must be logged in to post a comment.