Scribd
Upload
31 views

FLAT notes

complete short notes

Uploaded by

sam.cargodecode
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

FLAT notes

complete short notes

Uploaded by

sam.cargodecode
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1. “Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F. Korth, S.

Sudarshan, McGraw-Hill.

Reference Books:

1. “Principles of Database and Knowledge–Base Systems”, Vol1 by J. D. Ullman,


Computer Science Press.
2. “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S. Navathe, Pearson
Education.
3. “Foundations of Databases”, Reprint by Serge Abiteboul, Richard Hull, Victor Vianu,
Addison-Wesley.

----------------------------------------------------------------------------------------------------------------

Course Code: BTCS502-18 Course Title: Formal Language & 3L:1T:0P 3Credits 42 Hours
Automata Theory

Detailed Contents

Module 1: Introduction
Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of
languages. [3hrs] (CO1 )
Module 2: Regular languages and finite automata:
Regular expressions and languages, deterministic finite automata (DFA) and equivalence with
regular expressions, nondeterministic finite automata (NFA) and equivalence with DFA, regular
grammars and equivalence with finite automata, properties of regular languages, pumping lemma
for regular languages, minimization of finite automata. [8hrs] (CO2 )
Module 3: Context-free languages and pushdown automata
Context-free grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms,
nondeterministic pushdown automata (PDA) and equivalence with CFG, parse trees, ambiguity
in CFG, pumping lemma for context-free languages, deterministic pushdown automata, closure
properties of CFLs. [8hrs] (CO3 )
Module 4: Context-sensitive languages
Context-sensitive grammars (CSG) and languages, linear bounded automata and equivalence
with CSG. [5hrs] (CO4 )
Module 5: Turing machines
The basic model for Turing machines (TM), Turing recognizable (recursively enumerable) and
Turing-decidable (recursive) languages and their closure properties, variants of Turing machines,
nondeterministic TMs and equivalence with deterministic TMs, unrestricted grammars and
equivalence with Turing machines, TMs as enumerators. [8hrs] (CO 5 )

Module 6: Undecidability & Intractablity:


Church-Turing thesis, universal Turing machine, the universal and diagonalization languages,
reduction between languages and Rice s theorem, undecidable problems about languages.
Intractablity: Notion of tractability/feasibility. The classes NP and co-NP, their importance.
Polynomial time many-one reduction. Completeness under this reduction. Cook-Levin theorem:
NP-completeness of propositional satisfiability, other variants of satisfiability. NP-complete
problems from other domains: graphs (clique, vertex cover, independent sets, Hamiltonian
cycle), number problem (partition), set cover [12hrs] (CO5 )
Course Outcomes: The student will be able to:
CO1: Write a formal notation for strings, languages and machines.

CO2: Design finite automata to accept a set of strings of a language.

CO3: Design context free grammars to generate strings of context free language .

CO4: Determine equivalence of languages accepted by Push Down Automata and languages
generated by context free grammars

CO5: Distinguish between computability and non-computability and Decidability and


undecidability.

Text Books:

1. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata


Theory, Languages, and Computation, Pearson Education Asia.
Reference Books:
1. Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation,
Pearson Education Asia.
2. Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer
Science, Springer.
3. Michael Sipser, Introduction to the Theory of Computation, PWS Publishing.
4. John Martin, Introduction to Languages and The Theory of Computation, Tata McGraw
Hill.

----------------------------------------------------------------------------------------------------------------

Course Code: BTCS503-18 Course Title: Software Engineering 3L:1T:0P 3Credits 42 Hours

Detailed Contents:

Module 1:
Evolution and impact of Software engineering, software life cycle models: Waterfall,
prototyping, Evolutionary, and Spiral models. Feasibility study, Functional and Non-functional
requirements, Requirements gathering, Requirements analysis and specification.
[10hrs] (CO 1)
Module 2:
Basic issues in software design, modularity, cohesion, coupling and layering, function-oriented
software design: DFD and Structure chart, object modeling using UML, Object-oriented software
development, user interface design. Coding standards and Code review techniques.
[8hrs] (CO2 )

Module 3:
Fundamentals of testing, White-box, and black-box testing, Test coverage analysis and test case
design techniques, mutation testing, Static and dynamic analysis, Software reliability metrics,
reliability growth modeling. [10hrs] (CO 3)

Module 4:

You might also like