Computational Techniques Syllabus

Sangam University

B.Tech. Computer Science Engineering

Syllabus

BTCS601: AUTOMATA THEORY AND LOGICAutomata: Introduction: alphabets, Strings and Languages; automata and Grammars Finite automata (FA) -its behavior; DFA -Formal definition, simplified notations (state transition diagram, transition table), Language of a DFA. NFA -Formal definition, Language of an NFA, Removing, epsilon-transitions. Equivalence of DFAs and NFAs.

Regular Expressions and Languages : Regular Expression FA and Regular ExpressionsProving languages not to be regularClosure properties of regular languages Equivalence and minimization of Automata.Context-Free Grammars and Languages : Context-Free Grammar (CFG) Parse Trees Ambiguity in grammars and languages Definition of the Pushdown automata Languages of a Pushdown Automata Equivalence of Pushdown automata and CFG Deterministic Pushdown Automata.Properties Of Context-Free Languages : Normal forms for CFG Pumping Lemma for CFL Closure Properties of CFL Turing Machines Programming Techniques for TM.

Undecidabality: A language that is not Recursively Enumerable (RE) An undecidable problem that is RE The classes P and NP. Notion of tractability/feasibility. The classes NP and co-NP, their importance. Polynomial time many-one reduction. NP-complete problems from other domains: graphs (clique, vertex cover, independent sets, Hamiltonian cycle), number problem (partition), set cover.

Text Books:1. J.E. Hopcroft, R. Motwani and J.D. Ullman, Introduction to Automata Theory,Languages and Computations, second Edition, Pearson Education, 2007.

Refrences:1. H.R. Lewis and C.H. Papadimitriou, Elements of the theory of Computation,Second Edition, Pearson Education, 2003.2. Thomas A. Sudkamp, An Introduction to the Theory of Computer Science,Languages and Machines, Third Edition, Pearson Education, 2007.3. Raymond Greenlaw an H.James Hoover, Fundamentals of Theory ofComputation, Principles and Practice, Morgan Kaufmann Publishers, 1998.4. Micheal Sipser, Introduction of the Theory and Computation, ThomsonBrokecole, 1997.5. J. Martin, Introduction to Languages and the Theory of computationThird Edition, Tata Mc Graw Hill, 2007 .BTCS602:DESIGN & ANALYSIS OF ALGORITHMSIntroduction to Algorithm Design: Design of algorithms; analysis of algorithms - space and time complexity; asymptotic notations big oh notation (O), big omega notation (), big theta notation (), little oh notation (o), little omega notation (); Recurrences substitution method, recursion-tree method, master method; elementary data structures stack, queue, linked list, trees; amortized analysis aggregate analysis, accounting method, potential method.Advanced Design and Analysis Techniques: Divide and Conquer Approach: elements of divide and conquer approach - binary search, merge sort, quick sort, strassens matrix multiplication.

Greedy approach: elements of greedy approach - knapsack problem (0/1 & fractional), travelling salesman problem, huffman codes, minimum spanning trees kruskals & prims minimum spanning tree algorithm.

Dynamic programming: elements of dynamic programming matrix-chain multiplication, longest common subsequence, 0/1 knapsack problem.

Advanced Design and Analysis Techniques: Branch & bound: introduction to branch and bound approach travelling salesperson problem, 0/1 knapsack problem.

Backtracking: introduction 8 queens problem, subset-sum problem, Hamiltonian circuit problem.NP-Completeness: Classification of problems; the class P; the class NP; NP-hard and NP-completeness; NP complete problems CNF-SAT and 3SAT, vertex-cover, clique and set-cover.Miscellaneous:Shortest path algorithms; Pattern matching; flow networks; assignment problem; randomized algorithms; Parallel Algorithms.Suggested Readings:

1. Introduction to Algorithms, By Thomas H. Cormen

2. Design & Analysis of Algorithms By Mukesh Gupta & Neetu Agarwal

3. The design & analysis of algorithms, By Nitin Upadhyay

BTCS603:Cryptography and Network SecurityIntroduction to security attacks Services and mechanism, introduction to cryptography Conventional Encryption: Conventional encryption model Classical encryption techniques- substitution and transposition ciphers Cryptanalysis and Stereography Stream Cipher and Block Ciphers Modern Block Ciphers: Block ciphers principals, Shannons theory of confusion and diffusion.

Fiestal structure, data encryption standard (DES), strength of DES, differential and linear crypt analysis of DES, block cipher modes of operations, triple DES IDEA encryption and decryption, strength of IDEA, confidentiality using conventional encryption, traffic confidentiality, key distribution, random number generation.

Introduction to graph, ring and field, prime and relative prime numbers, modular arithmetic, Fermats and Eulers theorem, primality testing, Euclids Algorithm Chinese Remainder theorem, discrete logarithms Principals of public key crypto systems

RSA algorithm, security of RSA, key management Diffle-Hellman key exchange algorithm Message Authentication and Hash Function: Authentication requirements, authentication functions, message authentication code hash functions, birthday attacks, security of hash functions and MACS, MD5 message digest algorithm Secure hash algorithm (SHA).

BTCS604:Computer Graphics and Multimedia SystemComputer Graphics Overview: Introduction to Computer graphics, Graphics system configuration, Uses of computer graphics, Introduction to Raster scan display, refresh cathode ray tubes, storage tube display, Colour CRT monitors: shadow mask methods, Beam penetration Method.Scan Conversion: Scan conversion: Introduction, Line: Digital differential analyzer (DDA) algorithm, Bresenhams Line algorithm, Circle: Midpoint circle algorithm, Ellipse: Midpoint ellipse generation method.

Geometric Transformation and Clipping Technique: Homogeneous Co-ordinates, Translation, Rotation, Scaling, Reflection, Inverse transformation, Shearing, Composite transformation.Clipping: point clipping, Cohen Sutherland line clipping, Sutherland hodgman polygon clipping algorithm. Visible Surface Detection and illumination model : Introduction to visible surface detection, Visible surface detection methods: Backface Culling, Depth buffer (Z-buffer), Area subdivision algorithm; Illumination: Ambient reflection, diffuse reflection and specular reflection model, Color models like RGB, YIQ, CMY, HSV.Multimedia And Animation Technique : Multimedia : Introduction , Features of multimedia, Components of multimedia system , application , Image file formats , Multimedia sound format ; Animation : Introduction , steps in generation of animation , Animation techniques.

Text Books:

1. Hearn and Baker: Computer Graphics, PHI

2. Multimedia Systems Design, Prabhat Andleigh and Thakkar, PHI.

Reference Books:

3. J. Foley, A. Van Dam, S. Feiner, J. Hughes: Computer Graphics- Principles and Practice,Pearson

4. Multimedia Information Networking, N.K.Sharda, PHI..

BTCS605:DATA MININIG AND WAREHOUSINGOverview: Motivation(for Data Mining),Data Mining-Definition & Functionalities, Data Processing, Form of Data Preprocessing, Data Cleaning: Missing Values, Noisy Data, (Binning, Clustering, Regression, Computer and Human inspection), Inconsistent Data, Data Integration and Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality reduction, Data Compression, Numerosity Reduction, Clustering, Discretization and Concept hierarchy generation.Concept Description: Definition, Data Generalization, Analytical Characterization, Analysis of attribute relevance, Mining Class comparisons, Statistical measures in large Databases. Measuring Central Tendency, Measuring Dispersion of Data, Graph Displays of Basic Statistical class Description, Mining Association Rules in Large Databases, Association rule mining, mining Single-Dimensional Boolean Association rules from Transactional Databases Apriori Algorithm, Mining Multilevel.Association rules from Transaction Databases and Mining Multi- Dimensional Association rules from Relational Databases.

What is Classification & Prediction: Issues regarding Classification and prediction, Decision tree, Bayesian Classification, Classification by Back propagation, Multilayer feed-forward Neural Network, Back propagation Algorithm, Classification methods K-nearest neighbor classifiers, Genetic Algorithm. Cluster Analysis: Data types in cluster analysis, Categories of clustering methods, Partitioning methods. Hierarchical Clustering- CURE and Chameleon. Density Based Methods-DBSCAN, OPTICS. Grid Based Methods- STING, CLIQUE. Model Based Method Statistical Approach, Neural Network approach, Outlier Analysis

Data Warehousing: Overview, Definition, Delivery Process, Difference between Database System and Data Warehouse, Multi Dimensional Data Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept hierarchy, Process Architecture, 3 Tier Architecture, Data Marting.

Aggregation, Historical information: Query Facility, OLAP function and Tools. OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery, Tuning Data Warehouse, Testing Data Warehouse.

Text Book:1. Han, Kamber, Data Mining Concepts and Techniques, Morgan KaufmannReference Books

1. Ralph Kimball, The Data Warehouse Lifecycle toolkit, John Wiley.

2. M Berry and G. Linoff, Mastering Data Mining, John Wiley.

W.H. Inmon, Building the Data Warehouses, Wiley Dreamtech

BTCS606:Compiler DesignIntroduction to Complier And Lexical Analysis phase: Compiler, Translator, Interpreter, analysis-synthesis model of compilation Phase of compiler Introduction to one pass & Multi pass compilers, Bootstrapping, Lexical analysis: interface with input, parser and symbol table Input buffering, token, lexeme and patterns. Recognition of tokens, Difficulties in lexical analysis. Error reporting. Implementation. Regular definition, Transition diagrams, LEX.Syntax Analysis : Review of CFG Ambiguity of grammars, Introduction to parsing. Bottom up parsing techniques Shift reduce parsing, Operator precedence parsing, Recursive descent parsing predictive parsers. LL grammars & passers error handling of LL parser LR parsers Top down parsing techniques Construction of SLR, Conical LR, LALR parsing tables, Parsing with ambiguous grammar. Introduction of automatic parser generator: YACC error handling in LR parsers.

Syntax Directed Definition & Type Checking : Syntax directed definitions, Construction of syntax trees, L-attributed definitions, Top down translation Specification of a type checker, Intermediate code forms using postfix notation.Three address code Representing TAC using triples and quadruples, Translation of assignment statement. Boolean expression and control structures.Intermediate Code Generation : Storage organization, Storage allocation, Strategies Activation records, Accessing local and non-local names in a block structured language, Parameters passing Symbol table organization.Data structures used in symbol tables. Definition of basic block Control flow graphs, DAG representation of basic block Advantages of DAG, Optimization Technique Sources of optimization, Loop optimization, Idea about global data flow analysis, Code generation and instruction section : Loop invariant computation, Peephole optimization, Issues in design of code generator, a simple code generator, Code generation from DAG.