<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Topics tagged with cs702]]></title><description><![CDATA[A list of topics that have been tagged with cs702]]></description><link>https://community.secnto.com//tags/cs702</link><generator>RSS for Node</generator><lastBuildDate>Mon, 08 Jun 2026 19:57:26 GMT</lastBuildDate><atom:link href="https://community.secnto.com//tags/cs702.rss" rel="self" type="application/rss+xml"/><pubDate>Invalid Date</pubDate><ttl>60</ttl><item><title><![CDATA[CS702 Assignment No 1 Solution and Discussion Fall 2020]]></title><description><![CDATA[@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) &amp; P (5)?

]]></description><link>https://community.secnto.com//topic/2099/cs702-assignment-no-1-solution-and-discussion-fall-2020</link><guid isPermaLink="true">https://community.secnto.com//topic/2099/cs702-assignment-no-1-solution-and-discussion-fall-2020</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Invalid Date</pubDate></item><item><title><![CDATA[CS702 Assignment 2 Solution and Discussion]]></title><description><![CDATA[Please share idea
]]></description><link>https://community.secnto.com//topic/1958/cs702-assignment-2-solution-and-discussion</link><guid isPermaLink="true">https://community.secnto.com//topic/1958/cs702-assignment-2-solution-and-discussion</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Invalid Date</pubDate></item><item><title><![CDATA[CS702 Assignment 1 Solution and Discussion]]></title><description><![CDATA[Q. 1 Solution:
[image: 3btyp3I.png]
Q. 2 Solution:
[image: 0rh5Zea.png]
Q. 3 Solution:
[image: Bdk9js9.png]
]]></description><link>https://community.secnto.com//topic/1318/cs702-assignment-1-solution-and-discussion</link><guid isPermaLink="true">https://community.secnto.com//topic/1318/cs702-assignment-1-solution-and-discussion</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Invalid Date</pubDate></item><item><title><![CDATA[CS702 Assignment 3 Solution and Discussion]]></title><description><![CDATA[@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].

https://www.youtube.com/watch?v=hgA4xxlVvfQ
]]></description><link>https://community.secnto.com//topic/1317/cs702-assignment-3-solution-and-discussion</link><guid isPermaLink="true">https://community.secnto.com//topic/1317/cs702-assignment-3-solution-and-discussion</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Invalid Date</pubDate></item><item><title><![CDATA[CS702 Assignment 2 Solution and Discussion]]></title><description><![CDATA[Q. 1 Solution:
[image: goNZlUs.png]
Q. 2 Solution:
[image: 7jQ4AjB.png]
Q. 3 Solution:
[image: RzBuWx2.png]
]]></description><link>https://community.secnto.com//topic/765/cs702-assignment-2-solution-and-discussion</link><guid isPermaLink="true">https://community.secnto.com//topic/765/cs702-assignment-2-solution-and-discussion</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Invalid Date</pubDate></item></channel></rss>