Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.
Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).
@Ramish-Khan said in CS702 Assignment No 1 Solution and Discussion Fall 2020:
Let P(x) denotes the statement x≥5. What will be the truth values of P (1) & P (5)?
Please share idea
Q. 1 Solution: 60b3b49c-5127-40f7-85ac-49e836e4f1a2-image.png
Q. 2 Solution: 87edcad2-1517-4297-ae6e-7a2c451c3e9a-image.png
Q. 3 Solution: 59cb22fe-b9e7-4b3c-a760-2df8704addd7-image.png
@zareen said in CS702 Assignment 3 Solution and Discussion:
Determine the cost and structure of an optimal binary search tree (OBST) for a set of n = 5 keys with the probabilities given below. You need to calculate the tables e[i, j], w[i, j] and root[i, j].
Q. 1 Solution: 65d91b32-5115-4161-a370-02b954666c15-image.png
Q. 2 Solution: 37b2074f-d565-4bbd-8a16-f2a87cd4fd0d-image.png
Q. 3 Solution: 2292b8a3-024d-48e4-8dfb-0a2e5b89b11f-image.png
