COURSE OUTCOMES: (On successful completion the students will be able to CO1:Use MS Word to create quality documents, by structuring and organizing content for their day to day technical and academic requirements ©O2:Use MS EXCEL to perform data operations and analytics, record, retrieve data as per requirements and visualize data for ease of understanding CO3:Use MS PowerPoint to create high quality academic presentations by including common tables, charts, graphs, interlinking other elements, and using media objects cs3452 THEORY OF COMPUTATION LTPC 3003 COURSE OBJECTIVES: + Tounderstand foundations of computation including automata theory + To construct models of regular expressions and languages. ‘+ To design context free grammar and push down automata + Tounderstand Turing machines and their capability + Tounderstand Undecidability and NP class problems UNITI AUTOMATA AND REGULAR EXPRESSIONS 9 Need for automata theory - Introduction to formal proof — Finite Automata (FA) — Deterministic Finite ‘Automata (DFA) - Non-deterministic Finite Automata (NFA) ~ Equivalence between NFA and DFA — Finite Automata with Epsilon transitions — Equivalence of NFA and DFA- Equivalence of NFAs with and without e-moves- Conversion of NFA into DFA — Minimization of DFAs. UNIT REGULAR EXPRESSIONS AND LANGUAGES 9 Regular expression — Regular Languages- Equivalence of Finite Automata and regular expressions — Proving languages to be not regular (Pumping Lemma) — Closure properties of regular languages. UNIT CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA 9 Types of Grammar - Chomsky’s hierarchy of languages -Context-Free Grammar (CFG) and Languages - Derivations and Parse trees - Ambiguity in grammars and languages - Push Down Automata (PDA): Definition - Moves - Instantaneous descriptions -Languages of pushdown automata - Equivalence of pushdown automata and CFG-CFG to PDA-PDA to CFG — Deterministic. Pushdown Automata. UNITIV NORMAL FORMS AND TURING MACHINES 9 Normal forms for CFG — Simplification of CFG- Chomsky Normal Form (CNF) and Greibach Normal Form (GNF) — Pumping lemma for CFL — Closure properties of Context Free Languages —Turing Machine : Basic model — definition and representation — Instantaneous Description — Language acceptance by TM — TM as Computer of Integer functions — Programming techniques for Turing machines (subroutines). UNITV UNDECIDABILITY 9 Unsolvable Problems and Computable Functions -PCP-MPCP- Recursive and recursively enumerable languages — Properties - Universal Turing machine -Tractable and intractable problems 7- P and NP completeness — Kruskal's algorithm — Travelling Salesman Problem- 3-CNF SAT problems. COURSE OUTCOMES: At the end of this course, the students will be able to: C01: Construct automata theory using Finite Automata C02: Write regular expressions for any pattern CO3: Design context free grammar and Pushdown Automata C04: Design Turing machine for computational functions COS: Differentiate between decidable and undecidable problems TOTAL:45 PERIODS TEXT BOOKS: 1. Hopcroft J.E., Motwani R. & Ullman J.D., "Introduction to Automata Theory, Languages and Computations", 3rd Edition, Pearson Education, 2008. 2. John C Martin , "Introduction to Languages and the Theory of Computation", 4th Edition, Tata McGraw Hill, 2011. REFERENCES: 1, Harry R Lewis and Christos H Papadimitriou , "Elements of the Theory of Computation", 2nd Edition, Prentice Hall of India, 2015. 2, Peter Linz, "An Introduction to Formal Language and Automata", 6th Edition, Jones & Bartlett, 2016. 3, K.LP.Mishra and N.Chandrasekaran, “Theory of Computer Science: Automata Languages and Computation’, 3 Edition, Prentice Hall of India, 2006, CO’s-PO’s & PSO’s MAPPING [co’sPo’s S's: 71/2], 3 [4)51/6,7|,8)|9 |%,|%1),%|/1,2)|3 if 1 [3] 2 [3,-|[-]-|-{1]4 | 2)3]1[ 3/2 z 2 [2,3 [2/a[-(-|-{[3)3|/2|/3]a[1|2 2 [27 32/2] Mm -Phtt| 3t | 2] 2 1 2 a 2 [2(2 Ml-P=-|-[t)@|3i2la[312 5 2 (2| 2 [tt |-[-jesPt[1[(3 [2/3/17] 3 Wel 2 [2,2 [2}7[-[-[-[1/2[2]/2][2][2[2 1 - low, 2- medium, 3 - high, ‘-*-no correlation cs3491 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING LTPc 3024 COURSE OBJECTIVES: The main objectives of this course are to: * Study about uninformed and Heuristic search techniques. * Learn techniques for reasoning under uncertainty * Introduce Machine Learning and supervised learning algorithms * Study about ensembling and unsupervised learning algorithms + Learn the basics of deep learning using neural networks 78CO's-PO's & PSO’s MAPPING CO'sPO's Pso's 712] 3 (4)5/6|/7[8)/9|]|1)|2,/1|,2)3 a 2/2] 3 j2;71/-|-[-|/2/7/i1/1/2]/17/3 2 3 4] 7 (4f/t7/-|-|-1/2/3|/3]/3/3]/1/2 3/2], 3 [f2/t/-7|-[- 2/71/71 /2/2]/3/3 a 7/2; 3 [j2;}-|-|-|[-/3[2/3/3|[71/2/3 5 7/4) 3 [3[/2/-|/-|[-/7/3/3,/1|/2/2]/2 Wel 2 [3 P[tl-[-l-l?l2?7l2?l?l?l[2[ 1- Tow, 2- medium, 3 - high, cs3401 ALGORITHMS LTPc 24 COURSE OBJECTIVES: * To understand and apply the algorithm analysis techniques on searching and sorting algorithms + To critically analyze the efficiency of graph algorithms + Tounderstand different algorithm design techniques + To solve programming problems using state space tree * To understand the concepts behind NP Completeness, Approximation algorithms and randomized algorithms. UNITI INTRODUCTION 9 Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties Best case, Worst case and average case analysis — Recurrence relation: substitution method - Lower bounds ~ searching: linear search, binary search and Interpolation Search, Pattern search: The naive string-matching algorithm - Rabin-Karp algorithm - Knuth-Morris-Pratt algorithm. Sorting: Insertion sort — heap sort UNIT II GRAPH ALGORITHMS, 9 Graph algorithms: Representations of graphs - Graph traversal: DFS — BFS - applications - Connectivity, strong connectivity, bi-connectivity - Minimum spanning tree: Kruskal's and Prim’s algorithm- Shortest path: Bellman-Ford algorithm - Dijkstra’s algorithm - Floyd-Warshall algorithm Network flow: Flow networks - Ford-Fulkerson method — Matching: Maximum bipartite matching UNIT III ALGORITHM DESIGN TECHNIQUES 9 Divide and Conquer methodology: Finding maximum and minimum - Merge sort - Quick sort Dynamic programming: Elements of dynamic programming — Matrix-chain multiplication - Multi stage graph — Optimal Binary Search Trees. Greedy Technique: Elements of the greedy strategy ~ Activity-selection problem — Optimal Merge pattern — Huffman Trees. UNITIV STATE SPACE SEARCH ALGORITHMS 9 Backtracking: n-Queens problem - Hamiltonian Circuit Problem - Subset Sum Problem — Graph colouring problem Branch and Bound: Solving 15-Puzzle problem - Assignment problem - Knapsack Problem - Travelling Salesman Problem 82UNIT V NP-COMPLETE AND APPROXIMATION ALGORITHM 9 Tractable and intractable problems: Polynomial time algorithms — Venn diagram representation - NP-algorithms - NP-hardness and NP-completeness — Bin Packing problem - Problem reduction: TSP —3-CNF problem. Approximation Algorithms: TSP - Randomized Algorithms: concept and application - primality testing - randomized quick sort - Finding k” smallest number 45 PERIODS PRACTICAL EXERCISES: 30 PERIODS Searching and Sorting Algorithms 1, Implement Linear Search. Determine the time required to search for an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n. 2. Implement recursive Binary Search. Determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n. 3. Given a text txt [0...n-1] and a pattern pat [0...m-1], write a function search (char pat [], char txt []) that prints all occurrences of pat [ ]in txt []. You may assume that n > m. 4. Sort a given set of elements using the Insertion sort and Heap sort methods and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n Graph Algorithms 1, Develop a program to implement graph traversal using Breadth First Search 2. Develop a program to implement graph traversal using Depth First Search 3. From a given vertex in a weighted connected graph, develop a program to find the shortest paths to other vertices using Dijkstra’s algorithm, 4, Find the minimum cost spanning tree of a given undirected graph using Prim’s algorithm. 5. Implement Floyd's algorithm for the All-Pairs- Shortest-Paths problem 6. Compute the transitive closure of a given directed graph using Warshall's algorithm. Algorithm Design Techniques 1, Develop a program to find out the maximum and minimum numbers in a given list of n numbers using the divide and conquer technique. 2. Implement Merge sort and Quick sort methods to sort an array of elements and determine the time required to sort. Repeat the experiment for different values of n, the number of ‘elements in the list to be sorted and plot a graph of the time taken versus n. State Space Search Algorithms 1. Implement N Queens problem using Backtracking, Approximation Algorithms Randomized Algorithms 1. Implement any scheme to find the optimal solution for the Traveling Salesperson problem and then solve the same problem instance using any approximation algorithm and determine the error in the approximation. 2. Implement randomized algorithms for finding the k” smallest number. The programs can be implemented in C/C++/JAVAJ Python. TOTAL:75 PERIODS COURSE OUTCOMES: At the end of this course, the students will be able to C01: Analyze the efficiency of algorithms using various frameworks 83