Skip to main content

CS607 Assignment No.1 Solution

Image
By


Question No. 1
Given the following graphs convert it into tree data structure.
A)    In the following graph consider node 1 as your starting point


B) In the following graph consider node a as your starting point.





Question No. 2

Consider the search space below, where S is the start node and H is goal node. Show with the sequence of diagrams along with table displaying how does BFS work on given tree using simple search algorithm.


Labels:

Comments

Post a Comment

Popular posts from this blog

IT Intern (Microsoft Product)

By
For more discuss and ask question join this group   https://www.facebook.com/groups/143792885956764/ Solved   By : Tahir Siddiqui(Mani) BC-140201235@Vu.edu.pk Job Description We offer Internship in IT 03 months Unpaid internship Responsible for Managing IT Products/Services. Maintains relationships with clients by providing support, information, and guidance. Good presentation skills. Good oral & written communication knowledge of MS Office 50%. Traveling Required Team Work Candidate must have a Motor Bike and laptop. Fresh candidates are encouraged to apply. Job Details Industry: Information Technology ...
5 comments
Read more

cs302 Solved Quiz

By
estion # 1 of 10 ( Start time: 03:03:55 PM )  Total Marks: 1    Divide-by-32 counter can be acheived by using   Select correct option:   Flip-Flop and DIV 10  Flip-Flop and DIV 16   Flip-Flop and DIV 32  DIV 16 and DIV 32 Question # 2 of 10 ( Start time: 03:05:20 PM )  Total Marks: 1   The counter states or the range of numbers of a counter is determined by the formula. (“n” represents the total number of flip-flops)   Select correct option:   (n raise to power 2)  (n raise to power 2 and then minus 1)  (2 raise to power n) (2 raise to power n and then minus 1) Question # 3 of 10 ( Start time: 03:06:36 PM )  Total Marks: 1   A 4- bit UP/DOWN counter is in DOWN mode and in the 1010 state. on the next clock pulse, to what state does the counter go?   Select correct option:   1001  1011  0011  1100 Question # 4 of 10 ( Start time: 03:07:37 PM )  Tot...
Post a Comment
Read more