VUDESK
¤Virtual University Of Pakistan Network¤
CS402 Theory of Automata-final term spring 2012-dated 16 to 27 july
Replies to This Discussion
-
Permalink Reply by Yasmeen(S.admin) on -
What is the concept of the Union of FA's ?
-What does mean the LANGUAGE IS CLOSED?
-Stack consistence means that in the PDA?
-Where Null string is use the most ?
-Conversion form of PDA?
-PUSHDOWN AUTOMATON (PDA)?
-Prefixes of a language in another language?
-Consider the Context Free Grammar (CFG)
S à 0AS | 0
A à S1A | SS | 1a
Show that the word 0000100 can be generated by this CFG by showing the whole derivation starting from S ==========(5 number)
-Parsing Techniques -----------------------------------------------------(5 number)
-What are live and dead productions. ============(5 number)
Consider the Language L of strings , defined over G = {a, b}, containing double a.
The language L may be expressed by the regular expression (a+b)* (aa) (a+b)*.
A regular language:
*► Must be finite
► Must be infinite
► Can be finite or infinite
► Must be finite and cannot be infinite -
-
Permalink Reply by Yasmeen(S.admin) on
-
Past papers se hardly 2 or 3 MCQs aye thay bs.
1:Describe the POP operation and draw symbol for POP state in context of Push down stack.
2:How can we define languages elaborate any five ways.
3:Write two difference and two similarities between DFA and NFA.
-
-
Permalink Reply by Yasmeen(S.admin) on
-
oncept of unit production in CFG? [3 marks]
- there was a turning machine given from last chap n was asked which non-CFL will it generate xplain?[5 marks]
- is moore machine deterministic or not.. in either case justify ur ans
- while converting mealt to moore num of states remain same or not? justify [5]
- convertion of PDA to cfg [5]
- there was tree given and was asked using prefix and infix form solve it [5]
-
-
Permalink Reply by Yasmeen(S.admin) on
-
Question.1: A Push down Automata consists of and input TAPE with ----------many location in one direction. (Marks 2)
Question.2: Consider the language L which is EVEN-EVEN, defined over Σ = {a,b}. In how many classes does L may partition Σ*. Explain briefly.(MArks 3)
Q.3: What does mean the LANGUAGE IS CLOSED?(MArks 3)
Q.4:Consider the Context Free Grammar (CFG)
S à 0AS | 0
A à S1A | SS | 1a
Show that the word 0000100 can be generated by this CFG by showing the whole derivation starting from S (5 number)Q5: aik NFA tha us ko FA mei convert karna tha (marks 3)
Q6: Is automata a programming subject or theoratical? (marks 3)
Q7: If two FA have no final state how the intersection of those FA will have final state? (marks 2)
Q:8 give RE for EVEN - EVEN language. (Marks 2)
-
-
Permalink Reply by Yasmeen(S.admin) on
-
Q1: write down
the alternative name of browser base form? 2 marks
Q2: Different
classification of indexes? 2 Marks
Q3: List down
any two problems which may come up if the concurrency is not controlled
properly? 2 marks
Q4: In three
schema architecture, External schema is responsible for data storage on hard
disk. Correct and justify it. 3 marks
Q5: Create view
named “Product_list” on product table which will show all the columns? 3 marks
Q6: Describe
the importance of Data link properties tool in designing form by using MS
Access? 3 marks
Q7: In recovery
procedure, transaction ended before the check points are redone. Correct it and
justify? 3 marks
Q8: Draw cross
Reference matrix? 5 marks diagram was given
Q9: Deadlock is
a serious threat for the concurrent transaction; shortly explain the approach
which is used to detect the deadlock by DBMS? 5 marks
Q10: Rehashing
is better than chaining in term of time. (Rehashing and chaining collision
resolution technique in hashing). Justify it ? 5 Marks -
Super Active Members
=======================
Popular Social Events
=======================
+ Miss VU
+ Mr VU
---------------------------------------
௵ MR VU,S
௵ ADMINS
ʭ☀Administration☀ʭ
Senior Admin : Yasmeen
VUDESK Owner : Ismail Shah
VUDESK GROUPS
© 2013 Created by ʭIsmail Shahʭ.
Become a Fan.
Follow Us On Twitter.
Subscribe To RSS.
Contact Us.