Create Search function for Binary Search Tree (BST) Recursion example developed in lab, this assignment contain 3 marks.
An optional assignment for class contains 5 marks (for compensation of marks students lost in Mid-Term) is as:
Similar to BST, structure we can create a structure to represent Digital Computer Logic Gates (Positive Input, Negative Input AND, OR. NOT and LED for result)
1. Create structure that can represent Logical Gates mentioned above.
2. Prepare a digital circuit, but using all type of gates, input and LEDs for out put.
3. Write a recursive method to compute the true/false value of LED
If any student/group produce this program they will be rewarded with 5 marks in their Mid-Term Exam score.
Good Luck!
