CS1013 THEORY OF COMPUTATION
UNIT IV - TURING MACHINE (9 hours) Turing Machines- Introduction – Formal definition of Turing machines – Instantaneous descriptions- Turing Machine as Acceptors – Turing Machine as Transducers Computable Languages and functions – Turing Machine constructions – Modifications of Turing Machines.
ANSHU RATHOUR
CS1013 THEORY OF COMPUTATION
UNIT III - PUSHDOWN AUTOMATA (9 hours) Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata – Equivalence of Pushdown automata and CFL - pumping lemma for CFL – problems based on pumping Lemma.
CS1013 THEORY OF COMPUTATION
UNIT II - GRAMMARS (9 hours) Grammar Introduction– Types of Grammar - Context-Free Grammars and Languages– Derivations and Languages – Ambiguity- Relationship between derivation and derivation trees – Simplification of CFG – Elimination of Useless symbols - Unit productions - Null productions – Greyback Normal form – Chomsky normal form – Problems related to CNF and GNF.
IT1004 DESIGN AND ANALYSIS OF ALGORITHMS
UNIT II-MATHEMATICAL ASPECTS AND ANALYSIS OF ALGORITHMS Mathematical analysis - asymptotic notations – Big O, Big Theta, Big Omega – comparing orders of growth - non-recursive algorithm - mathematical analysis of recursive algorithm
IT1004 DESIGN AND ANALYSIS OF ALGORITHMS
UNIT III-DIVIDE AND CONQUER Divide and conquer - Merge Sort – Quick sort – Binary search – Binary search tree traversal - Strassen’s matrix multiplication - Algorithms for the Closest-Pair and Convex-Hull Problems.
IT1004 DESIGN AND ANALYSIS OF ALGORITHMS
UNIT IV-GREEDY METHOD AND DYNAMIC PROGRAMMING Huffman Coding - Binomial Coefficients – Warshall's and Floyd's Algorithms Knapsack Problem and Memory Functions
IT1004 DESIGN AND ANALYSIS OF ALGORITHMS
UNIT V-BACKTRACKING Backtracking - 8-Queen's Problem - Hamiltonian Circuit problem - Subset-Sum problem - Travelling salesman problem
SRM CSE Sylabuss
Computer Science entire Syllabus for Btech.
BUSINESS COMMUNICATION
Types Of Business Communication and the needs.
CS1128 HIGH SPEED NETWORKS
UNIT I - HIGH-SPEED NETWORKS (9 hours) Introduction-frame relay networks –ATM protocol architecture-ATM logical connection –ATM cells-ATM service categories -AAL- high-speed LANS: the emergence of high-speed LANs-Ethernets-fiber channel-wireless LANS