2021 2022 Student Forum > Management Forum > Main Forum

7th November 2014, 02:27 PM
Super Moderator
Join Date: Apr 2013
Re: IGNOU University BCA Question Papers

As you want the question paper of BCA of IGNOU University so here I am providing you

Note: Question number 1 is compulsory. Attempt any three questions from the
1. (a) What is a NP-hard problem? Explain how the NP-hardness of
the problem can be established. (6)
(b) Using parse tree show that the grammar

Use a a a as the string
S S S S S a is ambiguous
* .
→ +
(c) Describe Universal Turing Machine. (4)
(d) Find the minimum state finite automaton equivalent to the
following transition diagram:

Quick Reply
Your Username: Click here to log in


Thread Tools Search this Thread

All times are GMT +5. The time now is 12:58 AM.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3