We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

# GDB for CS402 submitted date 07-08-2014 to 08-08-2014.

Dear Students,

Topic of GDB is as under:

If we would require to implement chess game, what would be the suggested automata / machine from the list given below. Also provide reason(s) in 2 – 3 lines to support your choice.

1 – FA

2 – NFA

3 – TG

4 – TM

5 – Derivation Tree

Instructions:

- GDB would be available for submission for 2 days that are 07-08-2014 to 08-08-2014

- No GDB is accepted via e-mail.

- Copied comments / answers from any source are awarded as zero which results in deduction of absolute 5 marks from 100.

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

Views: 2168

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

### Replies to This Discussion

For Chess game we use FA.
because Chess game have to end. Chess game ended because of checkmate, stalemate, draw or resignation, Draws are very important here. The can happen when the position is repeated three time, there is a perpetual check, or by the 50 move rule.
so, it means that there is a finite number of moves in any chess game. Hence we can use Finite Automaton to build a chess game.

FA is right option

FA is a right option,Dear friends click this link ,i think it is very helpful

http://www.slideshare.net/carlosjustinia...s-26552933

kia confirm FA ha ans,,,,,,,,,,,,,,,

does anyone have the solution of cs402 GDB .. very less time is left :(

: GDB last 08-08-2014

NFA (nondeterministic finite automaton)
Have finite many states with one initial state and one final and there may be more than one transitions.
TG: has more than one start state ,then introduce a new start state connecting the new start state to the old state by the transition labeled by ^ and make the old start state the non-start state.
TM: A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules.
Derivation Tree: a tree start with the symbol S as its root and whose nodes are working strings of the terminals and nonterminal .
FA (finite automata) is much better the other above options in the chess game because in
FA there is a initial state and one final state.
In FA we start from one cell to others and then reach to the final state.
Same in the chess game we have one final and one initial state .
And the game move from one cell to other and then reach to destination.

Derivation Tree is a correct answer.

Because it is not programing it's theory.

FA deals with loop but Chess game don't allow loop function.

FA deals with one initial and one final but Chess game uses may initials and final any where.

## Latest Activity

1 hour ago
1 hour ago
1 hour ago
Anu updated their profile
1 hour ago
naila mukhtar joined +M.Tariq Malik's group

### MGMT630 Knowledge Management

1 hour ago
❦∬⋞ بھٹکتا مسافر ⋟∬❦ posted discussions
1 hour ago
naila mukhtar joined +M.Tariq Malik's group

### EDU602 Educational Leadership and Management

1 hour ago
Hira joined +M.Tariq Malik's group

### EDU302 Human Development and Learning

2 hours ago
2 hours ago
2 hours ago
Siddiq khan kakar liked NOORI's discussion ENG201 QUIZ 1ST 2020
2 hours ago

1

2

3