Kurukshetra University Syllabus For M.Tech CSE

I am pursuing M.Tech. in Computer Science & Engineering (CSE) from Kurukshetra University and I have Exam of 1st sem so would you please provide me syllabus of M.Tech. (1st sem) (CSE) of this University ? I will start my preparations according to it and I am sure that I will get good marks .

Can you provide me the syllabus/course structure for M. Tech. (Computer Science & Engineering) Program offered by Kurukshetra University, Kurukshetra?

[Neelu Bhasin]

The syllabus/course structure for M. Tech. (Computer Science & Engineering) Program offered by Kurukshetra University, Kurukshetra is as follows:


MT-CSE-16-11 ADVANCES IN ALGORITHMS

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

Objectives:
The objective of this course is to provide in-depth coverage of advanced data structures and algorithm design techniques. It focuses on learning about analyzing and designing algorithms to solve a problem and learn to find the asymptotic efficiency of an algorithm.

Learning Outcomes:
At the end of this course students should be able to:
• Analyze worst-case running times of algorithms using asymptotic analysis.
• Classify problems into different complexity classes corresponding to both deterministic and randomized algorithms


UNIT – I
Algorithms: Role of algorithms in computing, Asymptotic Notations, Standard notations and common functions.
Recurrence: The maximum-subarray problem, Strassen's algorithm for matrix multiplication substitution and recursion-tree method for solving recurrences, master method for solving recurrences, Proof of the master theorem, Probabilistic Analysis and Randomized Algorithms.


UNIT – II
Sorting: Bubble sort, Heap, Building and maintaining heap, Heapsort, Quicksort, Lower bounds for sorting, Counting sort, radix sort, bucket sort.
Advanced Data Structures: Splay Trees, Top-down splay trees, Red-black Trees, Deterministic skip lists, AA-Trees, Trie, Treaps, K-d Trees.


UNIT – III
Advanced Design and Analysis: Dynamic Programming: matrix-chain multiplication, Longest common subsequence, optimal binary search tree, Greedy algorithms: Huffman codes.
Graph Algorithms: Storage of graphs, traversing a graph, Topological sort, Minimum Spanning Trees, Shortest path problems: Single source and All-pairs shortest path, Maximum Flow networks, matching in bipartite graphs.


UNIT – IV
Miscellaneous Topics: Knapsack Problem and Memory functions, Approximate String Matching, Chinese remainder theorem, Integer factorization, naïve-string matching, Rabin-karp string matching, String matching with finite automata, Knuth-moris-pratt algorithm, finding convex hull, Polynomial time, verification and reducibility, NP-completeness and proofs.

Text Books:
1. Cormen, Thomos, Leiserson, “Introduction to Algorithms”, 3rd Ed., PHI Learning
2. Neapolitan R., Naimipour K., “Foundations of Algorithms”, 4th Ed., Jones and Bartlett Publishers.

Reference Books:
1. Anany Levitin, “Introduction to Design and Analysis of Algorithms”, 2nd Ed., Pearson Education.
2. Cooper A., “Computability Theory”, Chapman and Hall/ CRC Press.
3. Robert Sedgewick, “Algorithms in C: Fundamentals, Data Structures, Sorting, Searching, Parts 1-4”, 3rd Ed., Pearson Education India.
4. Steven Skiena, “The Algorithm Design Manual”, 2nd Ed., Springer India.
5. Reiter, Johnson, “Limits of Computation”, Chapman and Hall/ CRC Press.


Syllabus M. Tech. (Computer Science & Engineering) Kurukshetra University