GITAM University Syllabus

I am a student of the GITAM University BA course . I want lost my syllabus of the course while traveling in a city bus . Will you please give me complete syllabus of the GITAM University for BA course.

Can you provide me the syllabus of M. Tech (Information Technology) Program offered by GITAM Institute of Technology as I want to check it before applying for admission in it?

[pooja]

The syllabus of M. Tech (Information Technology) Program offered by GITAM Institute of Technology is as follows:

M. Tech (Information Technology)
First Semester

Unit I
Algorithms, performance analysis-time complexity and space complexity,O-notation, Omega notation and Theta notation, Review of basic data structures - the list ADT, stack ADT, queue ADT, implementation using template classes in C++, sparse matrix representation.

Unit II
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.

Unit III
Search trees: 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. Introduction to Red Black trees and Splay Trees, B-Trees-B-Tree of order m, height of a B-Tree, insertion, deletion and searching, Comparison of Search Trees

Unit IV
Divide and Conquer- General method, applications Binary search, merge sort, quick sort, Strassens matrix multiplication efficient non recursive tree traversal algorithms, Biconnected components. Disjoint set operations, union and find algorithms.

Unit V
Greedy method and Dynamic programming : General method (Greedy), Minimum cost spanning trees, Job sequencing with deadlines, General method (Dynamic Programming), Optimal binary search trees, 0/1 knapsack problem, Ordering Matrix Multiplications .

TEXTBOOKS:
1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education, Third edition.
2. Data structures, Algorithms and Applications in C++, S. Sahni, University press (India) pvt ltd, 2nd edition, Orient Longman pvt. ltd.

REFERENCES:
1. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and D.Mount, Seventh Edition Wiley student edition, John Wiley and Sons.
2. Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson
3. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education.
4. C++, The Complete Reference, 4th Edition, Herbert Schildt, TMH.
5. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI/Pearson


Syllabus M. Tech (Information Technology) GITAM Institute of Technology