CS385-Theory of Computation
First Test
October 16, 2006
1. Consider the NFA
M = (cfw_0, 1, 2, cfw_a, b, , 0, cfw_2)
dened by
(0, a) = cfw_0, 1, (0, b) = cfw_0, (1, b) = cfw_2,
and
(q, ) =
for all pairs (q, ) not explicitly listed above.
(a) Draw the st
Test
CS385-Theory of Computation
October 23, 2007
1
Consider the language L1 generated by the regular expression
a(a b) b b(a b) a.
(a) For each of the following four strings, tell whether or not the string is an element of
L1 :
ab, aba, baa, baabb.
(b) D
Test 2
CS385-Theory of Computation
November 15, 2007
There are two problems on this test, each with several partsa nite automaton problem and a context-free language problem. The usual rules applyyou should show all your
work carefully, and justify any cl
CS383 Algorithms Final Exam, Spring 2012
May 14, 2012
Instructions: This exam is open book. You can use any reference books in the exam. But no
computers are allowed. Partial credits will be given in the marking. If you do not know the
answer, give your b
CS383 Assignment Two Solution
February 20, 2012
1.
2.
3.
4.
5.
6.
7.
See the solution of (1) in the Spring 2011 solution.
Assume that x and y are both multiplicative reverse of a modulo N . Based
on the denition, we have ax 1 (mod N ) and ay 1 (mod N ). T
DATABASE II
Query Optimization
Dr. Fatma Meawad
Caroline Sabty
Query Optimization
One query can correspond to many different
query trees.
Query parser generates a standard initial query
tree to correspond to an SQL query,
without doing any optimization.
AC14/AT11
Database Management Systems
TYPICAL QUESTIONS & ANSWERS
PART -I
OBJECTIVE TYPE QUESTIONS
Each Question carries 2 marks.
Choosethe correct or the best alternative in the following:
Q.1
Which of the following relational algebra operations do not r
CSC540 (Fall 2009)
Assignment 1
Due date 9/10/2009 (at the beginning of class)
Part A Database Design
1. Consider the ER diagram shown below for part of a BANK database. Each bank can have multiple
branches, and each branch can have multiple accounts and