[suman]

Discuss about jawaharlal nehru technological university college of engineering anantapur here. Welcome to Courses.ind.in and this page is for jawaharlal nehru technological university college of engineering anantapur discussion. If you are looking for information on jawaharlal nehru technological university college of engineering anantapur then ask your question is as much details as possible in the “Reply” box provided below. The more detailed your question will be, the more easy will it be for our experts to answers your query. And if you have any updated or latest information on jawaharlal nehru technological university college of engineering anantapur, then please share you knowledge with our experts in the “Reply” box below. Your reply will be published here and your knowledge can help many people. Thanks for stopping by at Courses.ind.in. Please visit again.

Can you provide me the syllabus of Master of Technology (Computer Science& Engineering) offered by Department of Computer Science & Engineering of College of Engineering Anantapur (Autonomous) of Jawaharlal Nehru Technological University Anantapur?

[Vishal Kotkar]

The syllabus of Master of Technology (Computer Science& Engineering) offered by Department of Computer Science & Engineering of College of Engineering Anantapur (Autonomous) of Jawaharlal Nehru Technological University Anantapur is as follows:

M.Tech. I– ISem (CSE)
Advanced Data Structures

UNIT-I
Introduction: Algorithm, Algorithm Specification, Performance Analysis, Randomized Algorithms, Divide- And- Conquer: General Method, Binary search, Finding the Maximum and Minimum, Merge sort, Quick Sort, Selection.

UNIT-II:
Stacks and Queues: Templates in C++, The Stack Abstract Data type, The Queue Abstract Data Type, Evaluation of Expressions. Linken Lists: Singly Linked Lists, Representing Lists in C++, Circular Lists, Linked Stacks and Queues.

UNIT-III:
HEAP STRUCTURES: Min/Max Heap, Binary Heap, Applications of Priority Queue, d- Heap, Leftist Heap, Skew Heap, Binomial Queues,

UNIT IV:
Trees: Preliminaries, Binary Trees, Search Tree ADT- Binary Search Trees, AVL Trees, Splay Trees, Trees Traversals, B- Tree.

UNIT-V:
Graphs: The Graphs Abdtract Data Types, Elementary Graph Operations: Depth First Search, Breadth Components, Spanning Trees. Minimum Cost Spanning Trees. NP- Hard and NP- Complete Problems: Basic Concepts, Cooks Theorem, NP-Hard Graph
Problems, NP- Hard Scheduling Problem, NP-Hard CODE generation problem

Text Books:
1. Computer Algorithms, Ellis Horowitz, SartajSahni, SanguthevarRajasekaran, GALGOTIA.
2. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson.
3. Fundamentals of Data structures in C++ Sahni, Horowitz,Mehta, Universities Press, 2nd Edition.