BCS2143 THEORY OF COMPUTER SCIENCE GRADE(tertakluk pada mesyuarat senat)

No.	Matric No.	Course	Quiz(10)	Asgmt(30)	Test(20)	Gred
1	09B04002	BCBM	0.0	0.0	0.0	F
2	09B04003	BCBM	9.2	27.0	13.6	A-
3	09B04004	BCBM	6.7	27.0	13.2	A-
4	09B04005	BCBM	8.3	24.6	3.6	C
5	09B04006	BCBM	9.2	25.8	15.2	A-
6	09B04008	BCBM	9.2	26.4	15.2	A
7	10B04023	BCBM	9.2	15.6	10.8	C
8	10B04035	BCBM	9.2	15.6	12.0	C
9	10B04037	BCBM	9.2	15.6	12.8	C+
10	10B04044	BCBM	7.5	15.6	10.8	B-
11	10B04757	BCBM	9.2	15.6	12.4	C+

BCS2143 TEST 1 SOLUTIONS

jawapan untuk test 1 "Theory of Computer Science". Sila klik di sini.

http://nazri.webng.com/BCS2143/Mid_Term_BCS2143_SOLUTION.docx

updated on 28/11/2010 3:47 pm

BCS2143 Theory Of Computer Science

ASSIGNMENT 3

1 What is DECIDABILITY?

2 Give a proof of the following theorem:-

a) A DFA is a decidable language.

b) ANFA is a decidable language.

c) A REX is a decidable language.

d) E DFA is a decidable language.

e) Every context-free language is decidable. (refer to sipser page 172)

3. Draw a figure to describe the relationship among the four main classes of languages that we have described so far: regular, context free, decid-able, and Turing-recognizable. (refer to sipser page 173)

4. Answer all parts for the following DFA M and give reasons for your answers.


5. Let A ={| M is a DFA which doesn't accept any string containing an odd number of 1s}. Show that A is decidable.

BCS2143 Nota CFG

Nota bagi CFG boleh di dapati dari link ini.

BCS2143 Nota Regular Languages

Nota bagi Regular Languages boleh di dapati dari link ini.

BCS2143 Theory Of Computer Science

link lesson plan