Assignment – 8 Regular Language & Finite Automata

MCA Semester – IISubject: 620007 – Theory of Computation Assignment – 8Regular Language & Finite Automata 1Regular Language 2Regular Expression 3Regular Language & Regular Expression Over Σ 4Finite Automata / Finite State Machine / DFA 5Transition Table 6Types of State 7Transition Diagram 8Transition Function ( δ ) 9Extended Transition Function ( δ* ) 10String Accepted by FA 11String Rejected by FA 12Regular Language ( In Context of  FA) 13Distinguishable String With Respect To Language Note: Write all Answers with Example....

Read more »

Theory Of Computation | Assignment – Nondeterminism and Kleene’s Theorem

MCA Semester – IISubject: 620007 – Theory of ComputationAssignment – 9Nondeterminism and Kleene’s Theorem 1Nondeterministic Finite Automata 2Non-Recursive Definition of δ* for an NFA 3Recursive Definition of  δ* for an NFA 4Acceptance by an NFA 5NFA with Λ – Transition (NFA–Λ) 6Non-Recursive Definition of δ* for an NFA – Λ 7Λ – Closure of a Set of States 8Recursive Definition of  δ* for an NFA – Λ 9Statement & Application of Kleene’s Theorem - I 10Statement & Application of Kleene’s Theorem - II 11Relationship Between DFA and NFA 12DFA Vs. NFA Note: Write all Answers with Example....

Read more »

Theory Of Computation | Assignment –Context Free Grammars

MCA Semester – IISubject: 620007 – Theory of ComputationAssignment – 11 Context Free Grammars 1Context Free Grammar ( CFG) 2Context Free Language (CFL) 3List out Applications of  Context Free Grammar ( CFG) 4What is Meaning of Context Free? 5Regular Grammar 6Linear Grammar 7Leftmost Derivation 8Rightmost Derivation 9What is Derivation Tree or Parse Tree? 10An Ambiguous Grammar 11Balanced Strings of Parentheses 12Nullable Variables 13Unit Production 14Chomsky Normal Form (CNF) 15Inherently Ambiguous 16List out Steps to Convert CFG into CNF...

Read more »

Example of Finite Automata

MCA Semester - IISubject: 620007 - Theory of ComputationUnit - IIImportant QuestionDFA for Language L1 and L2 are given as followFigure – I: DFA for Language L1Figure – II: DFA for Language L2       Find out. (a) L1 U L2, (b) L1 ∩ L2, (c) L1 – L2Step-ICommon Diagram For All three Question(a)   L1 U L2-         In Figure - I ‘C’ is Final State and In Figure -II ‘Z’ is Final State, So All the State Containing Either ‘C’ or ‘Z’ becomes a Final State.-         So, CY, AZ, BZ, and CZ become Final State.Now, We can simplify the above figure as per follow.    Final DFA which accept L1 U L2(b)   L1 ∩ L2- In...

Read more »

GTU MCA 3rd SEMESTER | SOOADM ASSIGNEMENTS

Department of MCASemester – III(1) What is System? Explain the types of System in brief. (2) List and briefly define the seven phases of the systems development life cycle. (3) Discuss the Roles & Qualities of System Analysts. (4) Give the Differences: (a) OAS vs. KWS (b) MIS vs. DSS (c) CSCWS vs. GDSS (5) List the reasons for adopting CASE tools. (6) List advantages of using Code Generation tools. (7) List the advantages of using system analysis and design techniques. (8) Discuss integrating technologies for syste...

Read more »

Structured & Object Oriented Analysis & Design Methodology

Assignment – III1. List advantages of using data flow approaches.2. What is the difference between Logical DFD and Physical DFD?3. Define Following terms    (a) Event Response Table    (b) Trigger    (c) Base Element    (d) Derived Element    (e) Primitive Process4. What is partitioning? List reasons for partitioning DFD.5. Define the terms    (a) Data Dictionary    (b) Metadata    (c) Data Repository    (d) DTD6. List need for understanding the Data Dictionary.7. Explain with Example   (a) Structured English   (b) Decision Table   (c) Decision Tree8. Define Process Specification. List reasons for producing it.9. What is horizontal...

Read more »

Quick Review Transaction ProcessingConcurrency ControlDatabase Backup and RecoveryDatabase Secur...

Read more »

system software material | question bank | SS Importatnt Questions

Unit 1 :- Introduction to System Software and Software Tools Chapter 1 :-  Language Processors Define the following terms. Program Software application software system software Application domain execution domain semantics semantic gap PL Domain specification gap execution gap, Language Processor Language Processing Source Program Target Program Source Language Target Language Language Translator Detranslator Preprocessor Language Migrator Interpreter Problem Oriented Languages Procedure Oriented Languages Lexical rules syntax rules semantic rules Forward Reference Language Processor Pass Intermediate Representation of Programs Formal Language Alphabet Terminal Symbol Meta Symbol String, Length Null...

Read more »

DBMS - II ASSIGNMENT | Assignment Database Backup and Recovery

M.C.A. Semester - II620006 – Databse Management System - IIAssignment – 3 (Database Backup and Recovery)------------------------------------------------------------------------------------------------------------ Q-1. Explain the Following Questions in detail. 1). What is Database Backup? Why backup is needed? Explain Types of Database Backup?2). Discuss different types of database failures that may occur in database environment?3). What is Recovery? Explain types of Recovery? (Forward and Backward Recovery)4). What is Log Based Recovery? Explain all Log based Recovery technique with Example?5). What is Checkpoint? How is checkpoint information is used in recovery operation following System crash explain with example?6). Describe Shadow Paging...

Read more »

FOP MATERIAL | 100 - C language programms

‘C’ LANGUAGE PROGRAMMING PART             PROG – 1   SIMPLE PROG TO DISPLAY YOUR NAME.             #inlcude<stdio.h>            #include<conio.h>            void main(){                                  printf(“my name is chetan”);            getch();}         ...

Read more »