George Washington University
Department of Computer Science
Csci 3313  Exam 1
90 Minutes (Closed Books)
Solution
1. (3 pts. each) State true or false for each of the following statements where r1 and r2 are regular
expressions. Justify your answers.
(a)
George Washington University
Department of Computer Science
Csci 152  Exam 3
2 Hours (Closed Books)
December 10, 2020
Solution
1. (1 pt each) Dene the following terms and concepts.
(a) ChurchTuring Thesis: Turing machine is equivalent in computing power
George Washington University
Department of Computer Science
Csci 3313  Solution to Exam 2
75 Minutes (Closed Books)
November 16, 2012
1. Consider the following grammar of simplied C declaration, where three nonterminal symbols
are declaration, type, and
CSCI 331310: Foundation of Computing
1
Overview
Foundation of Computing
 Theory of Computing
Automata theory
Computability
 solvable vs. unsolvable problems
Complexity
 computationally easy vs. hard problems
Formal language theory
Chomsky Hierarch
George Washington University
Department of Computer Science
Csci 3313  Solution to Exam 3
2 Hour (Closed Books)
December 6, 2012
1. (5 pts each) Consider the language L = cfw_an bn  n 0.
(a) Give a CFG G that generate strings in L, i.e., G generates L.
George Washington University
Department of Computer Science
Csci 3313  Exam 2
75 Minutes (Closed Books)
November 9, 2011
Solution to Exam 2
1. Consider the following grammar G.
S aS 
A XYZ
X cS 
Y dS 
Z eS
Ab

(a) (5 pts) Give a leftmost derivation