Exam 1 - Part 1
1 of 7
file:/C:/CSC333/Exam 1 - Part 1.htm
You are logged in as (Log out)
CSC 333 (001) Spring 2016 Automata, Grammars, and Computability
My home CSC 333 (001) Spring 2016 Exams Exam 1 - Part 1
Quiz navigation
1
2
3
4
Started on
State
5
Co
Part II CPU Scheduling (45 points)
True/False (10 points)
_F_ FCFS scheduling is preemptive scheduling.
_T _ Rate Monotonic Scheduling is a priority-scheduling algorithm.
_T _ Aging is a technique of gradually increasing the priority of processes that wai
CSC 333, Fall 2010
1
Lecture Notes: Nondeterministic Finite Automata
page 1 of 6
Nondetermistic finite automata a simple example based on string
matching
1.1
A simple example
Consider L = cfw_w over cfw_a, b | aba is a substring of w.
A simple bubble diag
Problems - Program Format
1. sub ax,ax
sub al,1
add ah,1
cbw
2. mov ax,00FFh
cbw
add ax,1
What will be the hex contents in ax after
executing all these instructions
What will be the hex contents in ax after
executing all these instructions
3. We execute:
CSC 333, Spring 2014
1
1.1
Lecture Notes: The Pumping Lemma
page 1 of 7
Informal proofs that certain languages are not regular
Im just not smart enough
Ive tried very hard and cant come up with a finite automaton or regular expression. Wrong.
Consider, fo
CSC 333, Fall 2016
Homework 5
page 1 of 1
Due Sunday, September 25 at 11:45 PM
Total points = 22
1. Prove that the language A2 = cfw_www | w cfw_a, b is not regular.
2. (+) Do Problem 1.47 on page 90. Hint: What is the complement of this language? The
pr
CSC 333, Spring 2014
1
Lecture Notes: Context-Free Grammars
page 1 of 9
A Motivating Example
Suppose we were giving a description of what a floating-point constant should look like
(what follows uses the rules of Pascal, which require there to be at least
CSC 333, Fall 2016
Homework 3
page 1 of 1
Due Sunday, September 11 at 11:45 PM
Total points = 14
In all problems calling for design of an automaton (DFA or NFA), you must document, for each
state q, the set L(q), i.e., the set of strings that will lead to
CSC 333, Fall 2016
Homework 2
page 1 of 2
Due Sunday, September 4 at 11:45 PM
Total points = 13
In all problems calling for design of a DFA, you must document, for each state q, the set L(q), i.e.,
the set of strings that will lead to q. If you dont do th
CSC 333, Fall 2016
Homework 1
page 1 of 1
Due Sunday, August 28 at 11:45 PM
Total points = 36
Please submit homework solutions electronically using the WolfWare submit mechanism at
https:/courses.ncsu.edu/csc333/
Your submissions should be pdf files gener
CSC 333 Homework Assignment 10 Sample
Solution
Due 11/25/2013 before class
November 13, 2013
Please typeset your answers.
1. [40 points] Prove that the language L1 L2 , where L1 is recursively enumerable and L2 is recursive, is recursively enumerable. You
CSC 333 Homework Assignment 9 Sample
Solution
Due 11/8/13 before class
October 29, 2013
Please typeset your answers.
1. Construct a deciding TM for the language described by the regular expression (0 + 1) that, when read left to right, give a binary repre
CSC 333 Homework Assignment 8 Sample
Solution (Corrected)
Due 10/30/2013 before class
October 17, 2013
Please typeset your answers.
1. [50 points] Construct a pushdown automaton for the language
L = cfw_03n 12n | n 1.
A:
2
0,
3
0,
0, X
0
, $
1
,
4
,
8
CSC 333 Homework Assignment 7 Sample
Solution
Due 10/25/2013 before class
October 17, 2013
Please typeset your answers.
1. Let = cfw_0, 1. In this problem, we will prove that the language
L = cfw_0k 1u0k | k 1, u
is not regular by using the Pumping Lemma
CSC 333 Homework Assignment 6 Sample
Solution
Due September 30, 2013 before class
September 20, 2013
Please begin the solution to each problem on a separate page. The
LaTeX command \newpage starts a new page. Drawing automata diagrams is
simplied by use o
CSC 333 Homework Assignment 4
Due 9/9/2013
August 30, 2013
Please begin the solution to each problem on a separate page.
The LaTeX command \newpage starts a new page.
Please typeset your answers.
1. Prove that the following function f : Z N is a bijection
Pumping Lemma for Regular Expressions
For each i0, y >0 xyp
xyizA
Pushdown Automaton (PDA)
A pushdown automaton is a 6-tuple (Q, , , q0, F), where Q, , and F are all finite sets, and o Q is the set of states o is the input alphabet o is t