# LMD Async Tutoring

**URL:** <https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933>\
**Category:** Tutoring\
**Created:** [April 23, 2024, 12:05am UTC](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933 "2024-04-23T00:05:39Z")\
**Posts on this page:** 1\
**Showing post:** 355

<div class="post-metadata">

**Author:** ![LMD](https://discuss.criticalfallibilism.com/user_avatar/discuss.criticalfallibilism.com/lmd/32/3213_2.png) [@LMD](https://discuss.criticalfallibilism.com/u/LMD)\
**Post date:** [July 10, 2024, 2:19am UTC](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933/355 "2024-07-10T02:19:30Z")

</div>

> [@Eternity Async Tutoring](https://discuss.criticalfallibilism.com/t/eternity-async-tutoring/1932/266):
>
> Make trees for these expressions then evaluate them using the trees.
> 
> 1&0
> 
> or(1, not(0))
> 
> (not (and (or 1 0) 0))

Here are the trees:

 ![Screenshot 2024-07-10 at 12.14.34 PM](https://discuss.criticalfallibilism.com/uploads/default/original/2X/f/f4a35398b637278d37648ea40bd847bb054623ee.png)

and my answers:

1&0 = **0**

or(1, not(0)) = **1**

(not (and (or 1 0) 0)) = **1**

Evaluating using trees was fast. It was also clearer to me what each step was and it felt like I had to be less careful.

---

_[View the full topic](https://discuss.criticalfallibilism.com/t/lmd-async-tutoring/1933)._
