Jntu college of engineering (autonomous):: kakinada




Скачать 126.85 Kb.
НазваниеJntu college of engineering (autonomous):: kakinada
страница1/9
Дата09.10.2012
Размер126.85 Kb.
ТипДокументы
  1   2   3   4   5   6   7   8   9

I Semester

1. Data Structures and Algorithm Analysis

2. Mathematical Foundations of Computer Science

3. Computer Networks & Protocols

4. Database Management Systems

5. Operating Systems

6. Data Structures Through C++ Lab.

7. Application Development Lab – 1 (Covering Experiments :Unix, OS, DBMS, Network Protocols).




II Semester

1. Data Warehousing & Data Mining

2. Web Technologies

3.Object Oriented Software Engineering

4. Elective –I

(A) Information Security & Auditing

(B) Compiler Design

(C) Design Patterns

(D) Mobile Computing

5. Elective –II

(A) Artificial Intelligence

(B) Soft Computing

(C) Distributed Computing

(D) Pattern Recognition & Image Processing

6. Application Development Lab – 2 (covering experiments on Data Warehousing & Mining, Soft Computing & Rational Tools

7. Web Technologies Lab.
M. Tech. - Regular - Computer Science - 2007

JNTU COLLEGE OF ENGINEERING (AUTONOMOUS):: KAKINADA


M.Tech. ( Computer Science & Engineering )

JNTU COLLEGE OF ENGINEERING (AUTONOMOUS):: KAKINADA


M.Tech. ( Computer Science & Engineering )

ADVANCED DATA STRUCTURES AND ALGORITHM ANALYSIS



1. Arrays: Storage structures for arrays. Strings: String operations. Stacks : Definition, representation of stacks, operations on stacks, Application of stacks: Infix, Prefix and Postfix notation, Recursion. Queue: Definition, Sequential representation, operations on queues, Applications of queues. Linked Lists: Singly linked lists, Doubly linked lists, Insertion and deletion operations, stacks, queues, simple applications of linked lists.


2. Trees: Definition, Binary tree, Tree traversal techniques: Inorder, Postorder, Preorder. Threaded binary trees, Binary Search tree. Binary search trees, definition, ADT, implementation, operations- Searching, insertion and deletion, Balanced search trees- AVL trees, definition, height of an AVL tree, representation, operations-insertion, deletion and searching. Red –Black trees-representation, insertion, deletion, searching Splay trees- introduction, the splay operation


3. Skip lists and Hashing: Dictionaries, linear list representation, skip list representation, operations- insertion, deletion and searching, hash table representation, hash functions, collision resolution-separate chaining, open addressing-linear probing, quadratic probing, double hashing, rehashing, extendible hashing, comparison of hashing and skip lists.

4. Searching & Sorting: Linear search, Binary search, Bubble sort, Selection sort, Insertion sort, Radix sort, Heap sort.


5. Pattern matching and Tries: Pattern matching algorithms-Brute force, the Boyer –Moore algorithm, the Knuth-Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix trees, Search engines-Inverted files.

6. Algorithms: Introduction, pseudo code for expressing algorithms, analysis, time complexity and space complexity, O-notation, Omega notation and Theta notation, sets and disjoint set, union and find algorithms. Divide and conquer: General method, Merge sort, Quick sort, Strassen’s matrix Multiplication. Greedy method: General method, optimal storage on tapes, Knapsack problem, Job sequencing with deadlines, Minimum spanning tree, Single source shortest paths.


7. Dynamic Programming: General method, Multistage Graphs, Optimal binary search trees, 0/1 knapsack problem, Reliability design problem, Traveling sales person problem, Flow shop scheduling. Back tracking: General method, n-queen problem, Sum of subsets problem, Graph coloring, Hamiltonian cycles.


8. Branch and Bound: LC search, bounding, LC branch and bound, FIFO branch and bound, Traveling sales person problem. NP-Hard and NP-Complete problems: Basic concepts, non-deterministic algorithms, NP-HARD and NP-COMPLETE classes, COOKS theorem.

Text books:

1. Data structures, Algorithms and Applications in C++, S.Sahni, University press (India) pvt


2. Data Structures using C and C++ - A.M. Tenenbaum Y. Langsam and M. J. Augenstein ltd, 2nd edition, Orient Longman pvt.ltd


3. Fundamentals of computer algorithms – E. Horowitz, Sartaj Sahani & Rajasekaran. Galgotia publications.


4. Fundamentals of computer algorithms – E. Horpwitz & Sartaj Sahani. Galgotia publications.


Reference books:

1. Design and analysis of algorithms, Aho , Ullman. Addison Wesley-1994. ISBN: 981-405-319-8
  1   2   3   4   5   6   7   8   9

Похожие:

Jntu college of engineering (autonomous):: kakinada iconLakireddy bali reddy college of engineering (autonomous), mylavaram 521230

Jntu college of engineering (autonomous):: kakinada iconLakireddy bali reddy college of engineering (autonomous), mylavaram 521230

Jntu college of engineering (autonomous):: kakinada iconLakireddy bali reddy college of engineering (autonomous), mylavaram 521230

Jntu college of engineering (autonomous):: kakinada iconLakireddy bali reddy college of engineering (autonomous), mylavaram 521230

Jntu college of engineering (autonomous):: kakinada iconLakireddy bali reddy college of engineering (autonomous), mylavaram 521230

Jntu college of engineering (autonomous):: kakinada iconThiagarajar college (autonomous) madurai – 9

Jntu college of engineering (autonomous):: kakinada iconThiagarajar college (autonomous), madurai – 9

Jntu college of engineering (autonomous):: kakinada iconST. joseph’s college (autonomous) bangalore

Jntu college of engineering (autonomous):: kakinada iconJawaharlal nehru tenhnological university kakinada: kakinada

Jntu college of engineering (autonomous):: kakinada iconJamal mohamed college (autonomous), tiruchirappalli 20

Разместите кнопку на своём сайте:
Библиотека


База данных защищена авторским правом ©lib.znate.ru 2014
обратиться к администрации
Библиотека
Главная страница